Verification techniques for distributed algorithms

Authors:
Anna Philippou;George Michael
Affiliations:
Department of Computer Science, University of Cyprus, Nicosia, Cyprus;Department of Computer Science, University of Cyprus, Nicosia, Cyprus
Venue:
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Year:
2006

Citing 13
Cited 1

Proof methods and pragmatics for parallel programming

Proof methods and pragmatics for parallel programming
Pict: a programming language based on the Pi-Calculus

Proof, language, and interaction
Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Communication and Concurrency

Communication and Concurrency
A Calculus of Communicating Systems

A Calculus of Communicating Systems
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
On Confluence in the pi-Calculus

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Confluence of Processes and Systems of Objects

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Theory of Bisimulation for the pi-Calculus

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Confluence for Process Verification

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
On Transformations of Concurrent Object Programs

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science

On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems

FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A value-passing, asynchronous process calculus and its associated theory of confluence are considered as a basis for establishing the correctness of distributed algorithms. In particular, we present an asynchronous version of value-passing CCS and we develop its theory of confluence. We show techniques for demonstrating confluence of complex processes in a compositional manner and we study properties of confluent systems that can prove useful for their verification. These results give rise to a methodology for system verification which we illustrate by proving the correctness of two distributed leader-election algorithms.