Formally verified byzantine agreement in presence of link faults

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2002, Pages 608-616

  Schmid, Ulrich ^a   Weiss, Bettina ^a   Rushby, John ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Assumption coverage; Byzantine agreement; Consensus; Fault models; Fault tolerant distributed systems; Formal verification; Impossibility results; Link faults; Lower bounds

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; TELECOMMUNICATION LINKS;

LINK FAULTS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0036375182     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Exploiting omissive faults in synchronous approximate agreement
2. Simulating reliable links with unreliable links in the presence of process crashes
3. Consensus in the presence of partial synchrony
4. Easy impossibility proofs for the distributed consensus problem
5. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults
6. Notes on data base operating systems
7. Fault-tolerant broadcasts and related problems
8. The Byzantine generals problem
9. Formal verification of an algorithm for interactive consistency under a hybrid fault model
10. A formally verified algorithm for interactive consistency under a hybrid fault model
11. Consensus with dual failure modes
12. PVS: Combining specification, proof checking, and model checking
13. Distributed agreement in the presence of processor and communication faults
14. Distributed agreement in the presence of communication and process failures
15. A formally verified algorithm for clock synchronization under a hybrid fault model
16. Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
17. Orthogonal accuracy clock synchronization
18. How to model link failures: A perception-based fault model
19. How to reconcile fault-tolerant interval intersection with the Lipschitz condition
20. Byzantine agreement in the presence of mixed faults on processors and links
21. Interactive consistency with multiple failure modes
22. The customizable fault/error model for dependable distributed systems