Skip to Main content Skip to Navigation
Conference papers

Formal Verification of Distributed Algorithms

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01556227
Contributor : Hal Ifip <>
Submitted on : Tuesday, July 4, 2017 - 5:45:48 PM
Last modification on : Monday, December 28, 2020 - 10:22:04 AM
Long-term archiving on: : Sunday, December 17, 2017 - 1:17:36 PM

File

978-3-642-33475-7_15_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

398

Files downloads

640