CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Robust, distributed references and acyclic garbage collection
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
An efficiency preorder for processes
Acta Informatica
Confluence by decreasing diagrams
Theoretical Computer Science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence for process verification
Theoretical Computer Science
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the bisimulation proof method
Mathematical Structures in Computer Science
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
A Distributed Pi-Calculus
Theoretical Computer Science
Information and Computation
On bisimulation proofs for the analysis of distributed abstract machines
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Up-to techniques for weak bisimulation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A correct abstract machine for safe ambients
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 5.23 |
We illustrate the use of recently developed proof techniques for weak bisimulation by analysing a generic framework for the definition of distributed abstract machines based on a message-passing implementation. We first define this framework, and then focus on the algorithm which is used to route messages asynchronously to their destination. A first version of this algorithm can be analysed using the standard bisimulation up to expansion proof technique. We show that in a second, optimised version, rather complex behaviours appear, for which more sophisticated techniques, relying on termination arguments, are necessary to establish behavioural equivalence.