R. Alur, P. Cern´ycern´y, and S. Weinstein, Algorithmic analysis of array-accessing programs

H. Björklund and T. Schwentick, On notions of regularity for data languages, Theoretical Computer Science, vol.411, issue.4-5, pp.702-715, 2010.
DOI : 10.1016/j.tcs.2009.10.009

M. Boja´nczykboja´nczyk and S. Lasota, An extension of data automata that captures XPath, Symp. on Logic in Computer Science (LICS'10), pp.243-252, 2010.

M. Boja´nczykboja´nczyk, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data trees and XML reasoning, Journal of the ACM, vol.5613, issue.3, pp.1-1348, 2009.

M. Boja´nczykboja´nczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data words, ACM Trans. Comput. Log, vol.12, issue.4, p.27, 2011.

B. Bollig, A. Cyriac, P. Gastin, K. Narayan, and . Kumar, Model Checking Languages of Data Words, Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS'12), pp.391-405, 2012.
DOI : 10.1007/978-3-642-28729-9_26
URL : https://hal.archives-ouvertes.fr/hal-00658333

P. Bouyer, A logical characterization of data languages, Information Processing Letters, vol.84, issue.2, pp.75-85, 2002.
DOI : 10.1016/S0020-0190(02)00229-6

S. Demri and R. Lazi´clazi´c, LTL with the freeze quantifier and register automata, ACM Transactions on Computational Logic, vol.10, issue.3, 2009.

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

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

D. Figueira and L. Segoufin, Bottom-up automata on data trees and vertical XPath, Theoretical Aspects of Computer Science (STACS'11), 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573596

M. Jurdzinski and R. Lazic, Alternating automata on data trees and XPath satisfiability, ACM Transactions on Computational Logic, vol.12, issue.3, p.19, 2011.
DOI : 10.1145/1929954.1929956

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

S. Schmitz, On the computational complexity of dominance links in grammatical formalisms, Annual Meeting of the Association for Computational Linguistics (ACL'10), pp.514-524, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00482396