On Verifying Fault Tolerance of Distributed Protocols

DOI10.1007/978-3-540-78800-3_22MaRDI QIDQ5458335zbMATH OpenOpenAlexFDO

Authors Dana Fisman, Orna Kupferman, Yoad Lustig

Publication date 11 April 2008

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78800-3_22

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Synthesis of fault-tolerant distributed systems
• Parameterized model checking of synchronous distributed algorithms by abstraction
• Formal Verification of Distributed Algorithms
• A logic-based framework for verifying consensus algorithms
• Automatic verification of fault-tolerant register emulations

Cites work

• Algorithmic improvements in regular model checking.
• Authenticated Algorithms for Byzantine Agreement
• Automated Technology for Verification and Analysis
• Automatic verification of parameterized networks of processes
• Computer Aided Verification
• Computer Aided Verification
• CONCUR 2004 - Concurrency Theory
• Decision Problems of Finite Automata Design and Related Arithmetics
• Distributed systems. Principles and paradigms.
• scientific article; zbMATH DE number 1614699 (Why is no real title available?)
• scientific article; zbMATH DE number 1670786 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• On Reasoning About Rings
• Optimal distributed algorithm for minimum spanning trees revisited
• Principles of Distributed Systems
• Reasoning about infinite computations
• Regular model checking using inference of regular languages
• Symbolic model checking with rich assertional languages
• Verification, Model Checking, and Abstract Interpretation
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(12)

• An automata-theoretic approach to the verification of distributed algorithms
• Higher-order quantifier elimination, counter simulations and fault-tolerant systems
• Accuracy of message counting abstraction in fault-tolerant distributed algorithms
• scientific article; zbMATH DE number 4195141 (Why is no real title available?)
• Synthesis of fault-tolerant distributed systems
• Protocol combinators for modeling, testing, and execution of distributed systems
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
• Theorem Proving in Higher Order Logics
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
• Communication-closed asynchronous protocols

This page was built for publication: On Verifying Fault Tolerance of Distributed Protocols

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