Finite-control mobile ambients

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

Volumn 2305, Issue , 2002, Pages 295-313

  Charatonik, Witold ^a,b   Gordon, Andrew D ^c   Talbot, Jean Marc ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

^c MICROSOFT RESEARCH   (United States)

^d ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); MODEL CHECKING;

AMBIENT CALCULUS; DISTRIBUTED AND MOBILE COMPUTATIONS; FINITE CONTROL; FINITE NUMBER; MOBILE AMBIENTS; MODEL CHECKING ALGORITHM; PROCESS CALCULI; PSPACE-COMPLETE;

PROCESS CONTROL;

EID: 84957057595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45927-8_21     Document Type: Conference Paper

References (17)

1. R.M. Amadio and Ch. Meyssonnier. On the decidability of fragments of the asynchronous pi-calculus. In Electronic Notes in Theoretical Computer Science, Proceedings EXPRESS 2001, 2001.
2. M. Bugliesi and G. Castagna. Secure safe ambients. In 28th ACM Symposium on Principles of Programming Languages (POPL’01), pages 222–235, 2001.
3. L. Cardelli and A. D. Gordon. Equational properties of mobile ambients. In Proceedings FoSSaCS’99, volume 1578 of LNCS, pages 212–226. Springer, 1999.
4. L. Cardelli and A. D. Gordon. Modal logics for mobile ambients: Semantic reasoning. Unpublished annex to [5], 1999.
5. L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings POPL’00, pages 365–377. ACM, January 2000.
6. L. Cardelli and A. D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177– 213, 2000.
7. L. Cardelli and A. D. Gordon. Logical properties of name restriction. In Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (TLCA’01), volume 2044 of LNCS, pages 46–60. Springer, 2001.
8. L. Cardelli and A.D. Gordon. Types for mobile ambients. In 26th ACM Symposium on Principles of Programming Languages (POPL’99), pages 79–92, 1999.
9. S. Chaki, S.K. Rajamani, and J. Rehof. Types as models: Model checking message-passing programs. In 29th ACM Symposium on Principles of Programming Languages (POPL’02), 2002. To appear.
10. W. Charatonik, S. Dal Zilio, A. D. Gordon, S. Mukhopadhyay, and J.-M. Talbot. The complexity of model checking mobile ambients. In Proceedings FoSSaCS’01, volume 2030 of LNCS, pages 152–167. Springer, 2001. An extended version appearas as Technical Report MSR–TR–2001–03, Microsoft Research, 2001.
11. W. Charatonik and J.-M. Talbot. The decidability of model checking mobile ambients. In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, volume 2142 of LNCS, pages 339–354. Springer, 2001.
12. M. Dam. Model checking mobile processes. Information and Computation, 121(1):35–51, 1996.
13. R.R. Hansen, J.G. Jensen, F. Nielson, and H. Riis Nielson. Abstract interpretation of mobile ambients. In Static Analysis (SAS’99), volume 1694 of Lecture Notes in Computer Science, pages 134–148. Springer, 1999.
14. F. Levi and D. Sangiorgi. Controlling interference in ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL’00), pages 352–364, 2000.
15. R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
16. F. Nielson, H. Riis Nielson, R.R. Hansen, and J.G. Jensen. Validating firewalls in mobile ambients. In Concurrency Theory (Concur’99), volume 1664 of Lecture Notes in Computer Science, pages 463–477. Springer, 1999.
17. D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proceedings POPL’01, pages 4–13. ACM, January 2001.