Communication and mobility control in boxed ambients

Boxed Ambients (BA) replace Mobile Ambients' open capability with communication primitives acting across ambient boundaries. The expressiveness of the new communication model is achieved at the price of communication interferences whose resolution requires synchronisation of activities at multiple, distributed locations. We study a variant of BA aimed at controlling communication as well as mobility interferences. Our calculus modifies the communication mechanism of BA, and introduces a new form of co-capability, inspired from Safe Ambients (SA) (with passwords), that registers incoming agents with the receiver ambient while at the same time performing access control. We prove that the new calculus has a rich semantics theory, including a sound and complete coinductive characterisation, and an expressive, yet simple type system. Through a set of examples, and an encoding, we characterise its expressiveness with respect to both BA and SA.

[1]  Vladimiro Sassone,et al.  Typing and Subtyping Mobility in Boxed Ambients , 2002, CONCUR.

[2]  Matthew Hennessy,et al.  Bisimulation congruences in safe ambients , 2002, POPL '02.

[3]  Davide Sangiorgi,et al.  Extensionality and intensionality of the ambient logics , 2001, POPL '01.

[4]  Michele Bugliesi,et al.  Access control for mobile agents: The calculus of boxed ambients , 2004, TOPL.

[5]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[6]  Jan Vitek,et al.  Seal: A Framework for Secure Mobile Computations , 1998, ICCL Workshop: Internet Programming Languages.

[7]  Michele Boreale,et al.  On the Expressiveness of Internal Mobility in Name-Passing Calculi , 1996, Theor. Comput. Sci..

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

[10]  Luca Cardelli,et al.  Equational Properties Of Mobile Ambients , 2003, Math. Struct. Comput. Sci..

[11]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[12]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1996, CONCUR.

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

[14]  Uwe Nestmann What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[15]  Jan Vitek,et al.  The Seal Calculus , 2005, Inf. Comput..

[16]  Nobuko Yoshida,et al.  A Distributed Abstract Machine for Boxed Ambient Calculi , 2004, ESOP.

[17]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[18]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1999 .

[19]  Francesco Zappa Nardelli De la sémantique des processus d'ordre supérieur , 2003 .

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

[21]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[22]  Hans Hüttel,et al.  Review: Davide Sangiorgi, David Walker, The $\pi $-Calculus: A Theory of Mobile Processes , 2002 .

[23]  Matthew Hennessy,et al.  An efficiency preorder for processes , 1991, Acta Informatica.

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

[25]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[26]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[27]  Michele Bugliesi,et al.  Communication Interference in Mobile Boxed Ambients , 2002, FSTTCS.

[28]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[29]  Michele Bugliesi,et al.  Boxed Ambients , 2001, TACS.

[30]  Michele Bugliesi,et al.  Information Flow Security for Boxed Ambients , 2002, F-WAN@ICALP.

[31]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[32]  Giuseppe Castagna,et al.  The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity , 2002, FSTTCS.

[33]  Francesco Zappa Nardelli,et al.  Bisimulation Proof Methods for Mobile Ambients , 2003, ICALP.

[34]  Davide Sangiorgi,et al.  Mobile safe ambients , 2003, TOPL.

[35]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[36]  Davide Sangiorgi,et al.  A Distributed Abstract Machine for Safe Ambients , 2001, ICALP.

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

[38]  Matthew Hennessy,et al.  A bisimulation-based semantic theory of Safe Ambients , 2006, TOPL.