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

DOI10.1007/s00165-007-0027-6zbMath1125.68107OpenAlexW1993644612MaRDI QIDQ2642981

Damián Barsotti, Leonor Prensa Nieto, Alwen Tiu

Publication date: 6 September 2007

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00097383/file/fac07.pdf

zbMATH Keywords

Theorem provingVerificationClock synchronizationCombination of deductive tools

Mathematics Subject Classification ID

Related Items (5)

Adapting Real Quantifier Elimination Methods for Conflict Set Computation ⋮ Combining decision procedures by (model-)equality propagation ⋮ Combining Decision Procedures by (Model-)Equality Propagation ⋮ Extending Sledgehammer with SMT Solvers ⋮ Extending Sledgehammer with SMT solvers

Uses Software

• Isabelle
• Prosper
• Isabelle/HOL
• SMT-LIB
• TPTP
• Yices
• Isar
• HOL Light
• CVC Lite
• PROSPER
• Calife
• Archive Formal Proofs
• clock synchronization
• Schneider clock synchronization

Cites Work

• An upper and lower bound for clock synchronization
• Synchronizing clocks in the presence of faults
• Automated Reasoning
• Tools and Algorithms for the Construction and Analysis of Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verification of clock synchronization algorithms: experiments on a combination of deductive tools