Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/86059
Title: On implementing symbolic controllability
Other Titles: Coordination Models and Languages. COORDINATION 2020. Lecture Notes in Computer Science, vol 12134
Authors: Francalanza, Adrian
Xuereb, Jasmine
Keywords: Computer software -- Verification
Object monitors (Computer software)
Symbolic circuit analysis
Algebra, Boolean
Issue Date: 2020
Publisher: Springer
Citation: Francalanza, A., & Xuereb, J. (2020). On implementing symbolic controllability. 22nd IFIP WG 6.1 International Conference, COORDINATION 2020, Valletta. 350-369.
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.
URI: https://www.um.edu.mt/library/oar/handle/123456789/86059
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
On Implementing Symbolic Controllability.pdf
  Restricted Access
597.32 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.