Deciding validity in a spatial logic for trees

Journal of Functional Programming

Volumn 15, Issue 4, 2005, Pages 543-572

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

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE TREES; PROOF PROCEDURES; SEMI STRUCTURED DATA; SEQUENT CALCULUS; SOUND AND COMPLETE; SPATIAL LOGIC; TYPE SYSTEMS;

DIFFERENTIATION (CALCULUS);

FORESTRY;

EID: 23444458687     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796804005404     Document Type: Review

References (27)

1. Bray, T., Pauli, J. and Sperberg-McQueen, C. M. (1998) Extensible markup language. W3C Recommendation 10-February-1998.
2. Buneman, P. (1997) Semistructured data. 16th ACM Symposium on Principles of Database Systems (PODS'97), pp. 117-121.
3. Caires, L. and Cardelli, L. (2002) A spatial logic for concurrency (Part II). Concur 2002 - Concurrency Theory: Lecture Notes in Computer Science 2421, pp. 209-225. Springer.
4. Caires, L. and Cardelli, L. (2003) A spatial logic for concurrency (Part I). Information & Computation, 186(2), 194-235.
5. π. Proceedings 7th European Symposium on Programming (ESOP'99): Lecture Notes in Computer Science 1381, pp. 42-56. Springer.
6. Calcagno, C., Yang, H. and O'Hearn, P. (2001) Computability and complexity results for a spatial assertion language for data structures. Foundations of Software Technology and Theoretical Computer Science (FSTCS'01): Lecture Notes in Computer Science 2245, pp. 108-119. Springer.
7. Calcagno, C., Cardelli, L. and Gordon, A. D. (2002) Deciding validity in a spatial logic for trees. Technical report MSR-TR-2002-113, Microsoft Research.
8. Calcagno, C., Cardelli, L. and Gordon, A. D. (2003) Deciding validity in a spatial logic for trees. Types in Language Design and Implementation (TLDI), pp. 62-73.
9. Cardelli, L. and Ghelli, G. (2001) A query language based on the ambient logic. Proceedings 9th European Symposium on Programming (ESOP'01): Lecture Notes in Computer Science 2028, pp. 1-22. Springer.
10. Cardelli, L. and Gordon, A. D. (2000) Anytime, anywhere: Modal logics for mobile ambients. 27th Symposium on Principles of Programming Languages (POPL'00), pp. 365-377. ACM.
11. Cardelli, L. and Gordon, A. D. (2001) Logical properties of name restriction. Proceedings 5th International Conference on Typed Lambda Calculi and Applications (TLCA'01): Lecture Notes in Computer Science 2044, pp. 46-60. Springer.
12. Cardelli, L., Gardner, P. and Ghelli, G. (2002) A spatial logic for querying graphs. Automata, Languages and Programming (ICALP'02): Lecture Notes in Computer Science 2380, pp. 597-610. Springer.
13. Charatonik, W. and Talbot, J.-M. (2001) The decidability of model checking mobile ambients. Proceedings 15th Annual Conference of the European Association for Computer Science Logic: Lecture Notes in Computer Science 2142, pp. 339-354. Springer.
14. Charatonik, W., Dal Zilio, S., Gordon, A. D., Mukhopadhyay, S. and Talbot, J.-M. (2003) The complexity of model checking mobile ambients. Theor. Comput. Sci. 300, 379-409.
15. Cohen, E. (2002) Validity and model checking for logics of finite multisets. Unpublished note, Microsoft Research.
16. Conforti, G. and Ghelli, G. (2004) Decidability of freshness, undecidability of revelation. Foundations of Software Science and Computation Structures (FOSSACS'04): Lecture Notes in Computer Science 2987, pp. 105-120. Springer.
17. Dal Zilio, S., Lugiez, D. and Meyssonnier, C. (2004) A logic you can count on. 31st Symposium on Principles of Programming Languages (POPL'04), pp. 135-146. ACM.
18. Hirschkoff, D., Lozes, E. and Sangiorgi, D. (2002) Separability, expressiveness, and decidability in the ambient logic. Logic in Computer Science (LIS'02), pp. 423-432. IEEE.
19. Hosoya, H. and Pierce, B. C. (2000) XDuce: A typed XML processing language. Third International Workshop on the Web and Databases (WEBDB2000): Lecture Notes in Computer Science 1997, pp. 226-244. Springer.
20. Hosoya, H. and Pierce, B. C. (2001) Regular expression pattern matching for XML. 28th Symposium on Principles of Programming Languages (POPL'01), pp. 67-80. ACM.
21. Ishtiaq, S. and O'Hearn, P. W. (2001) BI as an assertion language for mutable data structures. 28th Symposium on Principles of Programming Languages (POPL'01), pp. 14-26. ACM.
22. Lincoln, P. D., Mitchell, J. C., Scedrov, A. and Shankar, N. (1992) Decision problems for propositional linear logic. Annals Pure & Appl. Logic, 56, 239-311.
23. Lozes, E. (2003). Adjuncts elimination in the static ambient logic. 10th International Workshop on Expressiveness in Concurrency (Express'03).
24. Lugiez, D. and Dal Zilio, S. (2002) Multitrees automata, Presburger's constraints and tree logics. Laboratoire d'Informatique Fondamentale, CNRS and Université de Provence.
25. O'Hearn, P., Reynolds, J. and Yang, H. (2001) Local reasoning about programs that alter data structures. Computer Science Logic (CSL'01): Lecture Notes in Computer Science 2142, pp. 1-19. Springer.
26. Reynolds, J. C. (2002) Separation logic: a logic for shared mutable data structures. Logic in Computer Science (LICS'02), pp. 55-74. IEEE.
27. Urquhart, A. (1984) The undecidability of entailment and relevant implication. J. Symbolic Logic, 45, 1059-1073.