Model checking randomized distributed algorithms
Résumé
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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)