Abstract
The ambient calculus is a process calculus for describing mobile computation. We develop a theory of Morris-style contextual equivalence for proving properties of mobile ambients. We prove a context lemma that allows derivation of contextual equivalences by considering contexts of a particular limited form, rather than all arbitrary contexts. We give an activity lemma that characterizes the possible interactions between a process and a context. We prove several examples of contextual equivalence. The proofs depend on characterizing reductions in the ambient calculus in terms of a labelled transition system.
Keywords
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.
Download to read the full chapter text
Chapter PDF
References
M. Abadi, C. Forunet, and G. Gonthier. Secure implementation of channel abstractions. In Proceedings LICS’98, pages 105–116, 1998.
M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation. To appear. An extended version appears as Digital Equipment Corporation Systems Research Center report No. 149, January 1998.
R. M. Amadio. An asynchronous model of locality, failure, and process mobility. In Proceedings COORDINATION 97, volume 1282 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
R. M. Amadio and S. Prasad. Localities and failures. In Proceedings FST&TCS’94, volume 880 of Lecture Notes in Computer Science, pages 205–216. Springer-Verlag, 1994.
G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96(1): 217–248, April 1992.
L. Cardelli and A. D. Gordon. Mobile ambients. In Proceedings FoSSaCS’98, volume 1378 of Lecture Notes in Computer Science, pages 140–155. Springer-Verlag, 1998.
L. Cardelli and A. D. Gordon. Types for mobile ambients. In Proceedings POPL’99, 1999. To appear.
R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.
R. Milner. Fully abstract models of typed lambda-calculi. Theoretical Computer Science, 4:1–23, 1997.
R. Milner. The polyadic π-calculus: A tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, October 1991.
R. Milner. The π-calculus. Undergraduate lecture notes, Cambridge University, 1995.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Information and Computation, 100:1–40 and 41-77, 1992.
R. Milner and D. Sangiorgi. Barbed bisimulation. In Proceedings ICALP’92, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
J. H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, December 1968.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223–255, 1977.
J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proceedings POPL’98, pages 378–390, 1998.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992. Available as Technical Report CST-99-93, Computer Science Department, University of Edinburgh.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gordon, A.D., Cardelli, L. (1999). Equational Properties of Mobile Ambients. In: Thomas, W. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1999. Lecture Notes in Computer Science, vol 1578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49019-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-49019-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65719-4
Online ISBN: 978-3-540-49019-7
eBook Packages: Springer Book Archive