Log In Sign Up

Can determinism and compositionality coexist in RML? (extended version)

by   Davide Ancona, et al.

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.


page 1

page 2

page 3

page 4


Can determinism and compositionality coexist in RML?

Runtime verification (RV) consists in dynamically verifying that the eve...

Operational Semantics of Process Monitors

CSPe is a specification language for runtime monitors that can directly ...

Revisiting Elementary Denotational Semantics

Operational semantics have been enormously successful, in large part due...

Decentralized LTL Enforcement

We consider the runtime enforcement of Linear-time Temporal Logic formul...

A Calculus for Modeling Floating Authorizations

Controlling resource usage in distributed systems is a challenging task ...

Quantifiers metamorphoses. Generalizations, variations, algorithmic semantics

This article contains ideas and their elaboration for quantifiers, which...

Formal Small-step Verification of a Call-by-value Lambda Calculus Machine

We formally verify an abstract machine for a call-by-value lambda-calcul...