Skip to Main content Skip to Navigation
New interface
Conference papers

Towards Verification of the Pastry Protocol using TLA+

Stephan Merz 1, 2 Tianxiang Lu 3 Christoph Weidenbach 3 
1 VERIDIS - VERIfication pour les systèmes DIStribués
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications : UMR7503
Abstract : Pastry is an algorithm that provides a scalable distributed hash table over an underlying P2P network. Several implementations of Pastry are available and have been applied in practice, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to churn and fault tolerance, it makes an interesting target for verification. We have modeled Pastry's core routing algorithms and communication protocol in the specification language TLA+. In order to validate the model and to search for bugs we employed the TLA+ model checker TLC to analyze several qualitative properties. We obtained non-trivial insights in the behavior of Pastry through the model checking analysis. Furthermore, we started to verify Pastry using the very same model and the interactive theorem prover TLAPS for TLA+. A first result is the reduction of global Pastry correctness properties to invariants of the underlying data structures.
Document type :
Conference papers
Complete list of metadata
Contributor : Stephan Merz Connect in order to contact the contributor
Submitted on : Monday, May 16, 2011 - 2:00:18 PM
Last modification on : Friday, November 18, 2022 - 9:27:19 AM


  • HAL Id : inria-00593523, version 1



Stephan Merz, Tianxiang Lu, Christoph Weidenbach. Towards Verification of the Pastry Protocol using TLA+. 31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems, Jun 2011, Reykjavik, Iceland. ⟨inria-00593523⟩



Record views