Model checking randomized distributed algorithms - Archive ouverte HAL Access content directly
Journal Articles ACM SIGLOG News Year : 2020

Model checking randomized distributed algorithms



Randomization is a powerful paradigm to solve hard problems, especially in distributed computing. Proving the correctness, and assessing the performances, of randomized distributed algorithms, is a very challenging research objective, that the verification community has started to address. In this article, we review existing model checking approaches to the verification of randomized distributed algorithms and identify further research directions.
Fichier principal
Vignette du fichier
pp-nb.pdf (151.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03095637 , version 1 (21-06-2021)



Nathalie Bertrand. Model checking randomized distributed algorithms. ACM SIGLOG News, 2020, 7 (1), pp.35-45. ⟨10.1145/3385634.3385638⟩. ⟨hal-03095637⟩
47 View
83 Download



Gmail Facebook Twitter LinkedIn More