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.
Type de document :
Communication dans un congrès
Formal Methods in Computer-Aided Design, Oct 2018, Austin, United States. 〈https://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD18/〉
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01862755
Contributeur : David Chemouil <>
Soumis le : lundi 27 août 2018 - 16:44:56
Dernière modification le : jeudi 15 novembre 2018 - 08:30:03
Document(s) archivé(s) le : mercredi 28 novembre 2018 - 14:45:14

Fichier

final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 〈https://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD18/〉. 〈hal-01862755〉

Partager

Métriques

Consultations de la notice

56

Téléchargements de fichiers

114