Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams

@inproceedings{Cansell2001FormalAO,
  title={Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams},
  author={Dominique Cansell and Dominique M{\'e}ry and Stephan Merz},
  booktitle={GI Jahrestagung},
  year={2001}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

The SPIN Model Checker

View 6 Excerpts
Highly Influenced

A Temporal Logic of Actions

ACM Trans. Program. Lang. Syst. • 1994
View 7 Excerpts
Highly Influenced

On the verification of a self-stabilizing algorithm

S. Merz
Available athttp://www.pst.informatik. uni-muenchen.de/ ̃merz/papers/dijkstra.ps.gz, • 1998
View 2 Excerpts

Isabelle: A Generic Theorem Prover

L. C. Paulson
ofLecture Notes in Computer Science . Springer- Verlag, Berlin, Heidelberg, • 1994
View 2 Excerpts

A belated proof of self-stabilization

Distributed Computing • 1986
View 1 Excerpt

The Model Checker SPIN

IEEE Trans. Software Eng. • 1997
View 6 Excerpts
Highly Influenced