Skip to main content

A Distributed Abstract Machine for Safe Ambients

Extended Abstract

  • Conference paper
  • First Online:

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

Abstract

The Ambient calculus [4] is a model for mobile distributed computing. An ambient is the unit of movement. Processes within the same ambient may exchange messages; ambients may be nested, so to form a hierarchical structure. The three primitives for movement allow: an ambient to enter another ambient, n[ in m. P | Q] | m[R] → m[ n[ P | Q] | R]; an ambient to exit another ambient, m[ n[ out m. P | Q] | R] → n[ P | Q] ~ m[R]; a process to dissolve an ambient boundary thus obtaining access to its content, open n. P ~ n[Q] → P | Q.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bugliesi, G. Castagna. Secure safe ambients. 28th POPL. 2001.

    Google Scholar 

  2. L. Cardelli. Ambit. http://www.luca.demon.co.uk/Ambit/Ambit.html 1997.

  3. L. Cardelli. Mobile ambient synchronisation. Technical Report 1997-013, Digital SRC, 1997.

    Google Scholar 

  4. L. Cardelli, A.D. Gordon. Mobile ambients. FoSSaCS’ 98, LNCS 1378, 1998.

    Google Scholar 

  5. L. Cardelli, A.D. Gordon. Equational properties of mobile ambients. FoSSaCS’99, LNCS 1578, 1999.

    Google Scholar 

  6. L. Cardelli, A.D. Gordon. Types for mobile ambients. 26th POPL, 1999.

    Google Scholar 

  7. L. Cardelli, A.D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. 27th POPL, 2000.

    Google Scholar 

  8. C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, D. Rémy. A calculus of mobile processes. CONCUR’ 96, LNCS 1119, 1996.

    Google Scholar 

  9. C. Fournet, J.-J. Lévy, A. Schmitt. An asynchronous distributed implementation fo mobile ambients. IFIP TCS2000, LNCS 1872, 2000.

    Google Scholar 

  10. F. Le Fessant. The Jocaml system prototype. http://www.join.inria.fr/jocaml. 1998.

  11. F. Levi, D. Sangiorgi. Controlling interference in ambients. 27th POPL, 2000.

    Google Scholar 

  12. F. Nielson, H.R. Nielson Shape analysis for mobile ambients. 27th POPL, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sangiorgi, D., Valente, A. (2001). A Distributed Abstract Machine for Safe Ambients. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics