Model Checking of Distributed Algorithms Using Synchronous Programs - Université de Picardie Jules Verne Accéder directement au contenu
Chapitre D'ouvrage Année : 2023

Model Checking of Distributed Algorithms Using Synchronous Programs

Erwan Jahier
  • Fonction : Auteur
Karine Altisen
  • Fonction : Auteur
Gabriel Sant’anna
  • Fonction : Auteur

Résumé

The development of trustworthy self-stabilizing algorithms requires the verification of some key properties with respect to the formal specification of the expected system executions. The atomic-state model (ASM) is the most commonly used computational model to reason on self-stabilizing algorithms. In this work, we propose methods and tools to automatically verify the self-stabilization of distributed algorithms defined in that model. To that goal, we exploit the similarities between the ASM and computational models issued from the synchronous programming area to reuse their associated verification tools, and in particular their model checkers. This allows the automatic verification of all safety (and bounded liveness) properties of any algorithm, regardless of any assumptions on network topologies and execution scheduling.
Fichier non déposé

Dates et versions

hal-04508148 , version 1 (17-03-2024)

Identifiants

Citer

Erwan Jahier, Karine Altisen, Stéphane Devismes, Gabriel Sant’anna. Model Checking of Distributed Algorithms Using Synchronous Programs. Stabilization, Safety, and Security of Distributed Systems, 14310, Springer Nature Switzerland, pp.18-35, 2023, Lecture Notes in Computer Science, 978-3-031-44274-2. ⟨10.1007/978-3-031-44274-2_2⟩. ⟨hal-04508148⟩
13 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More