Formal Verification Of Pastry Using TLA+ - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Formal Verification Of Pastry Using TLA+


Pastry is an algorithm that provides a scalable distributed hash table over an underlying P2P network. Several implementations of Pastry are available, but to the best of our knowledge the correctness of the algorithm has not been verified formally. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to churn and fault tolerance, we believe that it makes an interesting target for verification using TLA+. More precisely, our goal is to model the join and lookup protocols of Pastry using the TLA+ language, and to use the associated tools to verify significant correctness properties.
Fichier principal
Vignette du fichier
paper.pdf (56.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00768812 , version 1 (24-12-2012)


  • HAL Id : hal-00768812 , version 1


Tianxiang Lu, Stephan Merz, Christoph Weidenbach. Formal Verification Of Pastry Using TLA+. International Workshop on the TLA+ Method and Tools, Aug 2012, Paris, France. ⟨hal-00768812⟩
254 View
478 Download


Gmail Facebook X LinkedIn More