Decentralized asynchronous crash-resilient runtime verification

DOI10.4230/LIPICS.CONCUR.2016.16MaRDI QIDQ4608668zbMATH OpenFDO

Authors Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2016.16

zbMATH Keywords

distributed algorithmsfault-toleranceruntime monitoring

Mathematics Subject Classification ID

Many-valued logic (03B50) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An LTL proof system for runtime verification
• Comparing LTL semantics for runtime verification
• Failure-aware runtime verification of distributed systems
• A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring

Cited in

(11)

• Deciding and verifying network properties locally with few output bits
• An LTL proof system for runtime verification
• A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
• Distributed system contract monitoring
• Axiomatizing recursion-free, regular monitors
• Decentralized Asynchronous Crash-resilient Runtime Verification
• A theory of monitors
• Consistently-detecting monitors
• Runtime verification of partially-synchronous distributed system
• Failure-aware runtime verification of distributed systems
• Organising LTL monitors over distributed systems with a global clock

This page was built for publication: Decentralized asynchronous crash-resilient runtime verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608668)