Communication-closed asynchronous protocols - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Communication-closed asynchronous protocols

(1) , (2) , (1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
head2.pdf (819.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01991415 , version 1 (23-01-2019)

Identifiers

  • HAL Id : hal-01991415 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More