V. Bárány, D. Miko-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 (FSTTCS'12), Leibniz International Proceedings in Informatics (LIPIcs)

M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, Journal of the ACM, vol.55, issue.2, pp.1-79, 2008.
DOI : 10.1145/1346330.1346333
URL : https://uhdspace.uhasselt.be/dspace/bitstream/1942/956/1/xpath.pdf

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

A. Miko-laj-boja´nczykboja´nczyk, T. Muscholl, L. Schwentick, and . Segoufin, Two-variable logic on data trees and XML reasoning, Journal of the ACM, vol.56, issue.3, pp.1-48, 2009.
DOI : 10.1145/1516512.1516515

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

C. David, L. Libkin, and T. Tan, Efficient reasoning about data trees via integer linear programming, ACM Transactions on Database Systems, vol.37, issue.3, p.19, 2012.
DOI : 10.1145/1938551.1938558
URL : https://hal.archives-ouvertes.fr/hal-00720672

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

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, pp.197-206, 2009.
DOI : 10.1145/1559795.1559827
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fig-pods09.pdf

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, Reasoning on Words and Trees with Data, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00718605

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, Logical Methods in Computer Science, vol.8, issue.1, p.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, p.2012
DOI : 10.1145/2362355.2362362
URL : http://tocl.acm.org/accepted/449figueira-with-app.pdf

D. Figueira and L. Segoufin, Future-Looking Logics on Data Words and Trees, Int. Symp. on Mathematical Foundations of Comp. Sci. (MFCS'09), pp.331-343, 2009.
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, International Symposium on Theoretical Aspects of Computer Science (STACS'11), Leibniz International Proceedings in Informatics (LIPIcs). Leibniz-Zentrum für Informatik, 2011.
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'05), pp.122-137, 2005.
DOI : 10.1007/11601524_8
URL : http://homepages.inf.ed.ac.uk/fgeerts/pdf/trondheim05.pdf

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing XPath queries, ACM Transactions on Database Systems, vol.30, issue.2, pp.444-491, 2005.
DOI : 10.1145/1071610.1071614

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternating automata on data trees and xpath satisfiability, ACM Trans. Comput. Log, vol.12, issue.3, p.19, 2011.

M. Kaminski and N. Francez, Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1016/0304-3975(94)90242-9

M. Kaminski and T. Tan, Tree Automata over Infinite Alphabets, In Pillars of Computer Science Lecture Notes in Computer Science, vol.4800, pp.386-423, 2008.
DOI : 10.1007/978-3-540-78127-1_21
URL : http://homepages.inf.ed.ac.uk/ttan/papers/2008-pillar-reg-ta.pdf

W. Martens and F. Neven, Frontiers of tractability for typechecking simple XML transformations, Journal of Computer and System Sciences, vol.73, issue.3, pp.362-390, 2007.
DOI : 10.1016/j.jcss.2006.10.005
URL : https://uhdspace.uhasselt.be/dspace/bitstream/1942/608/1/34%20P-03.pdf

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
URL : http://alpha.luc.ac.be/~fneven/papers/infinitetocl.ps

T. 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
URL : http://fox7.eu/wp-content/uploads/odta-lics12.pdf