Parameterized safety verification of round-based shared-memory systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Parameterized safety verification of round-based shared-memory systems


We consider the parameterized verification problem for distributed algorithms where the goal is to develop techniques to prove the correctness of a given algorithm regardless of the number of participating processes. Motivated by an asynchronous binary consensus algorithm [3], we consider round-based distributed algorithms communicating with shared memory. A particular challenge in these systems is that 1) the number of processes is unbounded, and, more importantly, 2) there is a fresh set of registers at each round. A verification algorithm thus needs to manage both sources of infinity. In this setting, we prove that the safety verification problem, which consists in deciding whether all possible executions avoid a given error state, is PSPACE-complete. For negative instances of the safety verification problem, we also provide exponential lower and upper bounds on the minimal number of processes needed for an error execution and on the minimal round on which the error state can be covered.
Fichier principal
Vignette du fichier
icalp2022-BMSW.pdf (870.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03777440 , version 1 (14-09-2022)



Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger. Parameterized safety verification of round-based shared-memory systems. ICALP 2022 - International Colloquium on Automata, Languages and Programming, Jul 2022, Paris, France. pp.1-32, ⟨10.4230/LIPIcs.ICALP.2022.113⟩. ⟨hal-03777440⟩
23 View
12 Download



Gmail Facebook Twitter LinkedIn More