Expressiveness of spatial logic for trees

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 280-289

  Boneva, Iovka ^a   Talbot, Jean Marc ^a   Tison, Sophie ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; AUTOMATION; CONSTRAINT THEORY; DATA STRUCTURES; TREES (MATHEMATICS);

SECOND-ORDER LOGIC; SEMISTRUCTURED DATA; SPATIAL LOGIC; UNORDERED TREES;

FORMAL LOGIC;

EID: 26844468121     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A. Arnold and D. Wink. Rudiments of μ-Calculus. North-Holland, 2001.
2. I. Boneva and J.-M. Talbot. On Complexity of Model-Checking for the TQL Logic. In 3rd IFIP Int. Conf. on Theoretical Computer Science (TCS2004), pages 381-394, 2004.
3. I. Boneva and J-M. Talbot. Automata and Logics for Unranked and Unordered Trees. In 16th Int. Conf. on Rewriting Techniques and Applications (RTA), volume 3467 of LNCS, pages 500-515, Springer, 2005.
4. L. Caires and L. Cardelli. A Spatial Logic for Concurrency (part I). Information and Computation, 186(2): 194-235, 2003.
5. C. Calcagno, L. Cardelli, and A. D. Gordon. Deciding Validity in Spatial Logic for Trees. In ACM SIGPLAN int. workshop on Types in languages design and implementation, pages 62-73, 2003.
6. L. Cardelli, P. Gardner, and G. Ghelli. A Spatial Logic for Querying Graphs. In 29th Int. Colloquium on Automata, Languages and Programming (ICALP), volume 2380 of LNCS, pages 597-610. Springer, 2002.
7. L. Cardelli and G. Ghelli. A Query Language Based on the Ambient Logic. In European Symp. on Programming (ESOP), volume 2028 of LNCS, pages 1-22. Springer, 2001.
8. L. Cardelli and G. Ghelli. TQL: A Query Language for Semistructured Data Based on the Ambient Logic. Mathematical Structures in Computer Science, 14:285-327, 2004.
9. L. Cardelli and A. D. Gordon. Anytime, Anywhere: Modal Logics for Mobile Ambients. In 27th ACM Symp. on Principles of Programming Languages (POPL'00), pages 365-377. ACM, 2000.
10. L. Cardelli and A. D. Gordon. Mobile Ambients. TCS, 240:177-213, 2000.
11. W. Charatonik, S. Dal Zilio, A. D. Gordon, S. Mukhopadhyayd, and J.-M. Talbot. Model Checking Mobile Ambients. TCS, 308(3):277-331, 2003.
12. S. Dal Zilio and D. Lugiez. XML Schema, Tree Logic and Sheaves Automata. In Rewriting Techniques and Applications, 14th Int. Conf. (RTA), volume 2706 of LNCS, pages 246-263. Springer, 2003.
13. S. Dal Zilio, D. Lugiez, and C. Meyssonnier. A Logic You Can Count on. In 31st ACM SIGPLAN-SIGACT symp. on Principles of programming languages, pages 135-146. ACM, 2004.
14. A. Dawar, P. Gardner, and G. Ghelli. Expressiveness and Complexity of Graph Logic. Technical report, Imperial College, 2004.
15. J. Goubault-Larrecq and K. N. Verma. Alternating Two-way AC-Tree Automata. Research Report, Laboratoire Spécification et Vérification, November 2002.
16. D. Lugiez. Counting and Equality Constraints for Multitree Automata. In Foundations of Software Science and Computational Structures: 6th Int. Conf., FOSSACS, volume 2620 of LNCS, pages 328 - 342. Springer, 2003.
17. M. L. Minsky. Recursive insolvability of Post's problem of "tag" ard other topics in the theory of turing machines. In Annals of Mathematics, Second Series, volume 74, pages 437-455, 1961.
18. P. W. O'Hearn, J. C. Reynolds, and H. Yang:. Local Reasoning about Programs that Alter Data Structures. In Computer Science Logic (CSL), volume 2142 of LNCS, pages 1-19. Springer, 2001.
19. J C. Reynolds. Separation Logic: A Logic for Shared Mutable Data Structures. In 17th IEEE Symp. on Logic in Computer Science (LICS), pages 55-74. IEEE Computer Society, 2002.
20. H. Seidl, T. Schwentick, and A. Muscholl. Numerical Document Queries. In 22nd ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 155-166. ACM, 2003.