Verifying a Structured Peer-to-Peer Overlay Network: The Static Case-Reference-Cited by-同舟云学术

Verifying a Structured Peer-to-Peer Overlay Network: The Static Case

Published:2005 Issue: Volume: Page:250-265
ISSN:0302-9743
Container-title:Global Computing
language:
Short-container-title:

Author:

Borgström Johannes,Nestmann Uwe,Onana Luc,Gurov Dilian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-31794-4_13

Reference13 articles.

1. Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation 148(1), 1–70 (1999)

2. ENTCS;M. Berger,2000

3. Goscinski, A.: Distributed Operating Systems, The Logical Design. Addison-Wesley, Reading (1991)

4. Ingólfsdóttir, A.: Semantic Models for Communicating Processes with Value-Passing. PhD thesis, University of Sussex, Available as Technical Report 8/94 (1994)

5. Lynch, N.A., Tuttle, M.R.: An Introduction to Input/Output Automata. Technical Report MIT/LCS/TM 373. MIT Press, Redmond (1998)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Depletable channels: dynamics, behaviour, and efficiency in network design;Acta Informatica;2018-11-08

2. A Rigorous Correctness Proof for Pastry;Lecture Notes in Computer Science;2016

3. Specifying and Analyzing the Kademlia Protocol in Maude;Theoretical Aspects of Computing - ICTAC 2015;2015

4. Formal Verification of the Pastry Protocol Using $$\mathrm{{TLA}}^{+}$$;Dependable Software Engineering: Theories, Tools, and Applications;2015

5. A Mechanized Model for CAN Protocols;Fundamental Approaches to Software Engineering;2013