Analyzing the Fundamental Liveness Property of the Chord Protocol

Abstract : Chord is a protocol that provides a scalable distributed hash table over an underlying peer-to-peer network. Since it combines data structures, asynchronous communications, concurrency, and fault tolerance, it features rich structural and temporal properties that make it an interesting target for formal specification and verification. Previous work has mainly focused on automatic proofs of safety properties or manual proofs of the full correctness of the protocol (a liveness property). In this paper, we report on analyzing automatically the correctness of Chord with the Electrum language (developed in former work) on small instance of networks. In particular, we were able to find various corner cases in previous work and showed that the protocol was not correct as described there. We fixed all these issues and provided a version of protocol for which we were not able to find any counterexample using our method.
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01862755
Contributor : David Chemouil <>
Submitted on : Monday, August 27, 2018 - 4:44:56 PM
Last modification on : Wednesday, March 27, 2019 - 1:37:18 AM
Document(s) archivé(s) le : Wednesday, November 28, 2018 - 2:45:14 PM

File

final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01862755, version 1

Collections

Citation

Julien Brunel, David Chemouil, Jeanne Tawa. Analyzing the Fundamental Liveness Property of the Chord Protocol. Formal Methods in Computer-Aided Design, Oct 2018, Austin, United States. ⟨hal-01862755⟩

Share

Metrics

Record views

77

Files downloads

134