Assertion-based proof checking of chang-roberts leader election in PVS

Authors:
Judi Romijn;Wieger Wesselink;Arjan Mooij
Affiliations:
Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;School of Computer Science, The University of Nottingham, Nottingham, United Kingdom
Venue:
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Year:
2007

Citing 13
Cited 2

Specification and verification of various distributed leader election algorithms for unidirectional ring networks

Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
An improved algorithm for decentralized extrema-finding in circular configurations of processes

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Proving Invariants of I/O Automata with TAME

Automated Software Engineering
Optimal Resilient Distributed Algorithms for Ring Election

IEEE Transactions on Parallel and Distributed Systems
Owicki/Gries in Isabelle/HOL

FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Proving performance propterties (even probabilistic ones)

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Towards a customizable PVS

Towards a customizable PVS
Techniques for formal verification of concurrent and distributed program traces

Techniques for formal verification of concurrent and distributed program traces
Analysis of A Leader Election Algorithm in uCRL

CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
Incremental verification of owicki/gries proof outlines using PVS

ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Progress in deriving concurrent programs: emphasizing the role of stable guards

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction

Can Component/Service-Based Systems Be Proved Correct?

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Calculating and composing progress properties in terms of the leads-to relation

ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report a case study in automated incremental assertion-based proof checking with PVS. Given an annotated distributed algorithm, our tool ProPar generates the proof obligations for partial correctness, plus a proof script per obligation. ProPar then lets PVS attempt to discharge all obligations by running the proof scripts. The Chang-Roberts algorithm elects a leader on a unidirectional ring with unique identities. With ProPar, we check its correctness with a very high degree of automation: over 90% of the proof obligations is discharged automatically. This case study underlines the feasibility of the approach and is, to the best of our knowledge, the first verification of the Chang-Roberts algorithm for arbitrary ring size in a proof checker.