Towards Verification of the Pastry Protocol using TLA+
International audience 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 pro...
Main Authors: | , , |
---|---|
Other Authors: | , , , , , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2011
|
Subjects: | |
Online Access: | https://hal.inria.fr/inria-00593523 |
id |
ftunivnantes:oai:HAL:inria-00593523v1 |
---|---|
record_format |
openpolar |
spelling |
ftunivnantes:oai:HAL:inria-00593523v1 2023-05-15T16:50:53+02:00 Towards Verification of the Pastry Protocol using TLA+ Merz, Stephan Lu, Tianxiang Weidenbach, Christoph VERIfication pour les systèmes DIStribués (VERIDIS) Inria Nancy - Grand Est Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS) Microsoft Research - Inria Joint Centre (MSR - INRIA) Institut National de Recherche en Informatique et en Automatique (Inria)-Microsoft Research Laboratory Cambridge-Microsoft Corporation Redmond, Wash. Max-Planck-Institut für Informatik (MPII) Max-Planck-Gesellschaft R. Bruni and J. Dingel Reykjavik, Iceland 2011-06 https://hal.inria.fr/inria-00593523 en eng HAL CCSD inria-00593523 https://hal.inria.fr/inria-00593523 31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems https://hal.inria.fr/inria-00593523 31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems, Jun 2011, Reykjavik, Iceland network protocols verification methods model checking formal specification ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.2: Correctness proofs ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.3: Formal methods ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] info:eu-repo/semantics/conferenceObject Conference papers 2011 ftunivnantes 2022-12-27T23:43:30Z International audience 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. Conference Object Iceland Université de Nantes: HAL-UNIV-NANTES |
institution |
Open Polar |
collection |
Université de Nantes: HAL-UNIV-NANTES |
op_collection_id |
ftunivnantes |
language |
English |
topic |
network protocols verification methods model checking formal specification ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.2: Correctness proofs ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.3: Formal methods ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] |
spellingShingle |
network protocols verification methods model checking formal specification ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.2: Correctness proofs ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.3: Formal methods ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] Merz, Stephan Lu, Tianxiang Weidenbach, Christoph Towards Verification of the Pastry Protocol using TLA+ |
topic_facet |
network protocols verification methods model checking formal specification ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.2: Correctness proofs ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.3: Formal methods ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] |
description |
International audience 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. |
author2 |
VERIfication pour les systèmes DIStribués (VERIDIS) Inria Nancy - Grand Est Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS) Microsoft Research - Inria Joint Centre (MSR - INRIA) Institut National de Recherche en Informatique et en Automatique (Inria)-Microsoft Research Laboratory Cambridge-Microsoft Corporation Redmond, Wash. Max-Planck-Institut für Informatik (MPII) Max-Planck-Gesellschaft R. Bruni and J. Dingel |
format |
Conference Object |
author |
Merz, Stephan Lu, Tianxiang Weidenbach, Christoph |
author_facet |
Merz, Stephan Lu, Tianxiang Weidenbach, Christoph |
author_sort |
Merz, Stephan |
title |
Towards Verification of the Pastry Protocol using TLA+ |
title_short |
Towards Verification of the Pastry Protocol using TLA+ |
title_full |
Towards Verification of the Pastry Protocol using TLA+ |
title_fullStr |
Towards Verification of the Pastry Protocol using TLA+ |
title_full_unstemmed |
Towards Verification of the Pastry Protocol using TLA+ |
title_sort |
towards verification of the pastry protocol using tla+ |
publisher |
HAL CCSD |
publishDate |
2011 |
url |
https://hal.inria.fr/inria-00593523 |
op_coverage |
Reykjavik, Iceland |
genre |
Iceland |
genre_facet |
Iceland |
op_source |
31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems https://hal.inria.fr/inria-00593523 31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems, Jun 2011, Reykjavik, Iceland |
op_relation |
inria-00593523 https://hal.inria.fr/inria-00593523 |
_version_ |
1766040997405392896 |