P. Aziz-abdulla, M. F. Atig, Y. Chen, L. Holík, A. Rezine et al., Norn: An SMT Solver for String Constraints, CAV '15, pp.462-469978, 2015.
DOI : 10.1007/978-3-319-21690-4_29

S. Abriola, D. Figueira, and S. Figueira, Logics of Repeating Values on Data Trees and Branching Counter Systems, FoSSaCS '17, pp.196-212, 2017.
DOI : 10.1007/11874683_3

URL : https://hal.archives-ouvertes.fr/hal-01686713

L. Afanasiev, P. Blackburn, I. Dimitriou, B. Gaiffe, E. Goris et al., PDL for ordered trees, Journal of Applied Non-Classical Logics, vol.32, issue.3, pp.115-135115, 2005.
DOI : 10.1007/3-540-36387-4_12

URL : https://hal.archives-ouvertes.fr/inria-00001206

D. Arroyuelo, F. Claude, S. Maneth, V. Mäkinen, G. Navarro et al., Fast in-memory XPath search using compressed indexes, Software: Practice and Experience, vol.58, issue.4, pp.399-434, 2015.
DOI : 10.1145/1989727.1989731

URL : https://hal.archives-ouvertes.fr/hal-00947659

D. Baelde, S. Lunel, and S. Schmitz, A sequent calculus for a modal logic on finite data trees LZI, Article 32, CSL 2016 (Leibniz Int. Proc. Inf.), 2016.

B. Bednarczyk, W. Charatonik, and E. Kieronski, Extending two-variable logic on trees, CSL '17 (Leibniz Int. Proc. Inf.) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, Article 11, 2017.

S. Benaim, M. Benedikt, W. Charatonik, E. Kiero?ski, R. Lenhardt et al., Complexity of two-variable logic on finite trees, ACM Trans. Comput. Logic, vol.17, issue.32, 2016.

M. Benedikt and J. Cheney, Destabilizers and independence of XML updates, Proc. VLDB Endow, pp.906-917, 2010.
DOI : 10.14778/1920841.1920956

M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, J. ACM, vol.55, issue.8, 2008.

M. Benedikt and C. Koch, XPath leashed. ACM Comput. Surv, vol.41, issue.3, 2009.

P. Blackburn, W. Meyer-viol, and M. De-rijke, A proof system for finite trees, CSL '95, pp.86-105, 1996.
DOI : 10.1007/3-540-61377-3_33

M. Boja?czyk, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data trees and XML reasoning, J. ACM, vol.56, issue.13, 2009.

M. Boja?czyk and P. Parys, XPath evaluation in linear time, J. ACM Article, vol.58, issue.17, 2011.

J. Cheney, Satisfiability algorithms for conjunctive queries over trees, Proceedings of the 14th International Conference on Database Theory, ICDT '11, pp.150-161, 2011.
DOI : 10.1145/1938551.1938572

W. Czerwinski, C. David, F. Murlak, and P. Parys, Reasoning about integrity constraints for tree-structured data, Theory of Computing Systems, vol.51, issue.1, pp.941-976, 2018.
DOI : 10.2168/LMCS-2(3:1)2006

URL : https://hal.archives-ouvertes.fr/hal-01799440

, RELAX NG Compact Syntax. OASIS Committee Specification, 2002.

J. Melton, 2014. XQueryX 3.0. W3C Recommendation

M. Kay, 2014. XPath and XQuery Functions and Operators 3.0. W3C Recommendation
URL : https://hal.archives-ouvertes.fr/hal-01587377

M. Kay, 2017. XSL Transformations (XSLT) Version 3.0. W3C Recommendation

D. Figueira, Alternating register automata on finite words and trees, Logical Methods in Computer Science, vol.95, issue.2, pp.10-2168, 2012.
DOI : 10.1007/BF01967649

URL : https://hal.archives-ouvertes.fr/hal-01799710

D. Figueira, Decidability of Downward XPath, ACM Transactions on Computational Logic, vol.13, issue.4, 2012.
DOI : 10.1145/2362355.2362362

URL : https://hal.archives-ouvertes.fr/hal-01799714

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

URL : https://hal.archives-ouvertes.fr/hal-01795148

D. Figueira, Automata column: Satisfiability of XPath on data trees, SIGLOG News, vol.5, issue.2, pp.4-16, 2018.

