Year: 2019
Type: conference-paper
Abstract: The verification of asynchronous fault-tolerant distributed systems is challenging due to unboundedly many interleavings and network failures (e.g., processes crash or message loss). We propose a method that reduces the verification of asynchronous fault-tolerant protocols to the verification of round-based synchronous ones. Synchronous protocols are easier to verify due to fewer interleavings, bounded message buffers etc. We implemented our reduction method and applied it to several state machine replication and consensus algorithms. The resulting synchronous protocols are verified using existing deductive verification methods.
Authors: Andrei Damian, Cezara Drăgoi, Alexandru Militaru, Josef Widder
Institutions: Universitatea Națională de Știință și Tehnologie Politehnica București, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Université Paris Sciences et Lettres, École Normale Supérieure - PSL, TU Wien, Interchain Foundation
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $5,392
OpenAlex ID: W2913498875