Runtime verification for decentralised and distributed systems
This chapter surveys runtime verification research related to distributed systems. We report
solutions that study how to monitor system with some distributed characteristic, solutions that …
solutions that study how to monitor system with some distributed characteristic, solutions that …
A survey of challenges for runtime verification from advanced application domains (beyond software)
Runtime verification is an area of formal methods that studies the dynamic analysis of
execution traces against formal specifications. Typically, the two main activities in runtime …
execution traces against formal specifications. Typically, the two main activities in runtime …
Mc3d: Motion contrast 3d scanning
Structured light 3D scanning systems are fundamentally constrained by limited sensor
bandwidth and light source power, hindering their performance in real-world applications …
bandwidth and light source power, hindering their performance in real-world applications …
Decentralized runtime verification of LTL specifications in distributed systems
M Mostafa, B Bonakdarpour - 2015 IEEE International Parallel …, 2015 - ieeexplore.ieee.org
Runtime verification is a lightweight automated formal method for specification-based
runtime monitoring as well as testing of large real-world systems. While numerous …
runtime monitoring as well as testing of large real-world systems. While numerous …
Monitoring events that carry data
Very early runtime verification systems focused on monitoring what we can refer to as
propositional events: just names of events. For this, finite state machines, standard regular …
propositional events: just names of events. For this, finite state machines, standard regular …
Survey of distributed decision
L Feuilloley, P Fraigniaud - arXiv preprint arXiv:1606.04434, 2016 - arxiv.org
We survey the recent distributed computing literature on checking whether a given
distributed system configuration satisfies a given boolean predicate, ie, whether the …
distributed system configuration satisfies a given boolean predicate, ie, whether the …
Approximate proof-labeling schemes
K Censor-Hillel, A Paz, M Perry - Theoretical Computer Science, 2020 - Elsevier
We study a new model of verification of boolean predicates over distributed networks. Given
a network configuration, the proof-labeling scheme (PLS) model defines a distributed proof …
a network configuration, the proof-labeling scheme (PLS) model defines a distributed proof …
Randomized proof-labeling schemes
P Fraigniaud, B Patt-Shamir, M Perry - Distributed Computing, 2019 - Springer
Proof-labeling schemes, introduced by Korman et al.(Distrib Comput 22 (4): 215–233, 2010.
https://doi. org/10.1007/s00446-010-0095-3), are a mechanism to certify that a network …
https://doi. org/10.1007/s00446-010-0095-3), are a mechanism to certify that a network …
A theory of monitors
A Francalanza - Foundations of Software Science and Computation …, 2016 - Springer
We develop a behavioural theory for monitors—software entities that passively analyse the
runtime behaviour of systems so as to infer properties about them. First, we extend the …
runtime behaviour of systems so as to infer properties about them. First, we extend the …
Consistently-detecting monitors
A Francalanza - 28th International Conference on Concurrency …, 2017 - drops.dagstuhl.de
We study a contextual definition for deterministic monitoring based on consistent detections.
It is defined in terms of the observed behaviour of the monitor when instrumented over …
It is defined in terms of the observed behaviour of the monitor when instrumented over …