SASA: a SimulAtor of Self-stabilizing Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year :

SASA: a SimulAtor of Self-stabilizing Algorithms

Karine Altisen
  • Function : Author
  • PersonId : 832502
Stéphane Devismes
Erwan Jahier


We present SASA, an open-source SimulAtor of Self-stabilizing Algorithms. Self-stabilization defines the ability of a distributed algorithm to recover after transient failures. SASA is implemented as a faithful representation of the atomic-state model. This model is the most commonly used in the self-stabilizing area to prove both the correct operation and complexity bounds of self-stabilizing algorithms. SASA encompasses all features necessary to debug, test, and analyze self-stabilizing algorithms. Algorithm's properties can be checked using formal test oracles. Asynchrony is modeled by programmable stochastic daemons playing the role of input sequence generators.
Fichier principal
Vignette du fichier
main.pdf (346.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02521149 , version 4 (18-04-2020)
hal-02521149 , version 5 (23-03-2022)


  • HAL Id : hal-02521149 , version 5


Karine Altisen, Stéphane Devismes, Erwan Jahier. SASA: a SimulAtor of Self-stabilizing Algorithms. 14th International Conference on Tests and Proofs, Jun 2020, Bergen, Norway. ⟨hal-02521149v5⟩
222 View
419 Download


Gmail Facebook Twitter LinkedIn More