Reflecting mobile ambients into the π-calculus

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

Volumn 2874, Issue , 2003, Pages 25-56

  Brodo, Linda ^a   Degano, Pierpaolo ^b   Priami, Corrado ^c  

^a ITC IRST   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION;

AMBIENTS; MOBILE AMBIENTS; PI CALCULUS; SUITABLE CONDITIONS; TRANSITION SYSTEM;

CALCULATIONS;

EID: 0347587023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40042-4_2     Document Type: Article

References (24)

1. L. Brodo, P. Degano, and C. Priami. A tool for quantitative analysis of π-calculus processes. In R. Gorrieri, editor, Proceedings of Process Algebra and Performance Modelling (PAPM'00), Geneva, 2000. Carleton Scientific.
2. L. Brodo and C. Priami. Performance considerations on the wap secure transpor layer. In D. Nowak, editor, Proceedings of Automated Verification of Critical Systems (AVoCS'01), Oxford, UK, 2001.
3. M. Bugliesi, G. Castagna, and S. Crafa. Access control for mobile agents: The calculus of boxed ambients. ACM Transactions on Programming Languages and Systems. to appear.
4. L. Cardelli, G. Ghelli, and A. D. Gordon. Mobility types for mobile ambients. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, Proceedings of International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of LNCS, pages 230-239, Prague, Czech Republic, 1999. Springer-Verlag.
5. L. Cardelli and A. Gordon. Mobile Ambients. Theoretical Computer Science, 240/1:177-213, 2000.
6. S. Conchon and F. Le Fessant. Jocaml: Mobile agents for objective-caml. In Proceedings of Agent Systems and Applications and International Symposium on Mobile Agents (ASA/MA '99), pages 22-29, Palm Springs, California, USA, 1999. IEEE Computer Society.
7. S. Crafa, M.Bugliesi, and G. Castagna. Information Flow Security in Boxed Ambients. In Proceedings of Foundations of Wide Area Network Computing (F-WAN'02), number 3 in ENTCS, Malaga, Spain, 2002. Elsevier.
8. P. Degano and C. Priami. Non-interleaving semantics for mobile processes. Theoretical Computer Science, 216(1-2):237-270, 1999.
9. P. Degano and C. Priami. Enhanced operational semantics: a tool for describing and analyzing concurrent systems. ACM Computing Surveys, 33(2):135-176, 2001.
10. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proceedings of Principles of Programming Languages (POPL '96), pages 372-385, St. Petersburg Beach, Florida, USA, 1996. ACM Press.
11. C. Fournet and G. Gonthier. The Join Calculus: A language for distributed mobile programming. In G. Barthe, P. Dybjer, L. Pinto, and J. Saraiva, editors, Proceedings of Applied Semantics (APPSEM'00), volume 2395 of LNCS, pages 268-332, Caminha, Portugal, 2002. Springer-Verlag.
12. C. Fournet, J.J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. D. Mosses, and T. Ito, editors, Proceedings of the IFIP Theoretical Computer Science (IFIP TCS'00), volume 1872 of LNCS, pages 348-364, Sendai, Japan, 2000.
13. X. Guan and J. You. Encoding channels in typed ambients. unpublished manuscript.
14. M. Hennessy and J. Riely. Resource access control in systems of mobile agents. Information and Computation, 173(1):82-120, 2002.
15. F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proceedings of Principles of Programming Languages (POPL '00), pages 352-364, Boston, Massachusetts, USA, 2000. ACM Press.
16. R. Milner. Communicating and Mobile Systems: The π Calculus. Cambridge University Press, 1999.
17. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100(1):1-77, 1992.
18. D. Sangiorgi. Expressing Mobility in Process Algebra. PhD thesis, University of Edinburgh, Edinburgh, U. K., 1993.
19. P. Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In Proceedings of International Colloquium on Automata, Languages, and Programming (ICALP '98), volume 1443 of LNCS, Aalborg, Denmark, 1998.
20. B. Thomsen. A calculus of higher order communicating systems. In Proceedings of Principles of Programming Languages (POPL'89), pages 143-154, Austin, Texas, USA, 1989. ACM Press.
21. B. Thomsen. Plain CHOCS: A second generation calculus for higher order processes. Acta Informatica, 30(1):1-59, 1993.
22. B. Thomsen, L. Leth, and T.-M. Kuo. A facile tutorial. In U. Montanari and V. Sassone, editors, Proceedings of Concurrency Theory (CONCUR'96), volume 1119, pages 278-298. Springer-Verlag, 1996.
23. B. Victor and F. Moller. The Mobility Workbench - A tool for the π-calculus. In D. Dill, editor, Proceedings of Computer Aided Verification (CAV'94), volume 818 of LNCS, pages 428-440, Stanford, California, USA, 1994. Springer-Verlag.
24. P. Zimmer. On the Expressiveness of Pure Mobile Ambients. Mathematical Structures of Computer Science, 13, 2003.