Communication interference in mobile boxed ambients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2556 LNCS, Issue , 2002, Pages 71-84

  Bugliesi, Michele ^a   Crafa, Silvia ^a   Merro, Massimo ^b   Sassone, Vladimiro ^c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b EPFL   (Switzerland)

^c UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SOFTWARE ENGINEERING;

AMBIENT BOUNDARIES; BOXED AMBIENTS; COMMUNICATION INTERFERENCES; COMMUNICATION MECHANISMS; COMMUNICATION PRIMITIVES; MESSAGE RECEPTION; MOBILE AMBIENTS; SAFE AMBIENTS;

ACCESS CONTROL;

EID: 84877738879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_8     Document Type: Conference Paper

References (15)

1. S. Arun-Kumar and M. Hennessy. An Efficiency Preorder for Processes. Acta Informatica, 29:737-760, 1992.
2. M. Bugliesi, G. Castagna, and S. Crafa. Boxed Ambients. In Proceedings of TACS'01, number 2215 in Lecture Notes in Computer Science, 38-63, Springer, 2001.
3. L. Cardelli and A. Gordon. Mobile Ambients. In Proceedings of FoSSaCS'98, number 1378 in Lecture Notes in Computer Science, 140-155. Springer, 1998.
4. 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.
5. 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.
6. K. Honda and N. Yoshida. On Reduction-based Process Semantics. Theoretical Computer Science, 152(2):437-486, 1995.
7. F. Levi and D. Sangiorgi. Controlling Interference in Ambients. In Proceedins of POPL'00, 352-364, ACM Press, 2000.
8. M. Merro and M. Hennessy. Bisimulation Congruences in Safe Ambients. In Proceedings of POPL'02, 71-80. ACM Press, 2002.
9. M. Merro and V. Sassone. Typing and Subtyping Mobilityin BoxedAmbients. In Proceedings of CONCUR'02, volume 2421 Lecture Notes in Computer Science, 304-320, Springer, 2002.
10. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Parts I and II. Information and Computation, 100:1-77, September 1992.
11. B.C. Pierce and U. Nestmann. Decoding Choice Encodings. Information and Computation, 163:1-59, 2000.
12. 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.
13. D. Sangiorgi. Bisimulation for Higher-Order Process Calculi. Information and Computation, 131(2):141-178, 1996.
14. 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.
15. J. Vitek and G. Castagna. Seal: A framework for Secure Mobile Computations. In Internet Programming Languages, 1999.