Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Looking up data in P2P systems
Communications of the ACM
Message Passing: From Parallel Computing to the Grid
Computing in Science and Engineering
Brief announcement: concurrent maintenance of rings
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Modeling Erlang in the pi-calculus
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
A statistical theory of chord under churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Verifying a structured peer-to-peer overlay network: the static case
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Verifying security property of peer-to-peer systems using CSP
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Towards verification of the pastry protocol using TLA+
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
A mechanized model for CAN protocols
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Modeling and verification of security properties for critical infrastructure protection
Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop
| Hi-index | 0.00 |
The problem of maintaining structured peer-to-peer (P2P) overlay networks in the presence of concurrent joins and failures of nodes is the subject of intensive research. The various algorithms underlying P2P systems are notoriously difficult to design and analyse. Thus, when verifying P2P algorithms, a real challenge is to find an adequate level of abstraction at which to model the algorithms and perform the verifications. In this paper, we propose an abstract model for structured P2P networks with ring topology. Our model is based on process algebra, which, with its well-developed theory, provides the right level of abstraction for the verification of many basic P2P algorithms. As a case study, we verify the correctness of the stabilization algorithm of Chord, one of the best-known P2P overlay networks. To show the correctness of the algorithm, we provide a specification and an implementation of the Chord system in process algebra and establish bisimulation equivalence between the two.