Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata
Authors: 
Tom Baumeister, Paul Eichler, Swen Jacobs, Mouhammad Sakr, Marcus VölpAuthors Info & Claims
Tom Baumeister, Paul Eichler, Swen Jacobs, Mouhammad Sakr, Marcus VölpAuthors Info & ClaimsPages 638 - 657
Abstract
Threshold automata are a computational model that has proven to be versatile in modeling threshold-based distributed algorithms and enabling their completely automatic parameterized verification. We present novel techniques for the verification of threshold automata, based on well-structured transition systems, that allow us to extend the expressiveness of both the computational model and the specifications that can be verified. In particular, we extend the model to allow decrements and resets of shared variables, possibly on cycles, and the specifications to general coverability. While these extensions of the model in general lead to undecidability, our algorithms provide a semi-decision procedure. We demonstrate the benefit of our extensions by showing that we can model complex round-based algorithms such as the phase king consensus algorithm and the Red Belly Blockchain protocol (published in 2019), and verify them fully automatically for the first time.
References
[1]
Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.K.: General decidability theorems for infinite-state systems. In: Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp. 313–321. IEEE (1996)
[2]
Abdulla PA, Haziza F, and Holík L Parameterized verification through view abstraction Int. J. Softw. Tools Technol. Transf. 2016 18 5 495-516
[3]
Aminof B, Jacobs S, Khalimov A, and Rubin S McMillan KL and Rival X Parameterized model checking of token-passing systems Verification, Model Checking, and Abstract Interpretation 2014 Heidelberg Springer 262-281
[4]
Aminof B, Kotek T, Rubin S, Spegni F, and Veith H Baldan P and Gorla D Parameterized model checking of rendezvous systems CONCUR 2014 – Concurrency Theory 2014 Heidelberg Springer 109-124
[5]
Außerlechner S, Jacobs S, and Khalimov A Jobstmann B and Leino KRM Tight cutoffs for guarded protocols with fairness Verification, Model Checking, and Abstract Interpretation 2016 Heidelberg Springer 476-494
[6]
Balasubramanian AR, Bertrand N, and Markey N Beyer D and Huisman M Parameterized verification of synchronization in constrained reconfigurable broadcast networks Tools and Algorithms for the Construction and Analysis of Systems 2018 Cham Springer 38-54
[7]
Balasubramanian AR, Guillou L, and Weil-Kennedy C Parameterized analysis of reconfigurable broadcast networks Foundations of Software Science and Computation Structures 2022 Cham Springer 61-80
[8]
Balasubramanian AR, Esparza J, and Lazić M Hung DV and Sokolsky O Complexity of verification and synthesis of threshold automata Automated Technology for Verification and Analysis 2020 Cham Springer 144-160
[9]
Baumeister T, Eichler P, Jacobs S, Sakr M, and Völp M Parameterized verification of round-based distributed algorithms via extended threshold automata - Artifact 2024
[10]
Baumeister, T., Eichler, P., Jacobs, S., Sakr, M., Völp, M.: Parameterized verification of round-based distributed algorithms via extended threshold automata (2024). https://arxiv.org/abs/2406.19880
[11]
Berman, P., Garay, J.A., Perry, K.J., et al.: Towards optimal distributed consensus. In: FOCS, vol. 89, pp. 410–415 (1989)
[12]
Bertrand, N., Gramoli, V., Konnov, I., Lazic, M., Tholoniat, P., Widder, J.: Holistic verification of blockchain consensus. In: DISC. LIPIcs, vol. 246, pp. 10:1–10:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
[13]
Bertrand, N., Thomas, B., Widder, J.: Guard automata for the verification of safety and liveness of distributed algorithms. In: Haddad, S., Varacca, D. (eds.) 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24–27, 2021, Virtual Conference. LIPIcs, vol. 203, pp. 15:1–15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021).
[14]
Bertrand, N., Thomas, B., Widder, J.: Guard automata for the verification of safety and liveness of distributed algorithms. In: Concur 2021-International Conference on Concurrency Theory, pp. 1–17 (2021)
[15]
Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers (2015).
[16]
Bouajjani A, Jonsson B, Nilsson M, and Touili T Emerson EA and Sistla AP Regular model checking Computer Aided Verification 2000 Heidelberg Springer 403-418
[17]
Bracha G and Toueg S Asynchronous consensus and broadcast protocols J. ACM (JACM) 1985 32 4 824-840
[18]
Brasileiro F, Greve F, Mostefaoui A, and Raynal M Malyshkin V Consensus in one communication step Parallel Computing Technologies 2001 Heidelberg Springer 42-50
[19]
Brasileiro F, Greve F, Mostefaoui A, and Raynal M Malyshkin V Consensus in one communication step Parallel Computing Technologies 2001 Heidelberg Springer 42-50
[20]
Chandra TD and Toueg S Unreliable failure detectors for reliable distributed systems J. ACM (JACM) 1996 43 2 225-267
[21]
Chaudhuri S, Erlihy M, Lynch NA, and Tuttle MR Tight bounds for k-set agreement J. ACM (JACM) 2000 47 5 912-943
[22]
Crain, T., Gramoli, V., Larrea, M., Raynal, M.: DBFT: efficient leaderless byzantine consensus and its application to blockchains. In: 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA), pp. 1–8. IEEE (2018)
[23]
Crain, T., Natoli, C., Gramoli, V.: Red belly: a secure, fair and scalable open blockchain. In: SP, pp. 466–483. IEEE (2021)
[24]
Czerwinski, W., Orlikowski, L.: Reachability in vector addition systems is Ackermann-complete. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pp. 1229–1240. IEEE (2021).
[25]
de Moura L and Bjørner N Ramakrishnan CR and Rehof J Z3: an efficient SMT solver Tools and Algorithms for the Construction and Analysis of Systems 2008 Heidelberg Springer 337-340
[26]
Delzanno G, Sangnier A, and Zavattaro G Gastin P and Laroussinie F Parameterized verification of ad hoc networks CONCUR 2010 - Concurrency Theory 2010 Heidelberg Springer 313-327
[27]
Emerson, E.A., Kahlon, V.: Model checking guarded protocols. In: LICS, pp. 361–370. IEEE Computer Society (2003).
[28]
Emerson EA and Namjoshi KS On reasoning about rings Found. Comput. Sci. 2003 14 4 527-549
[29]
Emerson EA and Kahlon V McAllester D Reducing model checking of the many to the few Automated Deduction - CADE-17 2000 Heidelberg Springer 236-254
[30]
Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS, pp. 352–359. IEEE Computer Society (1999).
[31]
Finkel A Rozenberg G The minimal coverability graph for Petri nets Advances in Petri Nets 1993 1993 Heidelberg Springer 210-243
[32]
Finkel A and Schnoebelen P Well-structured transition systems everywhere! Theoret. Comput. Sci. 2001 256 1–2 63-92
[33]
German SM and Sistla AP Reasoning about systems with many processes J. ACM 1992 39 3 675-735
[34]
Guerraoui R Non-blocking atomic commit in asynchronous distributed systems with failure detectors Distrib. Comput. 2002 15 1 17-25
[35]
Hawblitzel, C., et al.: Ironfleet: proving safety and liveness of practical distributed systems. Commun. ACM 60(7), 83–92 (2017).
[36]
Jaber N, Jacobs S, Wagner C, Kulkarni M, and Samanta R Lahiri SK and Wang C Parameterized verification of systems with global synchronization and guards Computer Aided Verification 2020 Cham Springer 299-323
[37]
Jaber, N., Wagner, C., Jacobs, S., Kulkarni, M., Samanta, R.: Quicksilver: modeling and parameterized verification for distributed agreement-based systems. Proc. ACM Program. Lang. 5(OOPSLA), 1–31 (2021).
[38]
Jacobs S and Sakr M Analyzing guarded protocols: better cutoffs, more systems, more expressivity Verification, Model Checking, and Abstract Interpretation 2018 Cham Springer 247-268
[39]
Jacobs, S., Sakr, M., Völp, M.: Automatic repair and deadlock detection for parameterized systems. In: Conference on Formal Methods in Computer-Aided Design–FMCAD 2022, p. 225 (2022)
[40]
John, A., Konnov, I., Schmid, U., Veith, H., Widder, J.: Parameterized model checking of fault-tolerant distributed algorithms by abstraction. In: 2013 Formal Methods in Computer-Aided Design. pp. 201–209. IEEE (2013)
[41]
Kaiser A, Kroening D, and Wahl T Touili T, Cook B, and Jackson P Dynamic cutoff detection in parameterized concurrent programs Computer Aided Verification 2010 Heidelberg Springer 645-659
[42]
Konnov, I.: Fault-tolerant benchmarks. https://github.com/konnov/fault-tolerant-benchmarks/tree/master/cav15
[43]
Konnov I, Lazić M, Veith H, and Widder J Para 2: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms Formal Meth. Syst. Des. 2017 51 2 270-307
[44]
Konnov, I., Lazić, M., Veith, H., Widder, J.: A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 719–734 (2017)
[45]
Konnov I, Veith H, and Widder J On the completeness of bounded model checking for threshold-based distributed algorithms: reachability Inf. Comput. 2017 252 95-109
[46]
Konnov I and Widder J Margaria T and Steffen B ByMC: byzantine model checker Leveraging Applications of Formal Methods, Verification and Validation. Distributed Systems 2018 Cham Springer 327-342
[47]
Kukovec, J., Konnov, I., Widder, J.: Reachability in parameterized systems: all flavors of threshold automata. In: CONCUR 2018-29th International Conference on Concurrency Theory (2018)
[48]
Marić O, Sprenger C, and Basin D Majumdar R and Kunčak V Cutoff bounds for consensus algorithms Computer Aided Verification 2017 Cham Springer 217-237
[49]
McMillan KL and Padon O Lahiri SK and Wang C Ivy: a multi-modal verification tool for distributed algorithms Computer Aided Verification 2020 Cham Springer 190-202
[50]
Mostéfaoui, A., Mourgaya, E., Parvédy, P.R., Raynal, M.: Evaluating the condition-based approach to solve consensus. In: 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings, pp. 541–541. IEEE Computer Society (2003)
[51]
Rackoff C The covering and boundedness problems for vector addition systems Theoret. Comput. Sci. 1978 6 2 223-231
[52]
Rahli, V., Guaspari, D., Bickford, M., Constable, R.L.: Formal specification, verification, and implementation of fault-tolerant systems using eventml. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 72 (2015).
[53]
Raynal, M.: A case study of agreement problems in distributed systems: non-blocking atomic commitment. In: Proceedings 1997 High-Assurance Engineering Workshop, pp. 209–214. IEEE (1997)
[54]
Schmitz S and Schnoebelen P D’Argenio PR and Melgratti H The power of well-structured systems CONCUR 2013 – Concurrency Theory 2013 Heidelberg Springer 5-24
[55]
Somenzi, F.: CUDD: cu decision diagram package release 2.3. 0. University of Colorado at Boulder 621 (1998)
[56]
Song YJ and van Renesse R Taubenfeld G Bosco: one-step byzantine asynchronous consensus Distributed Computing 2008 Heidelberg Springer 438-450
[57]
Srikanth T and Toueg S Simulating authenticated broadcasts to derive simple fault-tolerant algorithms Distrib. Comput. 1987 2 2 80-94
[58]
Suzuki I Proving properties of a ring of finite-state machines Inf. Process. Lett. 1988 28 4 213-214
[59]
Thomas, B., Sankur, O.: Pylta: a verification tool for parameterized distributed algorithms. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 28–35. Springer, Cham (2023).
[60]
Wilcox, J.R., et al.: Verdi: a framework for implementing and formally verifying distributed systems. In: Grove, D., Blackburn, S.M. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, June 15–17, 2015, pp. 357–368. ACM (2015).
Index Terms
- Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata
Index terms have been assigned to the content through auto-classification.
Recommendations
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Verification problems for finite- and infinite-state processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES then solves the encoded problem. The ...
Multi-parameterised compositional verification of safety properties
We introduce a fully automatic technique for the parameterised verification of safety properties. The technique combines compositionality and completeness with support to multiple parameters and it is implemented in a tool. We start with an LTS-based (...
Extended symbolic finite automata and transducers
Symbolic finite automata and transducers augment classic automata and transducers with symbolic alphabets represented as parametric theories. This extension enables to succinctly represent large and potentially infinite alphabets while preserving ...
Comments
Information & Contributors
Information
Published In
Sep 2024
691 pages
ISBN:978-3-031-71161-9
DOI:10.1007/978-3-031-71162-6
© The Author(s) 2025.
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 11 September 2024
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Feb 2025