User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Conference Paper

Model Checking the Pastry Routing Protocol


Lu,  Tianxiang
Automation of Logic, MPI for Informatics, Max Planck Society;


Weidenbach,  Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Lu, T., Merz, S., & Weidenbach, C. (2010). Model Checking the Pastry Routing Protocol. In J. Bendisposto, M. Leuschel, & M. Roggenbach (Eds.), Proceedings of the 10th International Workshop Automatic Verification of Critical Systems (pp. 19-21). Düsseldorf: Universität Düsseldorf.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-14B5-6
Pastry is an algorithm for implementing a scalable distributed hash table over an underlying P2P network, an active area of research in distributed systems. 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 \emph{churn} and fault tolerance, it makes an interesting target for verification. We have modeled Pastry's core routing algorithms in the specification language \texorpdfstring{\textrm{\upshape TLA\textsuperscript{+}}}{TLA+} and used its model checker \textsc{tlc} to analyze qualitative properties of Pastry such as \emph{correctness} and \emph{consistency}.