D. Figueira and L. Segoufin, Future-Looking Logics on Data Words and Trees, MFCS '09, pp.331-343978, 2009.
DOI : 10.1016/S0020-0190(01)00337-4

URL : https://hal.archives-ouvertes.fr/hal-01806188

D. Figueira and L. Segoufin, Bottom-up automata on data trees and vertical XPath, Logic. Meth. in Comput. Sci, vol.13, issue.5, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01631219

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

P. Genevès, N. Layaïda, A. Schmitt, and N. Gesbert, Efficiently Deciding ??-Calculus with Converse over Finite Trees, ACM Transactions on Computational Logic, vol.16, issue.2, 2015.
DOI : 10.1145/1375581.1375624

P. Genevès and J. Vion-dury, Logic-based XPath optimization, pp.211-219, 2004.

G. Gottlob and C. Koch, Monadic queries over tree-structured data, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.189-202, 2002.
DOI : 10.1109/LICS.2002.1029828

G. Gottlob, C. Koch, R. Pichler, and L. Segoufin, The complexity of XPath query evaluation and XML typing, Journal of the ACM, vol.52, issue.2, pp.284-335, 2005.
DOI : 10.1145/1059513.1059520

J. Groppe and S. Groppe, A Prototype of a Schema-Based XPath Satisfiability Tester, DEXA '06, pp.93-103, 2006.
DOI : 10.1007/11827405_10

, Satisfiability of XPath expressions, DBPL 2003 (Lect. Notes in Comput. Sci.), pp.21-36978, 2004.

F. Jacquemard, L. Segoufin, and J. Dimino, FO 2 (<, +1, ?) on data trees, data tree automata and branching vector addition systems, Logic. Meth. in Comput. Sci, vol.122, issue.310, pp.2168-123, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00769249

M. Jurdzi?ski and R. Lazi?, Alternating automata on data trees and XPath satisfiability, ACM Transactions on Computational Logic, vol.12, issue.3, 2011.
DOI : 10.1145/1929954.1929956

A. Kiezun, V. Ganesh, S. Artzi, P. J. Guo, P. Hooimeijer et al., HAMPI, ACM Transactions on Software Engineering and Methodology, vol.21, issue.4, 2013.
DOI : 10.1145/2377656.2377662

R. Lazi? and S. Schmitz, Non-elementary complexities for branching VASS, MELL, and extensions, 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, 2015.
DOI : 10.1145/2603088.2603129

T. Liang, A. Reynolds, N. Tsiskaridze, C. Tinelli, C. Barrett et al., An efficient SMT solver for string constraints, Formal Methods in System Design, vol.51, issue.3, pp.206-234, 2016.
DOI : 10.1145/2491411.2491456

M. Marx, XPath and Modal Logics of Finite DAG???s, TABLEAUX '03, pp.150-164, 2003.
DOI : 10.1007/978-3-540-45206-5_13

M. Marx, Conditional XPath, ACM Transactions on Database Systems, vol.30, issue.4, pp.929-959, 2005.
DOI : 10.1145/1114244.1114247

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, 2006.
DOI : 10.2168/LMCS-2(3:1)2006

, 2014. XML Path Language (XPath) 3.0. W3C Recommendation

, 2014. XQuery 3.0: An XML Query Language. W3C Recommendation

T. Schwentick, XPath query containment. SIGMOD Rec, pp.101-109, 2004.
DOI : 10.1145/974121.974140

URL : http://www.sigmod.org/publications/sigmod-record/0403/C.LLibkin.pdf

C. Balder-ten, The expressivity of XPath with transitive closure, PODS '06, pp.328-337, 2006.

C. Balder-ten and C. Lutz, The complexity of query containment in expressive fragments of XPath 2.0, J. ACM 56, vol.6, issue.31, 2009.

M. Trinh, D. Chu, and J. Jaffar, S3, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.1232-1243, 2014.
DOI : 10.1145/1064978.1065036

, 2014. XQuery and XPath Data Model 3.0. W3C Recommendation

Y. Zheng, X. Zhang, and V. Ganesh, Z3-str: a z3-based string solver for web application analysis, Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2013, pp.114-124, 2013.
DOI : 10.1145/2491411.2491456