Abstract
Boxed Ambients (BA) replace Mobile Ambients’open capability with 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 ofBAaimed 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.
Research supported by ‘MyThS: Models andTypes for Security in Mobile Distributed Systems’, EU FET-GC IST-2001-32617.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Arun-Kumar and M. Hennessy. An Efficiency Preorder for Processes. Acta Informatica, 29:737–760, 1992.
M. Bugliesi, G. Castagna, and S. Crafa. BoxedAmbients. In Proceedings of TACS’01, number 2215 in Lecture Notes in Computer Science, 38–63, Springer, 2001.
L. Cardelli and A. Gordon. Mobile Ambients. In Proceedings of FoSSaCS’98, number 1378 in Lecture Notes in Computer Science, 140–155. Springer, 1998.
L. Cardelli and A. Gordon. Equational Properties for Mobile Ambients. In Proceedings FoSSaCS’99, volume 1578 Lecture Notes in Computer Science, 212–226, Springer, 1999.
S. Crafa, M. Bugliesi, and G. Castagna. Information Flow Security for Boxed Ambients. In F-WAN: Int. Workshop on Foundations of Wide Area Network Computing, ENTCS 66.3, Elsevier, 2002.
K. Honda and N. Yoshida. On Reduction-based Process Semantics. Theoretical Computer Science, 152(2):437–486, 1995.
F. Levi and D. Sangiorgi. Controlling Interference in Ambients. In Proceedins of POPL’00, 352–364, ACM Press, 2000.
M. Merro and M. Hennessy. Bisimulation Congruences in Safe Ambients. In Proceedings of POPL’02, 71–80. ACM Press, 2002.
M. Merro and V. Sassone. Typing and Subtyping Mobility in BoxedAmbients. In Proceedings of CONCUR’02, volume 2421 Lecture Notes in Computer Science, 304–320, Springer, 2002.
R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Parts I and II. Information and Computation, 100:1–77, September 1992.
B.C. Pierce and U. Nestmann. Decoding Choice Encodings. Information and Computation, 163:1–59, 2000.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992.
D. Sangiorgi. Bisimulation for Higher-Order Process Calculi. Information and Computation, 131(2):141–178, 1996.
D. Sangiorgi and R. Milner. The problem of “Weak Bisimulation up to”. In Proceedings of CONCUR’92, volume 630 of Lecture Notes in Computer Science, 32–46. Springer, 1992.
J. Vitek and G. Castagna. Seal: A framework for Secure Mobile Computations. In Internet Programming Languages, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bugliesi, M., Crafa, S., Merro, M., Sassone, V. (2002). Communication Interference in Mobile Boxed Ambients. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive