Skip to Main content Skip to Navigation
Journal articles

Model checking randomized distributed algorithms

Nathalie Bertrand 1
1 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-03095637
Contributor : Nathalie Bertrand Connect in order to contact the contributor
Submitted on : Monday, June 21, 2021 - 3:51:40 PM
Last modification on : Wednesday, November 3, 2021 - 8:07:38 AM
Long-term archiving on: : Wednesday, September 22, 2021 - 6:51:43 PM

File

pp-nb.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

72

Files downloads

111