Types for the ambient calculus

Information and Computation

Volumn 177, Issue 2, 2002, Pages 160-194

  Cardelli, Luca ^a   Ghelli, Giorgio ^b   Gordon, Andrew D ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; MOBILE COMPUTING; SET THEORY;

AMBIENT CALCULUS; CONCURRENT CALCULUS; DISTRIBUTED LANGUAGE;

COMPUTATIONAL METHODS;

EID: 0037107040     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3121     Document Type: Article

References (36)

1. Abadi, M. (1999), Secrecy by typing in security protocols, J. Assoc. Comput. Mach. 46, 749-786.
2. Abadi, M., and Cardelli, L. (1996), "A Theory of Objects," Springer-Verlag, Berlin.
3. Amadio, R.M. (1997), An asynchronous model of locality, failure, and process mobility, in "COORDINATION 97," Lecture Notes in Computer Science, Vol. 1282, Springer-Verlag, Berlin.
4. Amadio, R. M., and Prasad, S. (1994), Localities and failures, in "Foundations of Software Technology and Theoretical Computer Science (FSTTCS'94)," Lecture Notes in Computer Science, Vol. 880, pp. 205-216, Springer-Verlag, Berlin.
5. Amtoft, T., Kfoury, A. J., and Pericas-Geertsen, S. M. (2001) What are polymorphically-typed ambients? in "Programming Languages and Systems: 10th European Symposium on Programming (ESOP 2001)," Lecture Notes in Computer Science, pp. 206-220, Springer-Verlag, Berlin.
6. Bodei, C., Degano, P., Nielson, F., and Riis Nielson, H. (1998), Control flow analysis for the π-calculus, in "Concurrency Theory (Concur'98)," Lecture Notes in Computer Science, Vol. 1466, pp. 84-98, Springer-Verlag, Berlin.
7. Boudol, G. (1992) "Asynchrony and the π-Calculus (Note)," Rapport de Recherche 1702, INRIA Sophia-Antipolis, May.
8. Bugliesi, M., and Castagna, G. (2001), Secure safe ambients, in "28th ACM Symposium on Principles of Programming Languages (POPL'01)," pp. 222-235.
9. Cardelli, L., Ghelli, G., and Gordon, A. D. (1999), Mobility types for mobile ambients, in "26th International Colloquium on Automata, Languages, and Programming (ICALP'99)," Lecture Notes in Computer Science, Vol. 1644, pp. 230-239, Springer-Verlag, Berlin.
10. Cardelli, L., Ghelli, G., and Gordon, A. D. (2000), Ambient groups and mobility types, in "Theoretical Computer Science (IFIP TCS 2000)," Lecture Notes in Computer Science, Vol. 1872, pp. 333-347, Springer-Verlag, Berlin.
11. Cardelli, L., Ghelli, G., and Gordon, A. D. (2000), Secrecy and group creation, in "CONCUR 2000 - Concurrency Theory" (C. Palamidessi, Ed.), Lecture Notes in Computer Science, Vol. 1877, pp. 365-379, Springer-Verlag, Berlin.
12. Cardelli, L., and Gordon, A. D. (1999), Types for mobile ambients, in "26th ACM Symposium on Principles of Programming Languages (POPL'99)," pp. 79-92.
13. Cardelli, L., and Gordon, A. D. (2000), Mobile ambients, Theoret. Comput. Sci. 240, 177-213.
14. Coquand, T., and Huet, G. (1988), The calculus of constructions, Inform. and Comput. 76, 95-120.
15. Dal Zilio, S., and Gordon, A. D. (2000), Region analysis and a π-calculus with groups, in "Mathematical Foundations of Computer Science 2000," Lecture Notes in Computer Science, Vol. 1893, pp. 1-20, Springer-Verlag, Berlin, Accepted for publication in J. Funct. Program.
16. De Nicola, R., Ferrari, G., and Pugliese, R. (1999), Types as specifications of access policies, in "Secure Internet Programming 1999," Lecture Notes in Computer Science, Vol. 1603, pp. 117-146, Springer-Verlag, Berlin.
17. Degano, P., Levi, F., and Bodei, C. (2000), Safe ambients: Control flow analysis and security, in "Advances in Computing Science (ASIAN'00)," Lecture Notes in Computer Science, Vol. 1961, pp. 199-214, Springer-Verlag, Berlin.
18. Dezani-Ciancaglini, M., and Salvo, I. (2000), Security types for mobile safe ambients, in "Advances in Computing Science (ASIAN'00)," Lecture Notes in Computer Science, Vol. 1961, pp. 215-236, Springer-Verlag, Berlin.
19. Feret, J. (2001), Abstract interpretation-based static analysis of mobile ambients, in "Static Analysis (SAS'01)," Lecture Notes in Computer Science, Vol. 2126, pp. 412-430, Springer-Verlag, Berlin.
20. Hansen, R.R., Jensen, J. G., Nielson, F., and Riis Nielson, H. (1999), Abstract interpretation of mobile ambients, in "Static Analysis (SAS'99)," Lecture Notes in Computer Science, Vol. 1694, pp. 134-148, Springer-Verlag, Berlin.
21. Honda, K., and Tokoro, M. (1991), An object calculus for asynchronous communication, in "European Conference on Object-Oriented Programming (ECOOP'91)," Lecture Notes in Computer Science, pp. 133-147, Springer-Verlag, Berlin.
22. Lange, D., and Oshima, M. (1998), "Programming and Deploying Java Mobile Agents with Aglets," Addison-Wesley, Reading, MA.
23. Levi, F., and Bodei, C. (2000), Security analysis for mobile ambients, in "Workshop on Issues in the Theory of Security (WITS'00)," pp. 18-23.
24. Levi, F., and Maffeis, S. (2001), An abstract interpretation framework for analysing mobile ambients, in "Static Analysis (SAS'01)," Lecture Notes in Computer Science, Vol. 2126, pp. 395-411, Springer-Verlag, Berlin.
25. Levi, F., and Sangiorgi, D. (2000), Controlling interference in ambients, in "27th ACM Symposium on Principles of Programming Languages (POPL'00)," pp. 352-364.
26. Lindholm, T., and Yellin, F. (1997), "The Java Virtual Machine Specification," Addison-Wesley, Reading, MA.
27. Milner, R. (1999), "Communicating and Mobile Systems: The π-Calculus," Cambridge Univ. Press. Cambridge, UK.
28. Morrisett, G., Walker, D., Crary, K., and Glew, N. (1999), From system F to typed assembly language. ACM Trans. Program. Lang. System 21, 528-569.
29. Nielson, F., Riis Nielson, H., Hansen, R.R., and Jensen, J. G. (1999), Validating firewalls in mobile ambients, in "Concurrency Theory (Concur'99)," Lecture Notes in Computer Science, Vol. 1664, pp. 463-477, Springer-Verlag, Berlin.
30. Nielson, F., Riis Nielson, H., and Sagiv, M. (2000), A Kleene analysis of mobile ambients, in "Programming Languages and Systems: 9th European Symposium on Programming (ESOP'00)," Lecture Notes in Computer Science, Vol. 1782, pp. 305-319, Springer-Verlag, Berlin.
31. Riis Nielson, H., and Neilson, F. (2000), Shape analysis for mobile ambients, in "27th ACM Symposium on Principles of Programming Languages (POPL'00)," pp. 135-148.
32. Riely, J., and Hennessy, M. (1998), A typed language for distributed mobile processes, in "25th ACM Symposium on Principles of Programming Languages (POPL'98)," pp. 378-390.
33. Sewell, P. (1998), Global/local subtyping and capability inference for a distributed π-calculus, in "25th International Colloquium on Automata, Languages, and Programming (ICALP'98)," Lecture Notes in Computer Science, Vol. 1443, pp. 695-706, Springer-Verlag, Berlin.
34. Tofte, M., and Talpin, J.-P. (1997), Region-based memory management, Inform. and Comput. 132, 109-176.
35. White, J. E. (1996) Mobile agents, in "Software Agents" (J. Bradshaw, Ed.), AAAI Press/MIT Press, Menlo Park, CA/Cambridge, MA.
36. Zimmer, P. (2000), Subtyping and typing algorithms for mobile ambients, in "Foundations of Software Science and Computation Structures (FOSSACS'00)," Lecture Notes in Computer Science, Vol. 1784, pp. 375-390, Springer-Verlag, Berlin.