What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
From MaRDI portal
Publication:3179167
DOI10.1007/978-3-319-41579-6_2zbMath1461.68115OpenAlexW2298937928MaRDI QIDQ3179167
No author found.
Publication date: 21 December 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-2942
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)
Related Items (5)
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Cardinality constraints for arrays (decidability results and applications) ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ Higher-order quantifier elimination, counter simulations and fault-tolerant systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- A Logic-Based Framework for Verifying Consensus Algorithms
- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
- Counterexample-guided abstraction refinement for symbolic model checking
- Bosco: One-Step Byzantine Asynchronous Consensus
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Unreliable failure detectors for reliable distributed systems
- Decidability of Parameterized Verification
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
- The MathSAT5 SMT Solver
This page was built for publication: What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
