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

08/09/2022
by   Matteo Cimini, et al.
UMass Lowell
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/24/2022

Lang-n-Send: Processes That Send Languages

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

Grammar construction methods for extended deterministic expressions

Extended regular expressions with counting and interleaving are widely u...
06/08/2017

Regular Boardgames

We present an initial version of Regular Boardgames general game descrip...
12/11/2020

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...
06/08/2016

Simplified Boardgames

We formalize Simplified Boardgames language, which describes a subclass ...
05/01/2020

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

ω-regular energy games, which are weighted two-player turn-based games w...
01/15/2018

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