Model checking mobile ambients

Theoretical Computer Science

Volumn 308, Issue 1-3, 2003, Pages 277-331

  Charatonik, Witold ^a   Dal Zilio, Silvano ^c   Gordon, Andrew D ^c   Mukhopadhyay, Supratik ^b   Talbot, Jean Marc ^c  

^a UNIVERSITY OF WROC AW   (Poland)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c NONE

Author keywords

Ambient calculus; Ambient logic; Mobile computation; Model checking; Verification

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

AMBIENT CALCULUS;

COMPUTER SCIENCE;

EID: 0142124718     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00832-0     Document Type: Article

References (30)

1. N. Busi, G. Zavattaro, On the expressiveness of movement in pure mobile ambients, in: Foundations of Wide Area Network Computing, 2002, Electron. Notes in Theoret. Comput. Sci. 66 (3), Elsevier, 2002.
2. L. Caires, L. Cardelli, A spatial logic for concurrency (part I), in: Theoretical Aspects of Computer Software (TACS 2001), Lecture Notes in Computer Science, Vol. 2215, Springer, Berlin, 2001, pp. 1-37.
3. L. Caires, L. Cardelli, A spatial logic for concurrency (part II), in: CONCUR 2002 - Concurrency Theory, Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 209-225.
4. π, in: European Symp. on Programming (ESOP'99), Lecture Notes in Computer Science, Vol. 1381, Springer, Berlin, 1998, pp. 42-56.
5. L. Cardelli, P. Gardner, G. Ghelli, A spatial logic for querying graphs, in: Automata, Languages and Programming (ICALP'02), Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 597-610.
6. L. Cardelli, G. Ghelli, A query language based on the ambient logic, in: European Symposium on Programming (ESOP'01), Lecture Notes in Computer Science, Vol. 2028, Springer, Berlin, 2001, pp. 1-22.
7. L. Cardelli, A. Gordon, Logical properties of name restriction, in: Typed Lambda Calculi and Applications (TLCA'01), Lecture Notes in Computer Science, Vol. 2044, Springer, Berlin, 2001, pp. 46-60.
8. L. Cardelli, A.D. Gordon, Types for mobile ambients, in: 26th ACM Symp. on Principles of Programming Languages (POPL'99), 1999, pp. 79-92.
9. L. Cardelli, A.D. Gordon, Anytime, anywhere: Modal logics for mobile ambients, in: 27th ACM Symp. on Principles of Programming Languages (POPL'00), 2000, pp. 365-377.
10. Cardelli L., Gordon A.D. Mobile ambients. Theoret. Comput. Sci. 240:2000;177-213.
11. W. Charatonik, S. Dal Zilio, A.D. Gordon, S. Mukhopadhyay, J.-M. Talbot, The complexity of model checking mobile ambients, in: Foundations of Software Science and Computation Structures (FoSSaCS'01), Lecture Notes in Computer Science, Vol. 2030, Springer, Berlin, 2001, pp. 152-167.
12. W. Charatonik, A.D. Gordon, J.-M. Talbot, Finite-control mobile ambients, in: European Symposium on Programming (ESOP'02), Lecture Notes in Computer Science, Vol. 2305, Springer, Berlin, 2002, pp. 295-313.
13. W. Charatonik, J.-M. Talbot, The decidability of model checking mobile ambients, in: Computer Science Logic (CSL'01), Lecture Notes in Computer Science, Vol. 2142, Springer, Berlin, 2000, pp. 339-354.
14. S. Dal Zilio, Spatial congruence for ambients is decidable, in: 6th Asian Computing Sci. Conf. (ASIAN'00), Lecture Notes in Computer Science, Vol. 1961, Springer, Berlin, 2000, pp. 88-103.
15. M. Dam, Relevance logic and concurrent composition, in: Logic in Computer Science (LICS'88), IEEE, New York, 1998, pp. 178-185.
16. Došen K. A historical introduction to substructural logics. Schroeder-Heistler P., Došen K. Substructural Logics. Studies in Logic and Computation. Vol. 2:1994;1-30 Clarendon Press, Oxford.
17. G.-Y. Girard, Y. Lafont, Linear logic and lazy computation, in: TAP-SOFT 87, Lecture Notes in Computer Science, Vol. 250 (2), Springer, Berlin, 1987, pp. 53-66.
18. Gordon A.D., Cardelli L. Equational properties of mobile ambients. Math. Structures Comput. Sci. 12:2002;1-38.
19. D. Hirschkoff, E. Lozes, D. Sangiorgi, Separability, expressiveness and decidability in the ambient logic, in: Logic in Computer Science (LICS'02), IEEE, New York, 2002, pp. 423-432.
20. S. Ishtiaq, P.W. O'Hearn, BI as an assertion language for mutable data structures, in: 28th ACM Symp. on Principles of Programming Languages (POPL'01), 2001, pp. 14-26.
21. J.W. Lloyd, Foundations of Logic Programming, in: Symbolic Computation, 2nd extended Edition, Springer, Berlin, 1987.
22. P. O'Hearn, J. Reynolds, H. Yang, Local reasoning about programs that alter data structures, in: Computer Science Logic (CSL'01), Lecture Notes in Computer Science, Vol. 2142, Springer, Berlin, 2001, pp. 1-19.
23. O'Hearn P.W., Pym D.J. The logic of bunched implications. Bull. Symbolic Logic. 5(2):1999;215-244.
24. Post E.L. Recursively enumerable sets of positive integers and their decision problems. Bull. Amer. Math. Soc. 50:1944;284-316.
25. J.C. Reynolds, Intuitionistic reasoning about shared mutable data structure, in: Millennial Perspectives in Computer Science, Palgrave, Basingstoke, 2000.
26. D. Sangiorgi, Extensionality and intensionality of the ambient logics, in: 28th ACM Symp. on Principles of Programming Languages (POPL'01), 2001, pp. 4-13.
27. Savitch W. Relationships between nondeterministic and deterministic tape complexities. J. Comput. System Sci. 4(2):1970;177-192.
28. Stockmeyer L.J. The polynomial-time hierarchy. Theoret. Comput. Sci. 3(1):1976;1-22.
29. Trakhtenbrot B.A. The impossibility of an algorithm for the decision problem for finite models. Dokl. Akad. Nauk SSR. 70:1950;569-572.
30. Urquhart A. Semantics for relevant logics. J. Symbolic Logic. 37(1):1972;159-169.