Proving Self-Stabilization with a Proof Assistant

Authors:
Pierre Courtieu
Affiliations:
-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 4
Cited 0

An alternative solution to a problem on self-stabilization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Inductively defined types

COLOG '88 Proceedings of the International Conference on Computer Logic
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formalization of a proof of self-stabilization in the Coq proof assistant. Coq is a program allowing to define mathematical objects and properties, and to make proofs on them in a certified way. We use it to formalize a generic proof of stabilization for algorithms running on a linear net or a ring [1]. In this method net configurations are considered as words and the algorithm as a rewriting system on words.