Lang-n-Send Extended: Sending Regular Expressions to Monitors

by   Matteo Cimini, et al.
UMass Lowell

In prior work, Cimini has presented Lang-n-Send, a pi-calculus with language definitions. In this paper, we present an extension of this calculus called Lang-n-Send+m. First, we revise Lang-n-Send to work with transition system specifications rather than its language specifications. This revision allows the use of negative premises in deduction rules. Next, we extend Lang-n-Send with monitors and with the ability of sending and receiving regular expressions, which then can be used in the context of larger regular expressions to monitor the execution of programs. We present a reduction semantics for Lang-n-Send+m, and we offer examples that demonstrate the scenarios that our calculus captures.


page 1

page 2

page 3

page 4


Lang-n-Send: Processes That Send Languages

We present Lang-n-Send, a pi-calculus that is equipped with language def...

Grammar construction methods for extended deterministic expressions

Extended regular expressions with counting and interleaving are widely u...

Regular Boardgames

We present an initial version of Regular Boardgames general game descrip...

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...

Simplified Boardgames

We formalize Simplified Boardgames language, which describes a subclass ...

Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega-Regular Energy Games

ω-regular energy games, which are weighted two-player turn-based games w...

Java & Lambda: a Featherweight Story

We present FJ&Lambda, a new core calculus that extends Featherweight Jav...

Please sign up or login with your details

Forgot password? Click here to reset