Selected papers of the Second Workshop on Concurrency and compositionality
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
The m-calculus: a higher-order distributed process calculus
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
IEEE Concurrency
A Distributed Abstract Machine for Safe Ambients
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th 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
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Oz/K: a kernel language for component-based open programming
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Theoretical Computer Science
Encapsulation and Dynamic Modularity in the π-calculus
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
Abstract machines for safe ambients in wide-area and mobile networks
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
| Hi-index | 0.00 |
The Kell Calculus is a family of process calculi intended as a basis for studying distributed component-based programming. This paper presents an abstract machine for an instance of this calculus, a proof of its correctness, and a prototype OCaml implementation. The main originality of our abstract machine is that it does not mandate a particular physical configuration (e.g. mapping of localities to physical sites), and it is independent of any supporting network services. This allows to separate the proof of correctness of the abstract machine per se, from the proof of correctness of higher-level communication and migration protocols which can be implemented on the machine.