Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

IPPS
2002
IEEE

favoriteEmaildiscussreport

136views Distributed And Parallel Com...» more IPPS 2002»

Proving Self-Stabilization with a Proof Assistant

13 years 9 months ago

Proving Self-Stabilization with a Proof Assistant

Download www.cs.unh.edu

We present a formalization of a proof of self-stabilization in the Coq proof assistant. Coq is a program allowing to deﬁne mathematical objects and properties, and to make proofs on them in a certiﬁed 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 conﬁgurations are considered as words and the algorithm as a rewriting system on words.

Pierre Courtieu

Real-time Traffic

Coq Proof Assistant | Distributed And Parallel Computing | Generic Proof | IPPS 2002 | Method Net Conﬁgurations |

claim paper

Related Content

» Formal Analysis of a SelfStabilizing Algorithm Using Predicate Diagrams

» JProver Integrating ConnectionBased Theorem Proving into Interactive Proof Assistants

» SourceLevel Proof Reconstruction for Interactive Theorem Proving

» Coloured Petri net refinement specification and correctness proof with Coq

» Proving Bounds on RealValued Functions with Computations

» Proving Properties of Lazy Functional Programs with Sparkle

» Proving ML Type Soundness Within Coq

» Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking

» Formal Proof of Provable Security by GamePlaying in a Proof Assistant

Post Info
More Details (n/a)

Added	15 Jul 2010
Updated	15 Jul 2010
Type	Conference
Year	2002
Where	IPPS
Authors	Pierre Courtieu

Comments (0)