Skip to main content
SpringerLink
Log in

Using Ambients to Control Resources*

  • Conference paper
  • First Online:
CONCUR 2002 — Concurrency Theory (CONCUR 2002)

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

Included in the following conference series:

Abstract

Current software and hardware systems, being parallel and reconfigurable, raise new safety and reliability problems, and the resolution of these problems requires new methods. Numerous proposals attempt at reducingthe threat of bugs and preventing several kinds of attacks. In this paper, we develop an extension of the calculus of Mobile Ambients, named Controlled Ambients, that is suited for expressing such issues, specifically Denial of Service attacks. We present a type system for Controlled Ambients, which makes resource control possible in our setting.

Work supported by european project FET— Global Computing

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Michele Bugliesi, Giuseppe Castagna, and Silvia Crafa. Boxed ambients. In Proc. TACS 2001, LNCS 2215, pages 38–63. Springer Verlag, 2001.

    Google Scholar 

  2. Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Proc. of FOSSACS’98, volume 1378, pages 140–155. Springer Verlag, 1998.

    Google Scholar 

  3. Luca Cardelli and Andrew D. Gordon. Types for mobile ambients. In Symposium on Principles of Programming Languages (POPL’99), pages 79–92. ACM Press, 1999.

    Google Scholar 

  4. Witold Charatonik, Andrew D. Gordon, and Jean-Marc Talbot. Finite-control mobile ambients. In Proc. of ESOP’02, volume 2305 of LNCS, pages 295–313, 2002.

    Google Scholar 

  5. Karl Crary and Stephanie Weirich. Resource bound certification. In Symposium on Principles of Programming Languages (POPL’00), pages 184–198. ACM Press, 2000.

    Google Scholar 

  6. Mariangiola Dezani-Ciancaglini and Ivano Salvo. Security types for mobile safe ambients. In Proc. of ASIAN’00, LNCS 1961, pages 215–236. Springer Verlag, 2000.

    Google Scholar 

  7. Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and Didier Rémy. A calculus of mobile agents. In Proc. of CONCUR’96, pages 406–421. Springer Verlag, 1996.

    Google Scholar 

  8. Cédric Fournet, Jean-Jacques Lévy, and Alan Schmitt. A distributed implementation of mobile ambients. In Proc. of IFIP TCS’00, pages 348–364. Springer Verlag, 1872.

    Google Scholar 

  9. T. Gazagnaire and D. Pous. Implémentation des Controlled Ambients en JoCaml. Students project— Magistére d’Informatique ENS Lyon, 2002.

    Google Scholar 

  10. Andrew D. Gordon and Luca Cardelli. Equational properties of mobile ambients. In Proc. of FOSSACS’99, volume 1578 of LNCS, pages 212–226. Springer Verlag, 1999.

    Google Scholar 

  11. Xudong Guan, Yiling Yang, and Jinyuan You. Making ambients more robust. In Proc. of the International Conference on Software: Theory and Practice, pages 377–384, 2000.

    Google Scholar 

  12. Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. In Proceedings of HLCL’98, number 16.3 in ENTCS, pages 3–17. Elsevier, 1998.

    Google Scholar 

  13. Michael Hicks, Pankaj Kakkar, Jonathan T. Moore, Carl A. Gunter, and Scott Nettles. PLAN: A Packet Language for Active Networks. In Proc. ICFP’99, pages 86–93. ACM Press, 1999.

    Google Scholar 

  14. John Hughes and Lars Pareto. Recursion and dynamic data-structures in bounded space: Towards embedded ML programming. In Proc. of ICFP’99, pages 70–81. ACM Press, 1999.

    Google Scholar 

  15. Francesca Levi and Davide Sangiorgi. Controlling interference in ambients. In Symposium on Principles of Programming Languages, pages 352–364. ACM Press, 2000.

    Google Scholar 

  16. M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In Proc. of POPL’02, pages 71–80. ACM Press, 2002.

    Google Scholar 

  17. Luc Moreau. A distributed garbage collector with diffusion tree reorganisation and mobile objects. In Proc. of ICFP’98, pages 204–215. ACM Press, 1998.

    Google Scholar 

  18. James Riely and Matthew Hennessy. A typed language for distributed mobile processes. In Proc. of POPL’98, pages 378–390. ACM Press, 1998.

    Google Scholar 

  19. D. Sangiorgi and A. Valente. A distributed abstract machine for Safe Ambients. In Proc. of ICALP’01, 2001.

    Google Scholar 

  20. D. Teller, P. Zimmer, and D. Hirschkoff. UsingA mbients to Control Resources. Technical Report 2002-16, LIP-ENS Lyon, 2002.

    Google Scholar 

  21. Jan Vitek and Giuseppe Castagna. Seal: A Framework for Secure Mobile Computations. In Internet Programming Languages, volume 1686 of LNCS. Springer Verlag, 1999.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP, ENS, Lyon, France

    David Teller & Daniel Hirschkoff

  2. INRIA, Sophia Antipolis, France

    Pascal Zimmer

Authors
  1. David Teller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Zimmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Hirschkoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Teller, D., Zimmer, P., Hirschkoff, D. (2002). Using Ambients to Control Resources* . In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45694-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation