de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Model Checking the Pastry Routing Protocol

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44951

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45719

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-14B5-6
Zusammenfassung
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}.