V. Benzaken, G. Castagna, and A. Frisch, CDuce: an XML-centric general-purpose language, 8th ACM International Conf. on Functional Programming, pp.51-63, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00152619

B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, 9th Annual Symposium on Theoretical Aspects of Computer Science, pp.161-171, 1992.
DOI : 10.1007/3-540-55210-3_181

M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data trees and xml reasoning, ACM 25th Symp. on Principles of database systems, pp.10-19, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00151833

I. Boneva, J. Talbot, and S. Tison, Expressiveness of a Spatial Logic for Trees, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.280-289, 2005.
DOI : 10.1109/LICS.2005.17

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

A. Brüggemann-klein, M. Murata, and D. Wood, Regular tree languages over non-ranked alphabets. unpublished manuscript, 1998.

L. Cardelli, P. Gardner, and G. Ghelli, A Spatial Logic for Querying Graphs, 29th International Colloquium on Automata, Languages and Programming, pp.597-610, 2002.
DOI : 10.1007/3-540-45465-9_51

L. Cardelli and G. Ghelli, TQL: a query language for semistructured data based on the ambient logic, Mathematical Structures in Computer Science, vol.14, issue.3, pp.285-327, 2004.
DOI : 10.1017/S0960129504004141

W. Charatonik and J. Talbot, The Decidability of Model Checking Mobile Ambients, 15th Annual Conference of the European Association for Computer Science Logic, pp.339-354, 2001.
DOI : 10.1007/3-540-44802-0_24

H. Comon and V. Cortier, Tree automata with one memory set constraints and cryptographic protocols, Theoretical Computer Science, vol.331, issue.1, pp.143-214, 2005.
DOI : 10.1016/j.tcs.2004.09.036

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

M. Dauchet, A. Caron, and J. Coquidé, Reduction properties and automata with constraints, pp.215-233, 1995.

A. Dawar, P. Gardner, and G. Ghelli, Expressiveness and complexity of graph logic, Information and Computation, number 205, pp.263-310, 2007.
DOI : 10.1016/j.ic.2006.10.006

H. Hosoya and B. C. Pierce, XDuce, ACM Transactions on Internet Technology, vol.3, issue.2, pp.117-148, 2003.
DOI : 10.1145/767193.767195

F. Jacquemard, M. Rusinowitch, and L. Vigneron, Tree automata with equality constraints modulo equational theories, 2006.
DOI : 10.1007/11814771_45

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

W. Karianto and C. Löding, Unranked Tree Automata with Sibling Equalities and Disequalities, 34th International Colloquium on Automata, Languages and Programming, 2007.
DOI : 10.1007/978-3-540-73420-8_75

J. Mongy, Transformation de noyaux reconnaissables d'arbres. Forêts RATEG, 1981.

M. Murata, Hedge automata: A formal model for xml schemata, 1999.

F. Neven, T. Schwentick, and V. Vianu, Towards Regular Languages over Infinite Alphabets, MFCS, pp.560-572, 2001.
DOI : 10.1007/3-540-44683-4_49

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. C. Reynolds, Separation logic: a logic for shared mutable data structures, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.55-74, 2002.
DOI : 10.1109/LICS.2002.1029817