Skip to main content

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

Included in the following conference series:

Abstract

A tutorial introduction to the key concepts of ambient calculi and their type disciplines, illustrated through a number of systems proposed in the last few years, such as Mobile Ambients, Safe Ambients, Boxed Ambients, and other related calculi with types.

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

Access this chapter

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. Amtoft, T., Kfoury, A.J., Pericas-Geertsen, S.M.: What are Polymorphically Typed Ambients? In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, pp. 206–220. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Barbanera, F., Dezani-Ciancaglini, M., Salvo, I., Sassone, V.: A type inference algorithm for secure ambients. In: TOSCA 2001. ENTCS, vol. 62, Elsevier, Amsterdam (2002)

    Google Scholar 

  3. Bugliesi, M., Castagna, G.: Secure Safe Ambients. In: POPL 2001, pp. 222–235. ACM Press, New York (2001)

    Chapter  Google Scholar 

  4. Bugliesi, M., Castagna, G.: Behavioural Typing for Safe Ambients. Computer Languages 28(1), 61–99 (2002)

    MATH  Google Scholar 

  5. Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 38–63. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Cardelli, L.: Abstractions for mobile computations. In: Vitek, J. (ed.) Secure Internet Programming. LNCS, vol. 1603, pp. 51–94. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Cardelli, L., Ghelli, G., Gordon, A.D.: Types for the Ambient Calculus. Information and Computation 177, 160–194 (2002)

    MATH  MathSciNet  Google Scholar 

  8. Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998); Expanded version in Theoretical Computer Science, Special Issue on Coordination 240(1), 177–213 (June 2000)

    Chapter  Google Scholar 

  9. Cardelli, L., Gordon, A.D.: Types for mobile ambients. In: POPL 1999, pp. 79–92. ACM Press, New York (1999)

    Chapter  Google Scholar 

  10. Cardelli, L., Gordon, A.D.: Anytime, anywhere. Modal logics for mobile ambients. In: POPL 2000, pp. 365–377. ACM Press, New York (2000)

    Chapter  Google Scholar 

  11. Castagna, G., Ghelli, G., Zappa Nardelli, F.: Typing Mobility in the Seal Calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 82–101. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Castellani, I.: Process algebras with localities. In: Handbook of Process Algebra, pp. 945–1045. North-Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  13. Coppo, M., Dezani-Ciancaglini, M.: A fully abstract model for mobile ambients. In: TOSCA 2001. ENTCS, vol. 62, Elsevier, Amsterdam (2001)

    Google Scholar 

  14. Coppo, M., Dezani-Ciancaglini, M.: A fully abstract model for higher-order mobile ambients. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 255–271. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Coppo, M., Dezani-Ciancaglini, M., Giovannetti, E., Salvo, I.: M3: Mobility types for mobile processes in mobile ambients. In: CATS 2003. ENTCS, vol. 78, Elsevier, Amsterdam (2003)

    Google Scholar 

  16. Dezani-Ciancaglini, M., Salvo, I.: Security types for safe mobile ambients. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol. 1961, pp. 215–236. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Fournet, C., Lévy, J.-J., Schmitt, A.: An Asynchronous, Distributed Implementation of Mobile Ambients. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 348–364. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Godskesen, J.C., Hildebrandt, T., Sassone, V.: A Calculus of Mobile Resources. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 272–287. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Hennessy, M., Riely, J.: Resource access control in systems of mobile agents (extended abstract). In: HLCL 1998. ENTCS, vol. 16(3), pp. 1–15. Elsevier, Amsterdam (1998)

    Google Scholar 

  20. Levi, F., Sangiorgi, D.: Controlling interference in ambients. In: POPL 2000, pp. 352–364. ACM Press, New York (2000)

    Chapter  Google Scholar 

  21. Merro, M., Sassone, V.: Typing and subtyping mobility in boxed ambients. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 304–320. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. Milner, R.: The polyadic π-calculus: A tutorial. In: Logic and Algebra of Specification. NATO ASI Series F: Computer and Systems Sciences, vol. 94, pp. 203–246. Springer, Heidelberg (1993)

    Google Scholar 

  23. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts 1-2. Information and Computation 100(1), 1–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  24. Regev, A., Panina, E.M., Silverman, W., Cardelli, L., Shapiro, E.: BioAmbients: An Abstraction for Biological Compartments. Theoretical Computer Science, Elsevier (2003) (to appear)

    Google Scholar 

  25. Sangiorgi, D., Valente, A.: A distributed abstract machine for Safe Ambients. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 408–420. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  26. Stefani, J.-B.: A Calculus of Kells. In: 2nd Workshop on Foundations of Global Computing (2003) (to appear)

    Google Scholar 

  27. Yoshida, N., Hennessy, M.: Assigning Types to Processes. Information and Computation 173, 82–120 (2002)

    Article  MathSciNet  Google Scholar 

  28. Wells, J.: The essence of principal typings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 913–925. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  29. Zimmer, P.: Subtyping and Typing Algorithms for Mobile Ambients. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 375–390. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giovannetti, E. (2003). Ambient Calculi with Types: A Tutorial. In: Priami, C. (eds) Global Computing. Programming Environments, Languages, Security, and Analysis of Systems. GC 2003. Lecture Notes in Computer Science, vol 2874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40042-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40042-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20583-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics