Alternation-free modal mu-calculus for data trees

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 131-140

  Jurdziáski, Marcin ^a   Lazić, Ranko ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING TREE; DATA TREE; FINITE ALPHABET; FIRST ORDER LOGIC; MODAL OPERATORS; MU-CALCULUS; ORDERED TREE; SATISFIABILITY; TREE AUTOMATA; TREE NODES; UNDECIDABILITY;

AUTOMATA THEORY; CALCULATIONS; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; FORESTRY; QUERY LANGUAGES;

TREES (MATHEMATICS);

EID: 82755175867     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.11     Document Type: Conference Paper

References (31)

1. R. Alur and T. Henzinger. A really temporal logic. JACM, 41(1):181-204, 1994.
2. M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. In PODS, pages 25-36. ACM, 2005. (Pubitemid 43275467)
3. H. Björklund and M. Bojaáczyk. Bounded depth data trees. In ICALP, LNCS. Springer, 2007.
4. M. Bojaáczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. In PODS, pages 10-19. ACM, 2006. (Pubitemid 46946462)
5. M. Bojaáczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In LICS, pages 7-16. IEEE, 2006. (Pubitemid 47130347)
6. T. Bray, J. Paoli, and C. Sperberg-McQueen. Extensible markup language (XML) 1.0. W3C Recommendation, 1998.
7. J. Clark and S. DeRose. XML path language (XPath). W3C Recommendation, 1999.
8. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2):244-263, 1986. (Pubitemid 16633197)
9. C. David. Mots et données infinies. Master's thesis, LIAFA, Université Paris 7, 2004.
10. P. deGroote, B. Guillaume, and S. Salvati. Vector addition tree automata. In LICS, pages 64-73. IEEE, 2004.
11. S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. In LICS, pages 17-26. IEEE, 2006. (Pubitemid 47130348)
12. S. Demri, R. Lazić, and D. Nowak. On the freeze quantifier in Constraint LTL: decidability and complexity. I & C, 205(1):2-24, 2007. (Pubitemid 44854451)
13. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In LICS, pages 267-278. IEEE, 1986. (Pubitemid 17563576)
14. K. Etessami, M. Vardi, and T. Wilke. First-order logic with two variables and unary temporal logic. I & C, 179(2):279-295, 2002.
15. A. Finkel and P. Schnoebelen. Well-structured transitions systems everywhere! TCS, 256(1-2):63-92, 2001.
16. T. French. Quantified propositional temporal logic with repeating states. In TIME-ICTL, pages 155-165. IEEE, 2003.
17. F. Geerts and W. Fan. Satisfiability of XPath queries with sibling axes. In DBPL, volume 3774 of LNCS, pages 122-137. Springer, 2005. (Pubitemid 43943733)
18. S. Hallé, R. Villemaire, and O. Cherkaoui. CTL model checking for labelled tree queries. In TIME, pages 27-35. IEEE, 2006. (Pubitemid 44815995)
19. M. Kaminski and N. Francez. Finite-memory automata. TCS, 134(2):329-363, 1994.
20. M. Kaminski and T. Tan. Tree automata over infinite alphabets. Poster at CIAA, 2006.
21. O. Kupferman and M. Vardi. Weak alternating automata are not that weak. ACM TOCL, 2(3):408-429, 2001.
22. R. Lazić. Safely freezing LTL. In FSTTCS, volume 4337 of LNCS, pages 381-392. Springer, 2006.
23. A. Lisitsa and I. Potapov. Temporal logic with predicate λ-abstraction. In TIME, pages 147-155. IEEE, 2005.
24. M. Minsky. Computation, Finite and Infinite Machines. Prentice Hall, 1967.
25. F. Neven, T. Schwentick, and V. Vianu. Finite state machines for strings over infinite alphabets. ACM TOCL, 5(3):403-435, 2004.
26. P. Odifreddi. Classical Recursion Theory II. Elsevier, 1999.
27. D. Olteanu, T. Furche, and F. Bry. An efficient single-pass query evaluator for XML data streams. In SAC, pages 627-631. ACM, 2004.
28. J. Ouaknine and J. Worrell. On Metric temporal logic and faulty Turing machines. In FOSSACS, volume 3921 of LNCS, pages 217-230. Springer, 2006. (Pubitemid 44019342)
29. P. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. IPL, 83(5):251-261, 2002. (Pubitemid 34704431)
30. L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL, volume 4207 of LNCS, pages 41-57. Springer, 2006. (Pubitemid 44617548)
31. I. Walukiewicz. Pushdown processes: Games and model-checking. I & C, 164(2):234-263, 2001.