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

In prior work, Cimini has presented L ANG - N -S END , a π -calculus with language definitions. In this paper, we present an extension of this calculus called L ANG - N -S END +m . First, we revise L ANG - N -S END 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 L ANG - N -S END 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 L ANG - N -S END +m , and we offer examples that demonstrate the scenarios that our calculus captures.