A case-study in component-based mechanical verification of fault-tolerant programs

S.S. Kulkarni, J. Rushby, N. Shankar
Proceedings 19th IEEE International Conference on Distributed Computing Systems  
In this paper, we present a case study to demonstrate that the decomposition of a fault-tolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra's token ring program in a component-based manner. We also demonstrate the advantages of component based mechanical verification.
doi:10.1109/slfstb.1999.777484 fatcat:b57rz22tn5aj7pmojhhbaduj4y