  Runtime verification (RV) consists in dynamically verifying that the event
traces generated by single runs of a system under scrutiny (SUS) are compliant
with the formal specification of its expected properties. RML (Runtime
Monitoring Language) is a simple but expressive Domain Specific Language for
RV; its semantics is based on a trace calculus formalized by a deterministic
rewriting system which drives the implementation of the interpreter of the
monitors generated by the RML compiler from the specifications. While
determinism of the trace calculus ensures better performances of the generated
monitors, it makes the semantics of its operators less intuitive. In this paper
we move a first step towards a compositional semantics of the RML trace
calculus, by interpreting its basic operators as operations on sets of
instantiated event traces and by proving that such an interpretation is
equivalent to the operational semantics of the calculus.

Logic in Computer Science;Programming Languages