Advertisement

Typing and Subtyping Mobility in Boxed Ambients*

  • Massimo Merro
  • Vladimiro Sassone
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2421)

Abstract

We provide a novel type system for Bugliesi et al.’s Boxed Ambients that combines value subtyping with mobility types. The former is based on read/write exchange types, the latter builds on the notion of ambient group. Mobility types allow to specify where an ambient is allowed to stay, closing existing expressiveness gaps in the literature at no additional complexity costs. Subtyping is aimed at achieving maximal generality on both communication and mobility types. We then introduce co-capabilities to express explicit permissions to access ambients. In this setting, ambient types are refined to specify who is allowed to enter an ambient, making a promising framework to model open systems.

Keywords

Type System Inference Rule Communication Type Exchange Type Process Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Bugliesi, G. Castagna and S. Crafa. Reasoning about security in mobile ambients. In Proc. CONCUR 2001, volume 2154 Lecture Notes in Computer Science, Springer, 2001.Google Scholar
  2. 2.
    M. Bugliesi, G. Castagna, and S. Crafa. Boxed ambients. In Proc. TACS 2001, volume 2215 of Lecture Notes in Computer Science, Springer, 2001.Google Scholar
  3. 3.
    L. Cardelli and G. Ghelli. A query language based an the ambient logic. In Proc. ESOP 2001, volume 2028 of Lecture Notes in Computer Science, Springer, 2001.Google Scholar
  4. 4.
    L. Cardelli. Wide area computation, In Proc. ICALP 1999, volume 1644 of Lecture Notes in Computer Science, Springer, 1999.Google Scholar
  5. 5.
    L. Cardelli, G. Ghelli, and A. Gordon. Ambient groups and mobility types. In Proc. IFIP TCS 2000, volume 1872 of Lecture Notes in Computer Science, Springer, 2000.Google Scholar
  6. 6.
    L. Cardelli and A. Gordon. Types for mobile ambients. In Proc. of POPL’99, ACM Press, 1999.Google Scholar
  7. 7.
    L. Cardelli and A. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proc. of POPL 2000, ACM Press, 2000.Google Scholar
  8. 8.
    L. Cardelli and A. Gordon. Mobile nmbients. Theoretical Computer Science, 240(1):177213, 2000. An extended abstract appeared in Proc. of FoSSaCS 1998, volume 1378 of Lecture Notes in Computer Science, Springer, 1998.Google Scholar
  9. 9.
    I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, and S. Smolka, (Eds), Handbook of Process Algebra, 945-1045, North-Holland, 2001.Google Scholar
  10. 10.
    R. De Nicola, G. Ferrari, and R. Pugliese. Klaim: A kernel language for agents interaction und mobility. IEEE Trans. an Software Engineering, 24(5), IEEE Press, 1998.Google Scholar
  11. 11.
    G. Ghelli G. Castagna and F. Zappa Nardelli. Typing mobility in the seal calculus. In Proc. CONCUR 2001, volume 2154 Lecture Notes in Computer Science, Springer, 2001.Google Scholar
  12. 12.
    E Levi and D. Sangiorgi. Controlling interference in ambients. In Proc. POPL 2000, ACM Press.Google Scholar
  13. 13.
    M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. Proc. POPL’02, ACM Press, 2002Google Scholar
  14. 14.
    M. Merro and V Sassone. Typing and subtyping mobility in boxed ambients. To appear as Technical Report available at http://www.cogs.susx.ac.uk/reports. University of Sussex.
  15. 15.
    R. Milner. Communication und Concurrency. Prentice Hall, 1989.Google Scholar
  16. 16.
    R. Milner, J. Parrow, and D. Walken A calculus of mobile processes, (Parts I und II). Information and Computation, 100:1–77, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    B. Pierce and D. Sangiorgi. Typing und subtyping for mobile processes. Journal of Mathematical Structures in Computer Science, 6(5):409–454, 1996.Google Scholar
  18. 18.
    J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, volume 1686 of Lecture Notes in Computer Science, Springer, 1999.CrossRefGoogle Scholar
  19. 19.
    Y Yang, X. Guan, and J. You.Typing evolving nmbients. Information Processing Letters, 80(5):265–270, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    N. Yoshida and M. Hennessy. Subtyping and locality in distributed higher order processes. In Proc. CONCUR 1999, volume 1664 of Lecture Notes in Computer Science, Springer, 1999.Google Scholar
  21. 21.
    N. Yoshida and M. Hennessy. Assigning types to processes. In Proc. LICS 2000, IEEE Press, 2000.Google Scholar
  22. 22.
    P. Zimmer. Subtyping and typing algorithms for mobile ambients. In Proc. FoSSaCS 2000, volume 1784 of Lecture Notes in Computer Science, Springer, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Massimo Merro
    • 1
  • Vladimiro Sassone
    • 1
  1. 1.University of SussexSussex

Personalised recommendations