Equational properties of mobile ambients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1578, Issue , 1999, Pages 212-226

  Gordon, Andrew D ^a   Cardelli, Luca ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

AMBIENT CALCULUS; CONTEXTUAL EQUIVALENCE; LABELLED TRANSITION SYSTEMS; MOBILE AMBIENTS; MOBILE COMPUTATIONS; MORRIS-STYLE CONTEXTUAL EQUIVALENCE; PROCESS CALCULI;

COMPUTATION THEORY;

EID: 84937692789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_15     Document Type: Conference Paper

References (17)

1. M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. In Proceedings LICS’98, pages 105-116, 1998.
2. 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.
3. 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.
4. R. M. Amadio and S. Prasad. Localities and failures. In Proceedings FST&TCS’9Jh volume 880 of Lecture Notes in Computer Science, pages 205-216. Springer-Verlag,1994.
5. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96(l):217-248, April 1992.
6. 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.
7. L. Cardelli and A. D. Gordon. Types for mobile ambients. In Proceedings POPL’99, To appear.
8. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
9. R. Milner. Fully abstract models of typed lambda-calculi. Theoretical Com,put,er Science, 4:1-23, 1977.
10. 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.
11. R. Milner. The 7r-calculus. Undergraduate lecture notes, Cambridge University, 1995.
12. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Inform,ation, and Computation, 100:1-40 and 41-77, 1992.
13. R. Milner and D. Sangiorgi. Barbed bisimulation. In Proceedings ICALP’92, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
14. J. H. Morris. Lam,bda-Calculus Models of Programming Languages. PhD thesis, MIT, December 1968.
15. G. D. Plotkin. LCF considered as a programming language. Theoretical Com,put,er Science, 5:223-255, 1977.
16. J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proceedings POPL’98, pages 378-390, 1998.
17. 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.