A formally verified algorithm for clock synchronization under a hybrid fault model

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn Part F129432, Issue , 1994, Pages 304-313

  Rushby, John ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; DISTRIBUTED COMPUTER SYSTEMS; MECHANICAL CLOCKS;

ARBITRARY FAULTS; CLOCK SYNCHRONIZATION; DISTRIBUTED CONSENSUS; FORMAL SPECIFICATION AND VERIFICATION; INITIAL COSTS; INTELLECTUAL RESOURCES; MODIFIED ALGORITHMS; STANDARD ALGORITHMS;

FORMAL VERIFICATION;

EID: 2442446248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/197917.198115     Document Type: Conference Paper

References (22)

1. Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. Journal of the ACM, 33(3):499-516, July 1986.
2. Juan A. Garay and Kenneth J. Perry. A continuum of failure models for distributed computing. In A. Segall and S. Zaks, editors, Distributed Algorithms (6th International Workshop WDAG '92), volume 647 of Lecture Notes in Computer Science, pages 153-165, Haifa, Israel, November 1992. Springer-Verlag.
3. A. H. Infis and W. R. Moore. Economic approach to fault-tolerant synchronization. IEE Proceedings, Part E: Computers and Digital Techniques, 135(2):82-86, March 1988.
4. R. M. Kieckhafer, C. J. Walter, A. M. Finn, and P. M. Thambidurai. The MAFT architecture for distributed fault tolerance. IEEE Transactions on Computers, 37(4):398-405, April 1988.
5. L. Lamport and P. M. Melliar-Smith. Synchronizing clocks in the presence of faults. Journal of the ACM, 32(1):52-78, January 1985.
6. Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
7. Patrick Lincoln and John Rushby. Formal verification of an algorithm for interactive consistency under a hybrid fault model. In Costas Courcoubetis, editor, Computer Aided Verification, CAV '93, volume 697 of Lecture Notes in Computer Science, pages 292-304, Elounda, Greece, June/July 1993. Springer-Verlag.
8. Patrick Lincoln and John Rushby. A formally verified algorithm for interactive consistency under a hybrid fault model. In Fault Tolerant Computing Symposium 23, pages 402-411, Toulouse, France, June 1993. IEEE Computer Society.
9. Erwin Liu and John Rushby. A formally verified module to support Byzantine fault-tolerant clock synchronization. Project report 8200-130, Computer Science Laboratory, SRI International, Menlo Park, CA, December 1993.
10. Fred J. Meyer and Dhiraj K. Pradhan. Consensus with dual failure modes. IEEE Transactions on Parallel and Distributed Systems, 2(2):214-222, April 1991.
11. Paul S. Miner. Verification of fault-tolerant clock synchronization systems. NASA Technical Paper 3349, NASA Langley Research Center, Hampton, VA, November 1993.
12. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In Deepak Kapur, editor, 11th International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Artificial Intelligence, pages 748-752, Saratoga, NY, June 1992. Springer-Verlag.
13. Daniel L. Palumbo and R. Lynn Graham. Experimental validation of clock synchronization algorithms. NASA Technical Paper 2857, NASA Langley Research Center, Hampton, VA, July 1992.
14. Kenneth J. Perry and Sam Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, SE-12(3):477-481, March 1986.
15. John Rushby and Friedrich von Henke. Formal verification of the Interactive Convergence clock synchronization algorithm using EHDM. Technical Report SRI-CSL-89-3R, Computer Science Laboratory, SRI International, Menlo Park, CA, February 1989 (Revised August 1991). Original version also available as NASA Contractor Report 4239, June 1989.
16. John Rushby and Friedrich von Henke. Formal verification of algorithms for critical systems. IEEE Transactions on Software Engineering, 19(1):13-23, January 1993.
17. John Rushby, Friedrich von Henke, and Sam Owre. An introduction to formal specification and verification using EHDM. Technical Report SRI-CSL-91-2, Computer Science Laboratory, SRI International, Menlo Park, CA, February 1991.
18. Fred B. Schneider. Understanding protocols for Byzantine clock synchronization. Technical Report 87-859, Department of Computer Science, Cornell University, Ithaca, NY, August 1987.
19. Natarajan Shankar. Mechanical verification of a generalized protocol for Byzantine fault-tolerant clock synchronization. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of Lecture Notes in Computer Science, pages 217-236, Nijmegen, The Netherlands, January 1992. Springer-Verlag.
20. Philip Thambidurai and You-Keun Park. Interactive consistency with multiple failure modes. In 7th Symposium on Reliable Distributed Systems, pages 93-100, Columbus, OH, October 1988. IEEE Computer Society.
21. J. Lundelius Welch and N. Lynch. A new faulttolerant algorithm for clock synchronization. Information and Computation, 77(1):1-36, April 1988.
22. William D. Young. Verifying the Interactive Convergence clock-synchronization algorithm using the Boyer-Moore prover. NASA Contractor Report 189649, NASA Langley Research Center, Hampton, VA, April 1992. (Work performed by Computational Logic Incorporated).