Advertisement

Logical Properites of Name Restriction

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

Abstract

We extend the modal logic of ambients decribed in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions about restricted names, and we study their properties.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Martín Abadi, Secrecy by Typing in Security Protocols. JACM 46, 5 (September 1999, 749–786.CrossRefMathSciNetGoogle Scholar
  2. [2]
    Martín Abadi, and Andrew D. Gordon, A Calculus for Cryptographic Protocols: the Spi Calculus. Information and Computation 148(1999): 1–70.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    Luís Caires and Luís Monteiro, Verifiable and Executable Logic Specifications of Concurrent Objects in L π. In Programming Languages and Systems, Proceedings of ESOP’98, Chris Hankin (Ed.), LNCS, Springer, 1998. pp. 42–56.CrossRefGoogle Scholar
  4. [4]
    Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon, Secrecy and Group Creation. Catuscia Palamidessi, editor. Proceedings of CONCUR 2000. LNCS 1877, Springer 2000, pp. 365–379.CrossRefGoogle Scholar
  5. [5]
    Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon, Ambient Groups and Mobility Types. Proceedings of IFIP TCS2000. J. van Leeuwen, O. Watanabek, M. Hagiya, P.D. Mosses, T. Ito (Eds.). THeoretical COmputer Science; Exploring New Frontiers in Theoretical Informatics. LNCS 1872, Springer, 2000. pp. 333–347.Google Scholar
  6. [6]
    Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon, Mobile Ambients, Founations of Software Science and Computational Structures, Maurice Nivat (Ed.), LNCS 1378, Springer, 1998. pp. 140–155.CrossRefGoogle Scholar
  7. [7]
    Luca Cardelli and Andrew D. Gordon, Anytime, Anywhere, Modal Logics for Mobile Ambients. Proceedings of the 27th ACM Symposium on Principles of Programming Languages, 2000, pp. 365–377.Google Scholar
  8. [8]
    Silvano Dal Zilio, Spatial Congruence for Ambients is Decidable. Technical Report MSR-TR-2000-41, Microsoft Research, May 2000.Google Scholar
  9. [9]
    Furio Honsell, Marino Miculan and Ivan Scangnetto, π-Calculus in (Co) Inductive Type Theory. TCS 2000Google Scholar
  10. [10]
    Murdoch J. Gabbay and Andrew M. Pitts, A New Approach to Abstract Syntax Involving Binders. In Proceedings 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999. IEEE Computer Society Pres, 1999. pp 214–224.Google Scholar
  11. [11]
    Andrew D. Gordon and Luca Cardelli, Equational Properties of Mobile Ambients, Wolfgant Thomas, Editor. Foundations of Software Science and Computational Structures, Second International Conference, FOSSACS’99. LNCS 1578. Springer, 1999. pp 212–226.CrossRefGoogle Scholar
  12. [12]
    Robin Milner, Communicating and Mobile Sysetms: the π-Calculus. Cambridge University Press, 1999.Google Scholar
  13. [13]
    Robin Milner, Joachim Parrow and David Walker, A Calculus of Mobile Proceseses, Parts 1–2. Information and Computation, 100(1), 1–77, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Davide Sangiorgi, Extensionality and Intensionality in the Ambient Logistics, Proceedings of the 28th ACM Symposium on Principles of Programming Languages, 2001. pp. 4–13.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Luca Cardelli
    • 1
  • Andrew D. Gordon
    • 1
  1. 1.Microsoft ResearchUSA

Personalised recommendations