Advertisement

Boxed Ambients

  • Michele Bugliesi
  • Giuseppe Castagna
  • Silvia Crafa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2215)

Abstract

Boxed Ambients are a variant of Mobile Ambients that result from (i) dropping the open capability and (ii) providing new primitives for ambient communication while retaining the constructs in and out for mobility. The new model of communication is faithful to the principles of distribution and location awareness of Mobile Ambients, and complements the constructs for Mobile Ambient mobility with finer-grained mechanisms for ambient interaction.

Keywords

Local Exchange Type System Moded Typing Parallel Composition Typing Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BC01]
    M. Bugliesi and G. Castagna. Secure safe ambients. In Proc. of the 28th ACM Symposium on Principles of Programming Languages, pages 222–235, London, 2001. ACM Press.Google Scholar
  2. [BCC01]
    M. Bugliesi, G. Castagna, and S. Crafa. Reasoning about security in mobile ambients. In CONCUR 2001 (12th. International Conference on Concurrency Theory), Lecture Notes in Computer Science, Aahrus, Danemark, 2001. Springer. To appear.Google Scholar
  3. [Bou92]
    G. Boudol. Asynchrony and the π-calculus. Research Report 1702, INRIA, http://wwwsop.inria.fr/mimosa/personnel/Gerard.Boudol.html, 1992.
  4. [BV02]
    C. Bryce and J. Vitek. The JavaSeal mobile agent kernel. Autonomous Agents and Multi-Agent Systems, 2002. To appear.Google Scholar
  5. [Car99]
    L. Cardelli. Abstractions for Mobile Computation, volume 1603 of Lecture Notes in Computer Science, pages 51–94. Springer, 1999.Google Scholar
  6. [Car00]
    L. Cardelli. Global computing. In IST FET Global Computing Consultation Workshop, 2000. Slides.Google Scholar
  7. [CG98]
    L. Cardelli and A. Gordon. Mobile ambients. In Proceedings of POPL’ 98. ACM Press, 1998.Google Scholar
  8. [CG99]
    L. Cardelli and A. Gordon. Types for mobile ambients. In Proceedings of POPL’ 99, pages 79–92. ACM Press, 1999.Google Scholar
  9. [CGG99]
    L. Cardelli, G. Ghelli, and A. Gordon. Mobility types for mobile ambients. In Proceedings of ICALP’ 99, number 1644 in Lecture Notes in Computer Science, pages 230–239. Springer, 1999.Google Scholar
  10. [CGG00]
    L. Cardelli, G. Ghelli, and A. D. Gordon. Ambient groups and mobility types. In International Conference IFIP TCS, number 1872 in Lecture Notes in Computer Science, pages 333–347. Springer, 2000.Google Scholar
  11. [CGZ01]
    G. Castagna, G. Ghelli, and F. Zappa. Typing mobility in the Seal Calculus. In CONCUR 2001 (12th. International Conference on Concurrency Theory), Lecture Notes in Computer Science, Aahrus, Danemark, 2001. Springer. To appear.Google Scholar
  12. [DCS00]
    M. Dezani-Ciancaglini and I. Salvo. Security types for safe mobile ambients. In Proceedings of ASIAN’ 00, pages 215–236. Springer, 2000.Google Scholar
  13. [DLB00]
    P. Degano, F. Levi, and C. Bodei. Safe ambients: Control flow analysis and security. In Proceedins of ASIAN’ 00, volume 1961 of LNCS, pages 199–214. Springer, 2000.Google Scholar
  14. [FG97]
    R. Focardi and R. Gorrieri. Non interference: Past, present and future. In Proceedings of DARPA Workshop on Foundations for Secure Mobile Code, pages 26–28, march 1997.Google Scholar
  15. [FLA00]
    C. Fournet, J-J. Levy, and Shmitt. A. An asynchronous, distributed implementation of mobile ambients. In International Conference IFIP TCS, number 1872 in Lecture Notes in Computer Science. Springer, 2000.Google Scholar
  16. [GM82]
    J.A. Goguen and J. Meseguer. Security policy and security models. In Proceedings of Symposium on Secrecy and Privacy, pages 11–20. IEEE Computer Society, april 1982.Google Scholar
  17. [HR00]
    M. Hennessy and J. Riely. Information flow vs. resource access in the asynchronous π-calculus (extended abstract). In Automata, Languages and Programming, 27th International Colloquium, volume 1853 of LNCS, pages 415–427. Springer, 2000.CrossRefGoogle Scholar
  18. [HR01]
    M. Hennessy and J. Riely. Resource access control in systems of mobile agents. Information and Computation, 2001. To appear.Google Scholar
  19. [LS00]
    F. Levi and D. Sangiorgi. Controlling interference in Ambients. In POPL’ 00, pages 352–364. ACM Press, 2000.Google Scholar
  20. [NN00]
    H. R. Nielson and F. Nielson. Shape analysis for mobile ambients. In POPL’ 00, pages 135–148. ACM Press, 2000.Google Scholar
  21. [NNHJ99]
    F. Nielson, H. Riis Nielson, R. R. Hansen, and J. G. Jensen. Validating firewalls in mobile ambients. In Proc. CONCUR’ 99, number 1664 in LNCS, pages 463–477. Springer, 1999.Google Scholar
  22. [SV00]
    P. Sewell and J. Vitek. Secure composition of untrusted code: Wrappers and causality types. In 13th IEEE Computer Security Foundations Workshop, 2000.Google Scholar
  23. [VC99]
    J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, number 1686 in LNCS. Springer, 1999.CrossRefGoogle Scholar
  24. [Zim00]
    P. Zimmer. Subtyping and typing algorithms for mobile ambients. In Proceedins of FoSSaCS’ 99, volume 1784 of LNCS, pages 375–390. Springer, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Michele Bugliesi
    • 1
  • Giuseppe Castagna
    • 2
  • Silvia Crafa
    • 1
    • 2
  1. 1.Dipartimento di InformaticaUniv. “Ca’ Foscari”VeneziaItaly
  2. 2.Département d’InformatiqueÉcole Normale SupérieureParisFrance

Personalised recommendations