Certified Round Complexity of Self-Stabilizing Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Certified Round Complexity of Self-Stabilizing Algorithms

Karine Altisen
Pierre Corbineau

Résumé

A proof assistant is an appropriate tool to write sound proofs. The need of such tools in distributed computing grows over the years due to the scientific progress that leads algorithmic designers to consider always more difficult problems. In that spirit, the PADEC Coq library has been developed to certify self-stabilizing algorithms. Efficiency of self-stabilizing algorithms is mainly evaluated by comparing their stabilization times in rounds, the time unit that is primarily used in the self-stabilizing area. In this paper, we introduce the notion of rounds in the PADEC library together with several formal tools to help the certification of the complexity analysis of self-stabilizing algorithms. We validate our approach by certifying the stabilization time in rounds of the classical Dolev et al’s self-stabilizing Breadth-first Search spanning tree construction.
Fichier non déposé

Dates et versions

hal-04230513 , version 1 (06-10-2023)

Identifiants

Citer

Karine Altisen, Pierre Corbineau, Stéphane Devismes. Certified Round Complexity of Self-Stabilizing Algorithms. 37th International Symposium on Distributed Computing, Oct 2023, L'Aquila, Italy. pp.1-22, ⟨10.4230/LIPIcs.DISC.2023.2⟩. ⟨hal-04230513⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More