Verification of clock synchronization algorithms: experiments on a combination of deductive tools

Authors:
Damián Barsotti;Leonor Prensa Nieto;Alwen Tiu
Affiliations:
Universidad Nacional de Córdoba, Ciudad Universitaria, 5000, Córdoba, Argentina;LORIA, 54506, Vandoeuvre-lès-Nancy, France;Australian National University and National ICT Australia, Research School of Information Sciences and Engineering, 0200, Canberra, ACT, Australia
Venue:
Formal Aspects of Computing
Year:
2007

Citing 0
Cited 7

Combining Decision Procedures by (Model-)Equality Propagation

Electronic Notes in Theoretical Computer Science (ENTCS)
A higher-order logical framework for the algorithmic debugging and verification of declarative programs

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Formal Correctness Proof for DPLL Procedure

Informatica
Automated formal verification of the TTEthernet synchronization quality

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Extending Sledgehammer with SMT solvers

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Combining decision procedures by (model-)equality propagation

Science of Computer Programming
The TTEthernet synchronisation protocols and their formal verification

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.00

Visualization

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.