Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms

Résumé

Distributed algorithms typically run over arbitrary many processes and may involve unboundedly many rounds, making the automated verification of their correctness challenging. Building on domain theory, we introduce a framework that abstracts infinite-state distributed systems that represent distributed algorithms into finite-state guard automata. The soundness of the approach corresponds to the Scott-continuity of the abstraction, which relies on the assumption that the distributed algorithms are layered. Guard automata thus enable the verification of safety and liveness properties of distributed algorithms.
Fichier principal
Vignette du fichier
main.pdf (680.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03480241 , version 1 (14-12-2021)

Identifiants

Citer

Nathalie Bertrand, Bastien Thomas, Josef Widder. Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. Concur 2021 - International Conference on Concurrency Theory, Aug 2021, Paris, France. pp.1-17, ⟨10.4230/LIPIcs.CONCUR.2021.15⟩. ⟨hal-03480241⟩
55 Consultations
70 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More