Formal Verification of Distributed Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Formal Verification of Distributed Algorithms


We exhibit a methodology to develop mechanically-checkable parameterized proofs of the correctness of fault-tolerant round-based distributed algorithms in an asynchronous message-passing setting. Motivated by a number of case studies, we sketch how to replace often-used informal and incomplete pseudo code by mostly syntax-free formal and complete definitions of a global-state transition system. Special emphasis is put on the required deepening of the level of proof detail to be able to check them within an interactive theorem proving environment.
Fichier principal
Vignette du fichier
978-3-642-33475-7_15_Chapter.pdf (339.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01556227 , version 1 (04-07-2017)





Philipp Küfner, Uwe Nestmann, Christina Rickmann. Formal Verification of Distributed Algorithms. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.209-224, ⟨10.1007/978-3-642-33475-7_15⟩. ⟨hal-01556227⟩
129 View
565 Download



Gmail Facebook X LinkedIn More