A Case-Study in Component-Based Mechanical Verification of Fault-Tolerant Programs1 To appear in Fourth Workshop on Self-Stabilization (WSS’99) Austin, Texas, USA


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… (More)