Verification of Clock Synchronization Algorithms: Experiments on a combination of deductive tools - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Aspects of Computing Year : 2007

Verification of Clock Synchronization Algorithms: Experiments on a combination of deductive tools

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 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 and the Fault-tolerant Midpoint algorithm of Lundelius-Lynch, 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.
Fichier principal
Vignette du fichier
fac07.pdf (246.92 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00097383 , version 1 (21-09-2006)

Identifiers

Cite

Damian Barsotti, Leonor Prensa Nieto, Alwen Tiu. Verification of Clock Synchronization Algorithms: Experiments on a combination of deductive tools. Formal Aspects of Computing, 2007, 19 (3), pp.321-341. ⟨10.1007/s00165-007-0027-6⟩. ⟨inria-00097383⟩
62 View
308 Download

Altmetric

Share

Gmail Facebook X LinkedIn More