Please use this identifier to cite or link to this item:
Title: On runtime enforcement via suppressions
Authors: Aceto, Luca
Cassar, Ian
Francalanza, Adrian
Ingólfsdóttir, Anna
Keywords: Software engineering
Computer software -- Verification
Computer logic
Object monitors (Computer software)
Issue Date: 2018
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH
Citation: Aceto, L., Cassar, I., Francalanza, A., & Ingólfsdóttir, A. (2018). On runtime enforcement via suppressions. 29th International Conference on Concurrency Theory (CONCUR 2018), Beijing. 1-38.
Abstract: Runtime enforcement is a dynamic analysis technique that uses monitors to enforce the behaviour specified by some correctness property on an executing system. The enforceability of a logic captures the extent to which the properties expressible via the logic can be enforced at runtime. We study the enforceability of Hennessy-Milner Logic with Recursion (muHML) with respect to suppression enforcement. We develop an operational framework for enforcement which we then use to formalise when a monitor enforces a muHML property. We also show that the safety syntactic fragment of the logic, sHML, is enforceable by providing an automated synthesis function that generates correct suppression monitors from sHML formulas.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
On Runtime Enforcement via Suppressions.pdf904.76 kBAdobe PDFView/Open

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