## Communication interference in mobile boxed ambients (2002)

### Cached

### Download Links

- [www.dsi.unive.it]
- [www.cogs.susx.ac.uk]
- [www.informatics.sussex.ac.uk]
- [eprints.soton.ac.uk]
- [www.dsi.unive.it]
- [www.dsi.unive.it]
- DBLP

### Other Repositories/Bibliography

Venue: | In FST & TCS |

Citations: | 42 - 7 self |

### BibTeX

@INPROCEEDINGS{Bugliesi02communicationinterference,

author = {Michele Bugliesi and Silvia Crafa and Massimo Merro and Vladimiro Sassone},

title = {Communication interference in mobile boxed ambients},

booktitle = {In FST & TCS},

year = {2002},

pages = {71--84},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

communication primitives acting across ambient boundaries. Expressiveness is achieved at the price of communication interferences on message reception whose resolution requires synchronisation of activities at multiple, distributed locations. We study a variant of BA aimed at controlling communication interferences as well as mobility ones. Our calculus draws inspiration from Safe Ambients (SA) (with passwords) and modifies the communication mechanism of BA. Expressiveness is maintained through a new form of co-capability that at the same time registers incoming agents with the receiver ambient and performs access control.

### Citations

845 | Mobile ambients
- Cardelli, Gordon
- 1998
(Show Context)
Citation Context ...s is maintained through a new form of co-capability that at the same time registers incoming agents with the receiver ambient and performs access control. Introduction The calculus of Mobile Ambients =-=[3]-=- (MA) introduced the notion of ambient acting at the same time as administrative domain and computational environment. Processes live inside ambients, and inside ambients compute and interact. Ambient... |

267 | Expressing mobility in process algebras: first-order and higher-order paradigms - Sangiorgi - 1992 |

164 |
A calculus of Mobile
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...) Processes: p ::= 0sP 1 j P 2s(nn)Ps!p:PsM[P]sp:P The operators for inactivity, composition, restriction and replication are inherited from mainstream concurrent calculi, most notably the p-calculus =-=[10]-=-. Specific of ambient calculi are the ambient construct, M[P], and the prefix via capabilities, M:P. Meaningless terms such as enterhn; pi[P] will be ruled out by the type system in 2. We use a number... |

146 | On reduction-based process semantics
- Honda, Yoshida
- 1995
(Show Context)
Citation Context ...n all communication rules we assume that tuples have the same arity, a condition that later will be enforced by the type system. As to behavioural equivalences we focus on reduction barbed congruence =-=[6]-=-, a standard equality based on the notions of reduction relation and observability. In ambients the observation predicate P # n is used to denote the possibility of process P of interacting with the e... |

134 | Controlling interference in ambients
- Levi, Sangiorgi
- 2000
(Show Context)
Citation Context ...rentheses bind input variables. These ideas have given rise to an innovative calculus capturing several aspects of current real-world distributed systems, and have posed some new hard problems. Paper =-=[7]-=- unveiled a set of so-called grave interferences, i.e. situations where the inherent nondeterminism of movement goes wild. For instance, in k[n[in m:P j out k:R ] j m[Q ] ] ? Research supported by `My... |

98 | Decoding Choice Encodings - Nestmann, Pierce |

98 | Seal: A framework for secure mobile computations
- Vitek, Castagna
- 1999
(Show Context)
Citation Context ...of Boxed Ambients [2] (BA) was born out of the observation that, after all, there is an alternative way to yield expressiveness. Namely, direct communication across boundaries as in the Seal calculus =-=[15]. As -=-shown below, in BA it is possible to draw an input from a sub-ambient n's local channel (viz. (x) n ) as well as from the parent's local channel (viz. (x) " ), and dually with the roles of input ... |

81 | Boxed ambients
- Bugliesi, Castagna, et al.
- 2001
(Show Context)
Citation Context ...ould belong to the same ambient for their entire lifespan. Despite its usefulness, from the system designer's point of view open must be handled with the greatest care. The calculus of Boxed Ambients =-=[2]-=- (BA) was born out of the observation that, after all, there is an alternative way to yield expressiveness. Namely, direct communication across boundaries as in the Seal calculus [15]. As shown below,... |

77 | An efficiency preorder for processes
- Arun-Kumar, Hennessy
- 1992
(Show Context)
Citation Context ...hsMis:c[exithc; ai]] j exit(x;a):fjP jg ) fj c(sx)P jg , (sx) c :fj P jg Given the direct nature of the encoding, its operational correctness is simple to prove. Let > denote the expansion relation [1], an asymmetric variant of such that P > Q holds if P Q, and P has at least as many t-moves as Q. Lemma 1 (Operational Correspondence). If P t ! P 0 then fj P jg t ! > fj P 0 jg. Conversely, if... |

60 | On the problem of ‘weak bisimulation up to - Sangiorgi, Milner - 1992 |

58 | Equational Properties for Mobile Ambients - Cardelli, Gordon - 1999 |

58 | Bisimulation for Higher-Order Process Calculi - Sangiorgi - 1996 |

56 | Bisimulation congruences in safe ambients
- Merro, Hennessy
- 2002
(Show Context)
Citation Context ...rced notion of single-threadedness ensures that at any time ambients are willing to engage in at most one activity across boundaries that may lead to grave interferences. Recently, Merro and Hennessy =-=[8]-=- found useful to work with a version of SA called SAP, where incoming ambients must be able to present a suitable password in order to cross ambients' boundaries. Paper [8] develops a treatable semant... |

29 | Typing and subtyping mobility in boxed ambients
- Merro, Sassone
- 2002
(Show Context)
Citation Context ...rdsC[E] capability Exchange Types E;F ::= shh no exchangesW 1 W k tuples (k 0) Process Types T ::= [E;F ] composite exchange The main difference with respect to the type systems of [2] and [9] is in the structure of ambient types, that are defined here as one-place constructors of the form N[E], tracing the upward exchanges of ambients with this type. This simplification over previous syst... |

17 | Information Flow Security for Boxed Ambients
- Crafa, Bugliesi, et al.
- 2002
(Show Context)
Citation Context ...n 2. Observe however that limiting ourselves to banning communication interferences as above would result in a poorly expressive calculus (although some of its good properties have been underlined in =-=[5]-=-). For instance, in n[P] there would be no way for P to communicate with its sub-ambients, unless their names were statically known. In our effort to tackle interference we seem to have killed hierarc... |

17 | The problem of "weak bisimulation up to - Sangiorgi, Milner - 1992 |

1 |
Bisimulation Congruences in SafeAmbients
- Merro, Hennessy
- 2002
(Show Context)
Citation Context ...rced notion of single-threadedness ensures that at any time ambients are willing to engage in at most one activity across boundaries that may lead to grave interferences. Recently, Merro and Hennessy =-=[8]-=- found useful to work with a version of SA called SAP, where incoming ambients must be able to present a suitable password in order to cross ambients’ boundaries. Paper [8] develops a treatable semant... |

1 |
Typing and SubtypingMobility in BoxedAmbients
- Sassone
- 2002
(Show Context)
Citation Context ... C[E] capability Exchange Types E,F ::= shh no exchange W1 × · · · × Wk tuples (k ≥ 0) Process Types T ::= [E,F ] composite exchange The main difference with respect to the type systems of [2] and =-=[9]-=- is in the structure of ambient types, that are defined here as one-place constructors of the form N[E], tracing the upward exchanges of ambients with this type. This simplification over previous syst... |