M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, J. ACM, vol.55, issue.2, 2008.
DOI : 10.1145/1065167.1065172

URL : https://uhdspace.uhasselt.be/dspace/bitstream/1942/956/1/xpath.pdf

H. Björklund, W. Martens, and T. Schwentick, Optimizing Conjunctive Queries over Trees Using Schema Information, MFCS, pp.132-143, 2008.
DOI : 10.1007/978-3-540-85238-4_10

M. Boja´nczykboja´nczyk and C. David, Anca Muscholl, Thomas Schwentick, and Luc Segoufin. Two-variable logic on data trees and XML reasoning, PODS, pp.10-19, 2006.

M. Boja´nczykboja´nczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David, Two-variable logic on words with data, LICS, pp.7-16, 2006.

P. Bouyer, A. Petit, and D. Thérien, An algebraic approach to data languages and timed languages, Information and Computation, vol.182, issue.2, pp.137-162, 2003.
DOI : 10.1016/S0890-5401(03)00038-5

URL : https://doi.org/10.1016/s0890-5401(03)00038-5

J. Clark and S. Derose, XML path language (XPath) Website, 1999. W3C Recommendation

C. David, Complexity of Data Tree Patterns over XML Documents, MFCS, pp.278-289, 2008.
DOI : 10.1007/978-3-540-85238-4_22

URL : http://www.liafa.jussieu.fr/%7Ecdavid/publi/mfcs08.pdf

S. Demri and R. Lazi´clazi´c, LTL with the freeze quantifier and register automata, ACM Transactions on Computational Logic, 2009.
DOI : 10.1109/lics.2006.31

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-lics2006.pdf

S. Demri, R. Lazi´clazi´c, and D. Nowak, On the freeze quantifier in constraint LTL: Decidability and complexity, TIME, pp.113-121, 2005.
DOI : 10.1016/j.ic.2006.08.003

URL : https://doi.org/10.1016/j.ic.2006.08.003

D. Figueira, Satisfiability of downward XPath with data equality tests, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, 2009.
DOI : 10.1145/1559795.1559827

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fig-pods09.pdf

F. Geerts and W. Fan, Satisfiability of XPath Queries with Sibling Axes, DBPL, pp.122-137, 2005.
DOI : 10.1007/11601524_8

URL : http://homepages.inf.ed.ac.uk/fgeerts/pdf/trondheim05.pdf

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternating automata on data trees and XPath satisfiability, 2008.

A. Lisitsa and I. Potapov, Temporal logic with predicate lambdaabstraction, TIME, pp.147-155, 2005.
DOI : 10.1109/time.2005.34

URL : http://arxiv.org/pdf/cs/0410072

L. Marvin and . Minsky, Computation: finite and infinite machines, 1967.

J. Ouaknine and J. Worrell, On Metric Temporal Logic and Faulty Turing Machines, FoSSACS, pp.217-230, 2006.
DOI : 10.1007/3-540-58468-4_191

URL : http://www.cs.ox.ac.uk/people/joel.ouaknine/publications/mtlundec06.pdf

P. Schnoebelen, Verifying lossy channel systems has nonprimitive recursive complexity, Information Processing Letters, vol.83, issue.5, pp.251-261, 2002.
DOI : 10.1016/S0020-0190(01)00337-4

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-IPL2002.pdf