An implementation of complete, asynchronous, distributed garbage collection
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
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)
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Distributed Abstract Machine for Safe Ambients
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Safe ambients: abstract machine and distributed implementation
Science of Computer Programming
New up-to techniques for weak bisimulation
Theoretical Computer Science
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
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
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Weak bisimulation up to elaboration
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The bisimulation proof method: enhancements and open problems
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
| Hi-index | 0.00 |
We describe an abstract machine, called GcPan, for the distributed execution of Safe Ambients (SA), a variant of the Ambient Calculus (AC). Our machine improves over previous proposals for executing AC, or variants of it, mainly through a better management of special agents (forwarders), created upon code migration to transmit messages to the target location of the migration. We establish the correctness of our machine by proving a weak bisimilarity result with a previous abstract machine for SA, and then appealing to the correctness of the latter machine. More broadly, this study is a contribution towards understanding issues of correctness and optimisations in implementations of distributed languages encompassing mobility.