Equational properties of mobile ambients

Mathematical Structures in Computer Science

Volumn 13, Issue 3, 2003, Pages 371-408

  Gordon, Andrew D ^a   Cardelli, Luca ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974672431     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129502003742     Document Type: Article

References (20)

1. Abadi, M., Fournet, C. and Gonthier, G. (1998) Secure communications implementation of channel abstractions. 13th IEEE Symposium on Logic in Computer Science (LICS'98) 105–116.
2. Abadi, M. and Gordon, A.D. (1999) A calculus for cryptographic protocols: The spi calculus. Information and Computation 148 1–70.
3. Berry, G. and Boudol, G. (1992) The chemical abstract machine. Theoretical Computer Science 96 (1) 217–248.
4. Cardelli, L. (1999) Abstractions for mobile computation. In: Jensen, C. and Vitek, J. (eds.) Secure Internet Programming: Issues in Distributed and Mobile Object Systems. Springer-Verlag Lecture Notes in Computer Science 1603 51–94.
5. Cardelli, L. and Gordon, A. D. (1999) Types for mobile ambients. 26th ACM Symposium on Principles of Programming Languages (POPL’99) 79–92.
6. Cardelli, L. and Gordon, A. D. (2000a) Anytime, anywhere: Modal logics for mobile ambients. 27th ACM Symposium on Principles of Programming Languages (POPL'00) 365–377.
7. Cardelli, L. and Gordon, A. D. (2000b) Mobile ambients. Theoretical Computer Science 240 177–213.
8. De Nicola, R. and Hennessy, M. (1984) Testing equivalences for processes. Theoretical Computer Science 34 83–133.
9. Fournet, C. and Gonthier, G. (1996) The reflexive CHAM and the Join-calculus. 23rd ACM Symposium on Principles of Programming Languages (POPL’96) 372–385.
10. Fournet, C., Levy, J.-J. and Schmitt, A. (2000) An asynchronous distributed implementation of mobile ambients. In: IFIP International Conference on Theoretical Computer Science (IFIP TCS 2000). Springer-Verlag Lecture Notes in Computer Science 1872 348–364.
11. Gordon, A. D. and Cardelli, L. (1999) Equational properties of mobile ambients. Foundations of Software Science and Computation Structures (FoSSaCS'99). Springer-Verlag Lecture Notes in Computer Science 1578 212–226. (An extended version appears as Microsoft Research Technical Report MSR-TR-99-11, April 1999.)
12. Levi, F. and Sangiorgi, D. (2000) Controlling interference in ambients. 27th ACM Symposium on Principles of Programming Languages (POPL'00) 352–364.
13. Merro, M. and Hennessy, M. (2002) Bisimulation congruences in safe ambients. 29th ACM Sympo-sium on Principles of Programming Languages (POPL,02) 71–80. Milner, R. (1977) Fully abstract models of typed lambda-calculi. Theoretical Computer Science 4 1–23.
14. Milner, R. (1999) Communicating and Mobile Systems: the π-Calculus, Cambridge University Press.
15. Morris, J. H. (1968) Lambda-Calculus Models of Programming Languages, Ph. D. thesis, MIT.
16. Plotkin, G. D. (1977) LCF considered as a programming language. Theoretical Computer Science 5 223–255.
17. Sangiorgi, D. (2001) Extensionality and intensionality of the ambient logics. 28th ACM Symposium on Principles of Programming Languages (POPL'01) 4–13.
18. Sangiorgi, D. and Walker, D. (2001) The π-calculus: a Theory of Mobile Processes, Cambridge University Press.
19. Vigliotti, M. G. (1999) Transition systems for the ambient calculus, Master’s thesis, Imperial College of Science, Technology and Medicine.
20. Vitek, J. and Castagna, G. (1999) Seal: A framework for secure mobile computations. In: Internet Programming Languages. Springer-Verlag Lecture Notes in Computer Science 1686 47–77.