Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Communication-closed asynchronous protocols

Abstract : Fault-tolerant distributed systems are implemented over asyn-chronous networks, so that they use algorithms for asynchronous models with faults. Due to asynchronous communication and the occurrence of faults (e.g., process crashes or the network dropping messages) the implementations are hard to understand and analyze. In contrast, synchronous computation models simplify design and reasoning. In this paper, we bridge the gap between these two worlds. For a class of asynchronous protocols, we introduce a procedure that, given an asynchronous protocol , soundly computes its round-based synchronous counterpart. This class is defined by properties of the sequential code. We computed the synchronous counterpart of known consensus and leader election protocols, such as, Paxos, and Chandra and Toueg's consensus. Using Verifast we checked the sequential properties required by the rewriting. We verified the round-based synchronous counterpart of Multi-Paxos, and other algorithms, using existing deductive verification methods for synchronous protocols.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [45 references]  Display  Hide  Download
Contributor : Cezara Dragoi <>
Submitted on : Wednesday, January 23, 2019 - 6:54:19 PM
Last modification on : Thursday, July 1, 2021 - 5:58:08 PM


Files produced by the author(s)


  • HAL Id : hal-01991415, version 1



Andrei Damian, Cezara Dragoi, Alexandru Militaru, Josef Widder. Communication-closed asynchronous protocols. 2019. ⟨hal-01991415⟩



Record views


Files downloads