Work

Model checking randomized distributed algorithms

Year: 2020

Type: article

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.

Source: ACM SIGLOG News

DOI: 10.1145/3385634.3385638

Author: Nathalie Bertrand

Institutions: Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Institut de Recherche en Informatique et Systèmes Aléatoires, Université de Rennes

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3008685338

FWCI: 0.199

Cites: 40

Cited by: 4

Related to: 10