Skip to Main content Skip to Navigation
New interface
Conference papers

SASA: a SimulAtor of Self-stabilizing Algorithms

Abstract : 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.
Complete list of metadata
Contributor : Erwan Jahier Connect in order to contact the contributor
Submitted on : Wednesday, March 23, 2022 - 5:40:41 PM
Last modification on : Tuesday, March 29, 2022 - 4:00:22 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads