%0 Conference Proceedings
%T Tutorial: Parameterized Verification with Byzantine Model Checker
%+ Informal systems [Vienna]
%+ Technische Universität Munchen - Technical University Munich - Université Technique de Munich (TUM)
%+ Vienna University of Technology = Technische Universität Wien (TU Wien)
%A Konnov, Igor
%A Lazić, Marijana
%A Stoilkovska, Ilina
%A Widder, Josef
%Z Part 2: Tutorials
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Valletta, Malta
%Y Alexey Gotsman
%Y Ana Sokolova
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-12136
%P 189-207
%8 2020-06-15
%D 2020
%R 10.1007/978-3-030-50086-3_11
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems of distributed computing, such as reliable broadcast, two-phase commit, and consensus. Moreover, threshold guards can be found in recent blockchain algorithms such as Tendermint consensus. In this tutorial, we give an overview of the techniques implemented in Byzantine Model Checker (ByMC). ByMC implements several techniques for automatic verification of threshold-guarded distributed algorithms. These algorithms have the following features: (1) up to t of processes may crash or behave Byzantine; (2) the correct processes count messages and make progress when they receive sufficiently many messages, e.g., at least $$t+1$$; (3) the number n of processes in the system is a parameter, as well as t; (4) and the parameters are restricted by a resilience condition, e.g., $$n > 3t$$. Traditionally, these algorithms were implemented in distributed systems with up to ten participating processes. Nowadays, they are implemented in distributed systems that involve hundreds or thousands of processes. To make sure that these algorithms are still correct for that scale, it is imperative to verify them for all possible values of the parameters.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-03283235/document
%2 https://inria.hal.science/hal-03283235/file/495615_1_En_11_Chapter.pdf
%L hal-03283235
%U https://inria.hal.science/hal-03283235
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-12136