On Runtime Enforcement via Suppressions

07/03/2018
by   Luca Aceto, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2022

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties

Runtime enforcement is a dynamic analysis technique that instruments a m...
research
04/24/2018

Developing Theoretical Foundations for Runtime Enforcement

The ubiquitous reliance on software systems increases the need for ensur...
research
06/03/2019

An Operational Guide to Monitorability

Monitorability delineates what properties can be verified at runtime. Al...
research
11/21/2022

Ain't No Stopping Us Monitoring Now

Not all properties are monitorable. This is a well-known fact, and it me...
research
02/01/2019

Adventures in Monitorability: From Branching to Linear Time and Back Again

This paper establishes a comprehensive theory of runtime monitorability ...
research
09/11/2018

Dynamic logic assigned to automata

A dynamic logic B can be assigned to every automaton A without regard ...
research
12/26/2018

Reasoning About Safety-Critical Information Flow Between Pilot and Computer

This paper presents research results that develop a dynamic logic for re...

Please sign up or login with your details

Forgot password? Click here to reset