Facile: a symmetric integration of concurrent and functional programming
International Journal of Parallel Programming
Selected papers of the Second Workshop on Concurrency and compositionality
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Proof, language, and interaction
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Implementation Model of Rendezvous Communication
Seminar on Concurrency, Carnegie-Mellon University
On Implementations and Semantics of a Concurrent Programming Language
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
An Asynchronous, Distributed Implementation of Mobile Ambients
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Jocaml: Mobile Agents for Objective-Caml
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2000
Information and Computation
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
Theoretical Computer Science
Web Services and Models of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
A general name binding mechanism
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
An abstract machine for the kell calculus
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Timing issues in web services composition
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
| Hi-index | 0.00 |
We present a new model for the distributed implementation of pi-like calculi, which permits strong correctness results that are simple to prove. We describe the distributed channel machine - a distributed version of a machine proposed by Cardelli. The distributed channel machine groups pi processes at their channels (or locations), in contrast with the more common approach of incorporating additional location information within pi processes. We go on to describe the fusion machine. It uses a form of concurrent constraints called fusions - equations on channel names - to distribute fragments of these processes between remote channels. This fragmentation avoids the movement of large continuations between locations, and leads to a more efficient implementation model.