Loading...
Please wait, while we are loading the content...
Similar Documents
Under consideration for publication in Formal Aspects of Computing Verification of Clock Synchronization Algorithms: Experiments on a combination of deductive tools
| Content Provider | CiteSeerX |
|---|---|
| Author | Barsotti, Damian Nieto, Leonor Prensa Tiu, Alwen |
| Abstract | Abstract. We report on an experiment in combining the theorem prover Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study for the experiment we verify several averaging clock synchronization algorithms. We present a formalization of Schneider’s generalized clock synchronization protocol [Sch87] in Isabelle/HOL. Then, we verify that the convergence functions used in two clock synchronization algorithms, namely, the Interactive Convergence Algorithm (ICA) of Lamport and Melliar-Smith [LMS85] and the Fault-tolerant Midpoint algorithm of Lundelius-Lynch [LL84], satisfy Schneider’s general conditions for correctness. The proofs are completely formalized in Isabelle/HOL. We identify parts of the proofs which are not fully automatically proven by Isabelle built-in tactics and show that these proofs can be handled by automatic first-order provers with support for arithmetics. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Clock Synchronization Algorithm Formal Aspect Deductive Tool Computing Verification Isabelle Hol Isabelle Built-in Tactic Satisfy Schneider Interactive Convergence Algorithm Theorem Prover Isabelle Distributed Protocol General Condition Automatic First-order Arithmetic Provers Melliar-smith Lms85 Automatic First-order Provers Clock Synchronization Protocol Sch87 Fault-tolerant Midpoint Algorithm Lundelius-lynch Ll84 Convergence Function |
| Content Type | Text |
| Resource Type | Article |