Skip to main content
SpringerLink
Log in

Boxed Ambients

  • Conference paper
  • First Online:
Theoretical Aspects of Computer Software (TACS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2215))

Included in the following conference series:

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.

Work partially supported by MURST Project 9901403824 003, by CNRS Program Telecommunications: “Collaborative, distributed, and secure programming for Internet”, and by Galileo Action n. 02841UD

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. G. Boudol. Asynchrony and the π-calculus. Research Report 1702, INRIA, http://wwwsop.inria.fr/mimosa/personnel/Gerard.Boudol.html, 1992.

  4. C. Bryce and J. Vitek. The JavaSeal mobile agent kernel. Autonomous Agents and Multi-Agent Systems, 2002. To appear.

    Google Scholar 

  5. L. Cardelli. Abstractions for Mobile Computation, volume 1603 of Lecture Notes in Computer Science, pages 51–94. Springer, 1999.

    Google Scholar 

  6. L. Cardelli. Global computing. In IST FET Global Computing Consultation Workshop, 2000. Slides.

    Google Scholar 

  7. L. Cardelli and A. Gordon. Mobile ambients. In Proceedings of POPL’ 98. ACM Press, 1998.

    Google Scholar 

  8. L. Cardelli and A. Gordon. Types for mobile ambients. In Proceedings of POPL’ 99, pages 79–92. ACM Press, 1999.

    Google Scholar 

  9. 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. 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. 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. 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. 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. 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. 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. 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. 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.

    Chapter  Google Scholar 

  18. M. Hennessy and J. Riely. Resource access control in systems of mobile agents. Information and Computation, 2001. To appear.

    Google Scholar 

  19. F. Levi and D. Sangiorgi. Controlling interference in Ambients. In POPL’ 00, pages 352–364. ACM Press, 2000.

    Google Scholar 

  20. H. R. Nielson and F. Nielson. Shape analysis for mobile ambients. In POPL’ 00, pages 135–148. ACM Press, 2000.

    Google Scholar 

  21. 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. 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. J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, number 1686 in LNCS. Springer, 1999.

    Chapter  Google Scholar 

  24. 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 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Univ. “Ca’ Foscari”, Venezia, Italy

    Michele Bugliesi & Silvia Crafa

  2. Département d’Informatique, École Normale Supérieure, Paris, France

    Giuseppe Castagna & Silvia Crafa

Authors
  1. Michele Bugliesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Castagna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvia Crafa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Tokyo Institute of Technology Graduate School of Information Science and Engineering, 2-12-1 Oo-okayama, Meguro-ku, Tokyo, 152-8552, Japan

    Naoki Kobayashi

  2. Department of Computer and Information Science, University of Pennsylvania, 200 S. 33rd St., Philadelphia, PA, 19104, USA

    Benjamin C. Pierce

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bugliesi, M., Castagna, G., Crafa, S. (2001). Boxed Ambients. In: Kobayashi, N., Pierce, B.C. (eds) Theoretical Aspects of Computer Software. TACS 2001. Lecture Notes in Computer Science, vol 2215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45500-0_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45500-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42736-0

  • Online ISBN: 978-3-540-45500-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation