S. Abiteboul, P. Bourhis, A. Muscholl, and Z. Wu, Recursive queries on trees and data trees, Proceedings of the 16th International Conference on Database Theory, ICDT '13, pp.93-104
DOI : 10.1145/2448496.2448509
URL : https://hal.archives-ouvertes.fr/hal-00809297

S. Abriola, P. Barceló, D. Figueira, and S. Figueira, Bisimulations on Data Graphs, Principles of Knowledge Representation and Reasoning (KR, pp.309-318, 2016.

S. Abriola, M. Emilia-descotte, R. Fervari, and S. Figueira, Axiomatizations for downward XPath on data trees, Journal of Computer and System Sciences, vol.89, 2017.
DOI : 10.1016/j.jcss.2017.05.008

N. Foto, S. Afrati, G. M. Cohen, and . Kuper, On the complexity of tree pattern containment with arithmetic comparisons, Information Processing Letters (IPL), vol.11115, 2011.

C. Areces and R. Fervari, Hilbert-Style Axiomatization for Hybrid XPath with Data, Logics in Artificial Intelligence -15th European Conference, pp.34-48, 2016.
DOI : 10.1007/3-540-45744-5_7

[. Areces, R. Fervari, and N. Seiler, Tableaux for Hybrid XPath with Data, In: Progress in Artificial Intelligence (EPIA). Lecture Notes in Computer Science, vol.30, issue.2, pp.611-623, 2017.
DOI : 10.1145/1071610.1071614

V. Bárány, D. Mikoo-laj-boja´nczykboja´nczyk, . Figueira, and . Parys, Decidable classes of documents for XPath, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS). Leibniz International Proceedings in Informatics (LIPIcs). Leibniz-Zentrum für Informatik, 2012.

H. Björklund, . Mikoo, and . Boja´nczykboja´nczyk, Bounded Depth Data Trees, International Colloquium on Automata, Languages and Programming, pp.862-874, 2007.
DOI : 10.1007/978-3-540-73420-8_74

M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, Journal of the ACM, vol.552, pp.1-79, 2008.

M. Benedikt and C. Koch, XPath leashed, ACM Computing Surveys, vol.41, issue.1, 2008.
DOI : 10.1145/1456650.1456653

B. Mikoo and S. Lasota, An extension of data automata that captures XPath, Annual IEEE Symposium on Logic in Computer Science (LICS, 2010.

[. Baelde, S. Lunel, and S. Schmitz, A Sequent Calculus for a Modal Logic on Finite Data Trees, Leibniz International Proceedings in Informatics (LIPIcs). Leibniz- Zentrum für Informatik, pp.1-32, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01191172

A. Mikoo-laj-boja´nczykboja´nczyk, T. Muscholl, L. Schwentick, and . Segoufin, Twovariable logic on data trees and XML reasoning, Journal of the ACM, vol.563, pp.1-48, 2009.

C. Mikoo-laj-boja´nczykboja´nczyk, A. David, T. Muscholl, L. Schwentick, and . Segoufin, Two-variable logic on data words, In: ACM Transactions on Computational Logic, 2010.

B. Mikoo and . Parys, XPath evaluation in linear time, Journal of the ACM, vol.584, p.17, 2011.

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

C. David, A. Gheerbrant, L. Libkin, and W. Martens, Containment of pattern-based queries over data trees, Proceedings of the 16th International Conference on Database Theory, ICDT '13, pp.201-212, 2013.
DOI : 10.1145/2448496.2448521
URL : https://hal.archives-ouvertes.fr/hal-00788621

S. Demri, D. Deepak, R. Souza, and . Gascon, A Decidable Temporal Logic of Repeating Values, Symposium on Logical Foundations of Computer Science (LFCS)
DOI : 10.1007/978-3-540-72734-7_13

S. Demri, D. Figueira, and M. Praveen, Reasoning about Data Repetitions with Counter Systems, In: Logical Methods in Computer ScienceLMCS), vol.1233, pp.10-2168, 2016.
DOI : 10.1109/lics.2013.8
URL : http://arxiv.org/pdf/1604.02887

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

S. Demri, R. Lazi´clazi´c, and D. Nowak, On the Freeze Quantifier in Constraint LTL: Decidability and Complexity, International Symposium on Temporal Representation and Reasoning, 2005.

C. David, L. Libkin, and T. Tan, Efficient reasoning about data trees via integer linear programming, In: ACM Transactions on Database Systems (TODS), vol.373, 2012.
DOI : 10.1145/1938551.1938558
URL : https://hal.archives-ouvertes.fr/hal-00720672

A. Deutsch and V. Tannen, Containment and Integrity Constraints for XPath

W. Fan, M. N. Chee-yong-chan, and . Garofalakis, Secure XML querying with security views, Proceedings of the 2004 ACM SIGMOD international conference on Management of data , SIGMOD '04, pp.587-598, 2004.
DOI : 10.1145/1007568.1007634
URL : http://www.lfcs.inf.ed.ac.uk/research/database/publications/sigmod04_secure.pdf

[. Figueira, S. Figueira, and C. Areces, Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization, Journal of Artificial Intelligence Research (JAIR), vol.53, pp.271-314, 2015.

D. Figueira, R. Lazic, J. Leroux, F. Mazowiecki, and G. Sutre, Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One, International Colloquium on Automata, Languages and Programming (ICALP) Leibniz International Proceedings in Informatics (LIPIcs). Leibniz- Zentrum für Informatik, pp.1-119, 2017.

D. Figueira, Forward-XPath and extended register automata on data-trees, Proceedings of the 13th International Conference on Database Theory, ICDT '10, 2010.
DOI : 10.1145/1804669.1804699
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fig-icdt10.pdf

D. Figueira, A Decidable Two-Way Logic on Data Words, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.365-374, 2011.
DOI : 10.1109/LICS.2011.18
URL : http://homepages.inf.ed.ac.uk/dfigueir/etc/lics11.pdf

D. Figueira, Alternating Register Automata on Finite Data Words and Trees, In: Logical Methods in Computer Science (LMCS), vol.81, issue.1, pp.10-2168, 2012.
DOI : 10.2168/lmcs-8(1:22)2012
URL : https://lmcs.episciences.org/907/pdf

D. Figueira, Decidability of Downward XPath, ACM Transactions on Computational Logic, vol.13, issue.4, 2012.
DOI : 10.1145/2362355.2362362
URL : http://tocl.acm.org/accepted/449figueira-with-app.pdf

D. Figueira, On XPath with transitive axes and data tests, Proceedings of the 32nd symposium on Principles of database systems, PODS '13, pp.249-260, 2013.
DOI : 10.1145/2463664.2463675

D. Figueira and L. Libkin, Pattern logics and auxiliary relations, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14
DOI : 10.1145/2603088.2603136
URL : http://homepages.inf.ed.ac.uk/libkin/papers/lics14.pdf

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere!, Theoretical Computer Science, vol.256, issue.1-2, pp.1-2, 2001.
DOI : 10.1016/S0304-3975(00)00102-X
URL : https://doi.org/10.1016/s0304-3975(00)00102-x

D. Figueira and L. Segoufin, Future-Looking Logics on Data Words and Trees, International Symposium on Mathematical Foundations of Computer Science (MFCS)
DOI : 10.1016/S0020-0190(01)00337-4
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-mfcs09.pdf

D. Figueira and L. Segoufin, Bottom-up automata on data trees and Vertical XPath, In: Logical Methods in Computer ScienceLMCS), vol.134, issue.4, pp.10-23638, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00573596

F. Geerts and W. Fan, Satisfiability of XPath Queries with Sibling Axes, International Symposium on Database Programming Languages (DBPL). Lecture Notes in Computer Science, vol.3774, pp.122-137, 2005.
DOI : 10.1007/11601524_8

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing XPath queries, In: ACM Transactions on Database Systems (TODS), vol.302, pp.444-491, 2005.
DOI : 10.1145/1071610.1071614

S. Göller, C. Haase, R. Lazi´clazi´c, and P. Totzke, A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One, International Colloquium on Automata, Languages and Programming (ICALP) Leibniz International Proceedings in Informatics (LIPIcs). Leibniz-Zentrum für Informatik, pp.1-105, 2016.

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternation-free modal mu-calculus for data trees, Annual IEEE Symposium on Logic in Computer Science (LICS), pp.131-140, 2007.

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternating automata on data trees and XPath satisfiability, In: ACM Transactions on Computational Logic, vol.123, 2011.

M. Kaminski and N. Francez, Finite-Memory Automata, In: Theoretical Computer Science, vol.1342, issue.94, pp.329-363, 1994.
DOI : 10.1109/fscs.1990.89590

A. Kara, T. Schwentick, and T. Zeume, Temporal Logics on Words with Multiple Data Values, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), 2010.

M. Kaminski and T. Tan, Tree Automata over Infinite Alphabets, Pillars of Computer Science. Lecture Notes in Computer Science, vol.4800, pp.386-423, 2008.
DOI : 10.1007/978-3-540-78127-1_21

]. M. Min61 and . Minsky, Recursive unsolvability of Post's problem of 'tag' and other topics in the theory of Turing Machines, Annals of Mathematics, vol.74, pp.437-455, 1961.

W. Martens and F. Neven, Frontiers of tractability for typechecking simple XML transformations, In: J. Comput. Syst. Sci, vol.733, pp.362-390, 2007.

F. Neven and T. Schwentick, On the complexity of XPath containment in the presence of disjunction, DTDs, and variables, Logical Methods in Computer Science, vol.2, issue.3, pp.10-2168, 2006.
DOI : 10.2168/LMCS-2(3:1)2006

F. Neven, T. Schwentick, and V. Vianu, Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic, vol.5, issue.3, pp.403-435, 2004.
DOI : 10.1145/1013560.1013562

P. Schnoebelen, Verifying lossy channel systems has nonprimitive recursive complexity, Information Processing Letters, vol.83, issue.5, pp.251-26100337, 2002.
DOI : 10.1016/S0020-0190(01)00337-4
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-IPL2002.pdf

P. Schnoebelen, Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets, International Symposium on Mathematical Foundations of Computer Science (MFCS, pp.616-628, 2010.
DOI : 10.1007/978-3-642-15155-2_54
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-mfcs10.pdf

S. Schmitz, Complexity Hierarchies beyond Elementary, ACM Transactions on Computation Theory, vol.8, issue.1, pp.1-3, 2016.
DOI : 10.1006/jsco.1994.1059
URL : https://hal.archives-ouvertes.fr/hal-01267354

[. Figueira, Logics of repeating values on data trees and branching counter systems, International Conference on Foundations of Software Science and Computational Structures (FOSSACS). Lecture Notes in Computer Science, 2017.

[. Tan, An Automata Model for Trees with Ordered Data Values, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.586-595, 2012.
DOI : 10.1109/LICS.2012.69