A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)

DOI10.1007/978-3-540-71316-6_27MaRDI QIDQ5756509zbMATH OpenOpenAlexFDO

Authors Adrian Francalanza, Matthew Hennessy

Publication date 4 September 2007

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71316-6_27

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Recommendations

• Formal verification of Multi-Paxos for distributed consensus
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• On Verifying Fault Tolerance of Distributed Protocols
• A logic-based framework for verifying consensus algorithms
• Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
• Verification of consensus algorithms using satisfiability solving
• Using bisimulation proof techniques for the analysis of distributed abstract machines
• Proof rules for fault tolerant distributed programs

Cited in

(8)

• Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
• Distributed consensus, revisited
• A logic-based framework for verifying consensus algorithms
• scientific article; zbMATH DE number 1953037 (Why is no real title available?)
• Formal model-driven design of distributed algorithms
• Much ado about nothing?
• Store locally, prove globally
• A theory of system behaviour in the presence of node and link failure

This page was built for publication: A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)

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