The formal verification of an algorithm for interactive consistency under a hybrid fault model
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 292-304
- https://doi.org/10.1007/3-540-56922-7_24
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Formal verification of algorithms for critical systemsIEEE Transactions on Software Engineering, 1993
- Formal verification for fault-tolerant architectures: Some lessons learnedPublished by Springer Nature ,1993
- Machine checked proofs of the design of a fault-tolerant circuitFormal Aspects of Computing, 1992
- Mechanical verification of a generalized protocol for Byzantine fault tolerant clock synchronizationPublished by Springer Nature ,1992
- MJRTY—A Fast Majority Vote AlgorithmPublished by Springer Nature ,1991
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980