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.
Type de document :
Communication dans un congrès
Jos C. M. Baeten; Tom Ball; Frank S. Boer. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-7604, pp.209-224, 2012, Theoretical Computer Science. 〈10.1007/978-3-642-33475-7_15〉
https://hal.inria.fr/hal-01556227
Contributeur : Hal Ifip
<>
Soumis le : mardi 4 juillet 2017 - 17:45:48
Dernière modification le : samedi 16 décembre 2017 - 07:18:04
Document(s) archivé(s) le : dimanche 17 décembre 2017 - 13:17:36
Philipp Küfner, Uwe Nestmann, Christina Rickmann. Formal Verification of Distributed Algorithms. Jos C. M. Baeten; Tom Ball; Frank S. Boer. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-7604, pp.209-224, 2012, Theoretical Computer Science. 〈10.1007/978-3-642-33475-7_15〉. 〈hal-01556227〉
