A Distributed Abstract Machine for Safe Ambients

The Ambient calculus [4] is a model for mobile distributed computing. An ambient is the unit of movement. Processes within the same ambient may exchange messages; ambients may be nested, so to form a hierarchical structure. The three primitives for movement allow: an ambient to enter another ambient, n[ in m. P | Q] | m[R] → m[ n[ P | Q] | R]; an ambient to exit another ambient, m[ n[ out m. P | Q] | R] → n[ P | Q] ~ m[R]; a process to dissolve an ambient boundary thus obtaining access to its content, open n. P ~ n[Q] → P | Q.

[1]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[2]  Flemming Nielson,et al.  Shape analysis for mobile ambients , 2000, POPL '00.

[3]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[4]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

[5]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[6]  Davide Sangiorgi,et al.  Controlling interference in ambients , 2000, POPL '00.

[7]  Luca Cardelli,et al.  Mobile Ambient Synchronization , 1997 .

[8]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

[9]  Michele Bugliesi,et al.  Secure safe ambients , 2001, POPL '01.

[10]  Luca Cardelli,et al.  Equational properties of mobile ambients , 1999, Mathematical Structures in Computer Science.

[11]  Jean-Jacques Lévy,et al.  An Asynchronous, Distributed Implementation of Mobile Ambients , 2000, IFIP TCS.