Advertisement

Mobility Types for Mobile Ambients

  • Luca Cardelli
  • Giorgio Ghelli
  • Andrew D. Gordon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1644)

Abstract

An ambient is a named cluster of processes and subambients, which moves as a group.We describe type systems able to guarantee that certain ambients will remain immobile, and that certain ambients will not be dissolved by their environment.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Aba97]
    M. Abadi. Secrecy by typing in security protocols. In Proceedings TACS’97, LNCS 1281, pages 611–638. Springer, 1997.Google Scholar
  2. [Ama97]
    R.M. Amadio. An asynchronous model of locality, failure, and process mobility. In Proceedings COORDINATION 97, LNCS 1282. Springer, 1997.Google Scholar
  3. [AP94]
    R.M. Amadio and S. Prasad. Localities and failures. In Proceedings FST&TCS’94, LNCS 880, pages 205–216. Springer, 1994.Google Scholar
  4. [Car99]
    L. Cardelli. Abstractions for mobile computation. In Secure Internet Programming, LNCS. Springer, 1999.Google Scholar
  5. [CG98]
    L. Cardelli and A.D. Gordon. Mobile ambients. In Proceedings FoSSaCS’98, LNCS 1378, pages 140–155. Springer, 1998.Google Scholar
  6. [CG99]
    L. Cardelli and A.D. Gordon. Types for mobile ambients. In Proceedings POPL’99, pages 79–92. ACM, January 1999.Google Scholar
  7. [CGG99a]
    L. Cardelli, G. Ghelli, and A.D. Gordon. Mobility Types for Mobile Ambients. Technical Report, Microsoft Research, 1999 (to appear).Google Scholar
  8. [CGG99b]
    L. Cardelli, G. Ghelli, and A.D. Gordon. Ambient groups and mobility types. Unpublished, 1999.Google Scholar
  9. [DFPV98]
    R. De Nicola, G. Ferrari, R. Pugliese, and B. Venneri. Types for access control. Submitted for publication, 1998.Google Scholar
  10. [GC99]
    A.D. Gordon and L. Cardelli. Equational properties of mobile ambients. In Proceedings FoSSaCS’99, LNCS 1578, pages 212–226. Springer, 1999.Google Scholar
  11. [HR98a]
    N. Heintz and J. Riecke. The SLam calculus: programming with secrecy and integrity. In Proceedings POPL’98, pages 365–377. ACM, 1998.Google Scholar
  12. [HR98b]
    M. Hennessy and J. Riely. Resource access control in systems of mobile agents. In Proceedings HLCL’98, ENTCS 16(3). Elsevier, 1998.Google Scholar
  13. [LY97]
    T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1997.Google Scholar
  14. [Mil91]
    R. Milner. The polyadic π-calculus: A tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh, October 1991.Google Scholar
  15. [RH98]
    J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proceedings POPL’98, pages 378–390. ACM, 1998.Google Scholar
  16. [Sew98]
    P. Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In Proceedings ICALP’98, LNCS 1443, pages 695–706. Springer, 1998.Google Scholar
  17. [SV98]
    G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proceedings POPL’98, pages 355–364. ACM, 1998.Google Scholar
  18. [SWP98]
    P. Sewell, P.T. Wojciechowski, and B.C. Pierce. Location independence for mobile agents. In Workshop on Internet Programming Languages, 1998.Google Scholar
  19. [SY97]
    T. Sekiguchi and A. Yonezawa. A calculus with code mobility. In Proceedings FMOODS’97, pages 21–36. IFIP, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Luca Cardelli
    • 1
  • Giorgio Ghelli
    • 2
  • Andrew D. Gordon
    • 1
  1. 1.Microsoft ResearchUSA
  2. 2.Pisa UniversityPisa

Personalised recommendations