Skip to Main content Skip to Navigation
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 metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal-cnrs.archives-ouvertes.fr/hal-02521149
Contributor : Erwan Jahier <>
Submitted on : Saturday, April 18, 2020 - 10:00:15 AM
Last modification on : Thursday, August 6, 2020 - 3:02:44 AM

File

preprint.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02521149, version 4

Collections

Citation

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

Share

Metrics

Record views

81

Files downloads

48