%0 Conference Proceedings
%T On Implementing Symbolic Controllability
%+ University of Malta [Malta]
%A Francalanza, Adrian
%A Xuereb, Jasmine
%Z Part 9: Verification and Analysis
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 22th International Conference on Coordination Languages and Models (COORDINATION)
%C Valletta, Malta
%Y Simon Bliudze
%Y Laura Bocchi
%I Springer International Publishing
%3 Coordination Models and Languages
%V LNCS-12134
%P 350-369
%8 2020-06-15
%D 2020
%R 10.1007/978-3-030-50029-0_22
%K Deterministic monitors
%K Symbolic analysis
%K Runtime verification
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-03273999/document
%2 https://inria.hal.science/hal-03273999/file/495623_1_En_22_Chapter.pdf
%L hal-03273999
%U https://inria.hal.science/hal-03273999
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ IFIP-LNCS-12134