Monitoring Hyperproperties with Circuits

Aceto, Luca; Achilleos, Antonis; Anastasiadi, Elli; Francalanza, Adrian

doi:10.1007/978-3-031-08679-3_1

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For deterministic input-output programs, whose traces are pairs of an input and an output, it is suggested that monitoring of 2-safety ∀ 2 HyperLTL formulas be reduced to the monitoring of trace properties [8]. The authors of [28] propose Hyper-µHML, a linear-time logic for the specification of hyperproperties. They also devise runtime monitors utilizing circuit-like structures for the formulas of a very restricted fragment of their logic.…”

Section: Related Workmentioning

confidence: 99%

Runtime Monitoring of Nonterminating Systems for Alternation-Free HyperLTL Formulas

Damanafshan

Fallah

2023

Preprint

View full text Add to dashboard Cite

Runtime monitoring for a hyperproperty is aimed at discovering the relationships among the execution traces of the system under monitoring at run time so that a verdict of satisfaction or violation can be given on the system. For nonterminating systems, whose traces are of infinite length, such relationships can hardly be established as the monitor can naturally observe the prefixes of only one single running trace of the system. In order to deal with this problem, we suggest that the monitor be provided with an over-approximation of the set of possible traces of the nonterminating system, and at the same time, be able to observe the growing prefixes of a fixed number of traces produced by the same number of running copies of the system. To devise such monitors, we first introduce the concept of k-trace monitorability of a hyperproperty given an over-approximation of the system under monitoring, which essentially says it is always hoped that a verdict will be issued on the system if k growing prefixes of the traces in the given over-approximation can be observed at run time. We also propose an algorithm that takes an alternation-free HyperLTL formula together with a Kripke structure representing the given over-approximation and decides if the formula is k-trace monitorable for a given positive integer k. The idea underlying this algorithm is then used to suggest a generic runtime monitor for k-trace monitorable alternation-free HyperLTL formulas, which is a Moore machine running on the prefixes of the traces produced by k exact copies of the nonterminating system under monitoring.

show abstract

Section: Related Workmentioning

confidence: 99%

Runtime Monitoring of Nonterminating Systems for Alternation-Free HyperLTL Formulas

Damanafshan

Fallah

2023

Preprint

View full text Add to dashboard Cite

show abstract

Monitoring Hyperproperties with Prefix Transducers

Chalupa,

Henzinger

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Hyperproperties are properties that relate multiple execution traces. Previous work on monitoring hyperproperties focused on synchronous hyperproperties, usually specified in HyperLTL. When monitoring synchronous hyperproperties, all traces are assumed to proceed at the same speed. We introduce (multi-trace) prefix transducers and show how to use them for monitoring synchronous as well as, for the first time, asynchronous hyperproperties. Prefix transducers map multiple input traces into one or more output traces by incrementally matching prefixes of the input traces against expressions similar to regular expressions. The prefixes of different traces which are consumed by a single matching step of the monitor may have different lengths. The deterministic and executable nature of prefix transducers makes them more suitable as an intermediate formalism for runtime verification than logical specifications, which tend to be highly non-deterministic, especially in the case of asynchronous hyperproperties. We report on a set of experiments about monitoring asynchronous version of observational determinism.

show abstract