Skip to main content
SpringerLink
Log in

Logical Properites of Name Restriction

  • Conference paper
  • First Online:
Book cover Typed Lambda Calculi and Applications (TLCA 2001)

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

Included in the following conference series:

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.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Martín Abadi, Secrecy by Typing in Security Protocols. JACM 46, 5 (September 1999, 749–786.

    Article  MathSciNet  Google Scholar 

  2. Martín Abadi, and Andrew D. Gordon, A Calculus for Cryptographic Protocols: the Spi Calculus. Information and Computation 148(1999): 1–70.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Chapter  Google Scholar 

  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. 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.

    Chapter  Google Scholar 

  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. Silvano Dal Zilio, Spatial Congruence for Ambients is Decidable. Technical Report MSR-TR-2000-41, Microsoft Research, May 2000.

    Google Scholar 

  9. Furio Honsell, Marino Miculan and Ivan Scangnetto, π-Calculus in (Co) Inductive Type Theory. TCS 2000

    Google Scholar 

  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. 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.

    Chapter  Google Scholar 

  12. Robin Milner, Communicating and Mobile Sysetms: the π-Calculus. Cambridge University Press, 1999.

    Google Scholar 

  13. Robin Milner, Joachim Parrow and David Walker, A Calculus of Mobile Proceseses, Parts 1–2. Information and Computation, 100(1), 1–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, USA

    Luca Cardelli & Andrew D. Gordon

Authors
  1. Luca Cardelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew D. Gordon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, USA

    Samson Abramsky

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cardelli, L., Gordon, A.D. (2001). Logical Properites of Name Restriction. In: Abramsky, S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45413-6_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45413-6_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41960-0

  • Online ISBN: 978-3-540-45413-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation