Verification of clock synchronization algorithms: Experiments on a combination of deductive tools
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Formal Aspects of Computing|
|01_Barsotti_Verification_of_clock_2007.pdf||2.08 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.