Lang-n-Send Extended: Sending Regular Expressions to Monitors
Matteo Cimini (University of Massachusetts Lowell, USA)

TL;DR
This paper extends the Lang-n-Send calculus to include monitors and the ability to send and receive regular expressions, enabling more expressive runtime program monitoring.
Contribution
It introduces Lang-n-Send+m, a revised calculus that incorporates transition system specifications, negative premises, and regular expression communication for enhanced monitoring.
Findings
Extended calculus with monitors and regex communication
Reduction semantics for Lang-n-Send+m
Demonstrative examples of monitoring scenarios
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
