Formal Verification of Consensus Algorithms in a Proof Assistant - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Formal Verification of Consensus Algorithms in a Proof Assistant

Abstract

Consensus is regarded as the fundamental problem that must be solved to implement a fault-tolerant distributed system. It requires nodes to eventually agree on a common value among the initial values held by each of them. Agreement should be reached despite the failures of some components (process or link). Depending on the timing and failure models, numerous Consensus algorithms have been proposed in the literature. We are studying techniques for proving the correctness of these algorithms using the interactive proof assistant Isabelle, aiming for a high level of automation.
Fichier principal
Vignette du fichier
sho-isabelle.pdf (28.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00539899 , version 1 (25-11-2010)

Identifiers

  • HAL Id : inria-00539899 , version 1

Cite

Henri Debrat, Bernadette Charron-Bost, Stephan Merz. Formal Verification of Consensus Algorithms in a Proof Assistant. 2010 Grande Region Security and Reliability Day, Mar 2010, Saarbrücken, Germany. ⟨inria-00539899⟩
283 View
182 Download

Share

Gmail Facebook X LinkedIn More