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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Martín Abadi, Secrecy by Typing in Security Protocols. JACM 46, 5 (September 1999, 749–786.
Martín Abadi, and Andrew D. Gordon, A Calculus for Cryptographic Protocols: the Spi Calculus. Information and Computation 148(1999): 1–70.
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.
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.
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.
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.
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.
Silvano Dal Zilio, Spatial Congruence for Ambients is Decidable. Technical Report MSR-TR-2000-41, Microsoft Research, May 2000.
Furio Honsell, Marino Miculan and Ivan Scangnetto, π-Calculus in (Co) Inductive Type Theory. TCS 2000
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.
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.
Robin Milner, Communicating and Mobile Sysetms: the π-Calculus. Cambridge University Press, 1999.
Robin Milner, Joachim Parrow and David Walker, A Calculus of Mobile Proceseses, Parts 1–2. Information and Computation, 100(1), 1–77, 1992.
Davide Sangiorgi, Extensionality and Intensionality in the Ambient Logistics, Proceedings of the 28th ACM Symposium on Principles of Programming Languages, 2001. pp. 4–13.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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