Sciweavers

99 search results - page 1 / 20
» Proving Self-Stabilization with a Proof Assistant
Sort
View
IPPS
2002
IEEE
13 years 9 months ago
Proving Self-Stabilization with a Proof Assistant
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 proof...
Pierre Courtieu
GI
2001
Springer
13 years 9 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
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 base...
Dominique Cansell, Dominique Méry, Stephan ...
CADE
2001
Springer
14 years 4 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...
TPHOL
2007
IEEE
13 years 11 months ago
Source-Level Proof Reconstruction for Interactive Theorem Proving
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
Lawrence C. Paulson, Kong Woei Susanto
ISSE
2010
12 years 11 months ago
Coloured Petri net refinement specification and correctness proof with Coq
In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of thei...
Christine Choppy, Micaela Mayero, Laure Petrucci