2026-08-07T21:42:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15776 2024-03-06T10:56:08Z ddc:004 open_access

Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk) Bertrand, Nathalie Verification Distributed algorithms Distributed computing is increasingly spreading, in advanced technological applications as well as in our daily life. Failures in distributed algorithms can have important human and financial consequences, so that is is crucial to develop rigorous techniques to verify their correctness. Model checking is a model-based approach to formal verification, dating back the 80’s. It has been successfully applied first to hardware, and later to software verification. Distributed computing raises new challenges for the model checking community, and calls for the development of new verification techniques and tools. In particular, the parameterized verification paradigm is nowadays blooming to help proving automatically the correctness of distributed algorithms. In this invited talk, we present recent parameterized verification developments to automatically prove properties of some classical distributed algorithms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nathalie Bertrand 2022 Is Part Of LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2021.1 urn:nbn:de:0030-drops-157767 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.1 eng https://creativecommons.org/licenses/by/4.0/legalcode