Skip to Main content Skip to Navigation
Conference papers

On Implementing Symbolic Controllability

Abstract : Runtime Monitors observe the execution of a system with the aim of reaching a verdict about it. One property that is expected of monitors is consistent verdict detections; this property was characterised in prior work via a symbolic analysis called symbolic controllability. This paper explores whether the proposed symbolic analysis lends itself well to the construction of a tool that checks monitors for this deterministic behaviour. We implement a prototype that automates this symbolic analysis, and establish complexity upper bounds for the algorithm used. We also consider a number of optimisations for the implemented prototype, and assess the potential gains against benchmark monitors.
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, June 29, 2021 - 4:13:30 PM
Last modification on : Tuesday, June 29, 2021 - 4:30:33 PM
Long-term archiving on: : Thursday, September 30, 2021 - 7:15:08 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2023-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Adrian Francalanza, Jasmine Xuereb. On Implementing Symbolic Controllability. 22th International Conference on Coordination Languages and Models (COORDINATION), Jun 2020, Valletta, Malta. pp.350-369, ⟨10.1007/978-3-030-50029-0_22⟩. ⟨hal-03273999⟩



Record views