Deciding Validity in a Spatial Logic for Trees

Proceedings of the 2003 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation

Volumn , Issue , 2003, Pages 62-73

  Calcagno, Cristiano ^a   Cardelli, Luca ^b   Gordon, Andrew D ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b NONE

Author keywords

Algorithms; Languages; Theory

Indexed keywords

COMPUTER SOFTWARE; DATA STRUCTURES; FORMAL LOGIC; MATHEMATICAL MODELS; TREES (MATHEMATICS);

SPATIAL LOGIC;

ALGORITHMIC LANGUAGES;

EID: 0141427885     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/604181.604183     Document Type: Conference Paper

References (23)

1. Extensible markup language. http://www.w3.org/XML/.
2. P. Buneman. Semistructured data. In 16th ACM Symposium on Principles of Database Systems (PODS'97), 1997.
3. L. Caires and L. Cardelli. A spatial logic for concurrency (Part I). In Theoretical Aspects of Computer Software (TACS 2001), volume 2215 of Lecture Notes in Computer Science, pages 1-37. Springer, 2001.
4. L. Caires and L. Cardelli. A spatial logic for concurrency (Part II). In CONCUR 2002 - Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 209-225. Springer, 2002.
5. π. In Proceedings of the 7th European Symposium on Programming (ESOP'99), volume 1381 of Lecture Notes in Computer Science, pages 42-56. Springer, 1998.
6. C. Calcagno, L. Cardelli, and A. D. Gordon. Deciding validity in a spatial logic for trees. Technical Report MSR-TR-2002-113, Microsoft Research, 2002.
7. C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), volume 2245 of Lecture Notes in Computer Science, pages 108-119. Springer, 2001.
8. L. Cardelli, P. Gardner, and G. Ghelli. A spatial logic for querying graphs. In Automata, Languages and Programming (ICALP'02), volume 2380 of Lecture Notes in Computer Science, pages 597-610. Springer, 2002.
9. L. Cardelli and G. Ghelli. A query language based on the ambient logic. In Proceedings of the 9th European Symposium on Programming (ESOP'01), volume 2028 of LNCS, pages 1-22. Springer, 2001.
10. L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL'00), pages 365-377, 2000.
11. 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 Lecture Notes in Computer Science, pages 46-60. Springer, 2001.
12. 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 appears as Technical Report MSR-TR-2001-03, Microsoft Research, 2001.
13. 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.
14. E. Cohen. Validity and model checking for logics of finite multisets. Draft, Microsoft Research, 2002.
15. D. Hirschkoff, E. Lozes, and D. Sangiorgi. Separability, expressiveness, and decidability in the ambient logic. In Logic in Computer Science (LICS'02), pages 423-432. IEEE, 2002.
16. H. Hosoya and B.C. Pierce. XDuce: A typed XML processing language. In Third International Workshop on the Web and Databases (WebDB2000), volume 1997 of Lecture Notes in Computer Science, pages 226-244. Springer, 2000.
17. H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In 28th ACM Symposium on Principles of Programming Languages (POPL'01), pages 67-80, 2001.
18. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In 28th ACM Symposium on Principles of Programming Languages (POPL'01), pages 14-26, 2001.
19. P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239-311, 1992.
20. D. Lugiez and S. Dal Zilio. Multitrees automata, Presburger's constraints and tree logics. Laboratoire d'Informatique Fondamentale, CNRS and Université de Provence, 2002.
21. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Computer Science Logic (CSL'01), volume 2142 of Lecture Notes in Computer Science, pages 1-19. Springer, 2001.
22. J. C. Reynolds. Separation logic: a logic for shared mutable data structures. In Logic in Computer Science (LICS'02), pages 55-74. IEEE, 2002.
23. A. Urquhart. The undecidability of entailment and relevant implication. Journal of Symbolic Logic, 45:1059-1073, 1984.