Formal Analysis of a Self-Stabilizing Algorithm - Using Predicate Diagrams - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Formal Analysis of a Self-Stabilizing Algorithm - Using Predicate Diagrams

Stephan Merz

Abstract

We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized based on a combination of theorem proving and model checking to guarantee the correctness of these refinements. We argue that the framework of predicate diagrams is flexible enough to carry out a non-trivial verification task, that it provides a natural interface between automatic and interactive verification technology, and that it allows to present the correctness argument in an accessible manner.
Not file

Dates and versions

inria-00110548 , version 1 (30-10-2006)

Identifiers

  • HAL Id : inria-00110548 , version 1

Cite

Dominique Cansell, Dominique Méry, Stephan Merz. Formal Analysis of a Self-Stabilizing Algorithm - Using Predicate Diagrams. Integrating Diagrammatic and Formal Specification Techniques, GI Fachgruppe 0.1.7 Specification and Semantics, 2001, Wien, Austria, pp.39-45. ⟨inria-00110548⟩
281 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More