A. Arnold and D. Wink, Rudiments of µ-Calculus, 2001.

I. Boneva and J. Talbot, On Complexity of Model-Checking for the TQL Logic, 3rd IFIP Int. Conf. on Theoretical Computer Science (TCS2004), pp.381-394, 2004.
DOI : 10.1007/1-4020-8141-3_30

I. Boneva and J. Talbot, Automata and Logics for Unranked and Unordered Trees, 16th Int. Conf. on Rewriting Techniques and Applications (RTA), pp.500-515, 2005.
DOI : 10.1007/978-3-540-32033-3_36
URL : https://hal.archives-ouvertes.fr/inria-00536694

L. Caires and L. Cardelli, A Spatial Logic for Concurrency (part I) Information and Computation, pp.194-235, 2003.
DOI : 10.1007/3-540-45694-5_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.1530

C. Calcagno, L. Cardelli, and A. D. Gordon, Deciding Validity in Spatial Logic for Trees, ACM SIGPLAN int. workshop on Types in languages design and implementation, pp.62-73, 2003.

L. Cardelli, P. Gardner, and G. Ghelli, A Spatial Logic for Querying Graphs, 29th Int. Colloquium on Automata, Languages and Programming (ICALP), pp.597-610, 2002.
DOI : 10.1007/3-540-45465-9_51
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.9299

L. Cardelli and G. Ghelli, A Query Language Based on the Ambient Logic, European Symp. on Programming, pp.1-22, 2001.
DOI : 10.1007/3-540-45309-1_1

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

L. Cardelli and A. D. Gordon, Anytime, anywhere, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, pp.365-377, 2000.
DOI : 10.1145/325694.325742

L. Cardelli and A. D. Gordon, Mobile ambients, Theoretical Computer Science, vol.240, issue.1, pp.177-213, 2000.
DOI : 10.1016/S0304-3975(99)00231-5

]. W. Charatonik, S. Dal-zilio, A. D. Gordon, S. Mukhopadhyayd, and J. Talbot, Model checking mobile ambients, Theoretical Computer Science, vol.308, issue.1-3, pp.277-331, 2003.
DOI : 10.1016/S0304-3975(02)00832-0

S. , D. Zilio, D. Lugiez, and . Schema, Tree Logic and Sheaves Automata, Rewriting Techniques and Applications , 14th Int. Conf. (RTA), pp.246-263, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00109288

S. Dal-zilio, D. Lugiez, and C. Meyssonnier, A Logic You Can Count on, 31st ACM SIGPLAN-SIGACT symp. on Principles of programming languages, pp.135-146, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071562

A. Dawar, P. Gardner, and G. Ghelli, Expressiveness and complexity of graph logic, Information and Computation, vol.205, issue.3, 2004.
DOI : 10.1016/j.ic.2006.10.006

J. Goubault-larrecq and K. N. Verma, Alternating Twoway AC-Tree Automata, Research Report, 2002.

D. Lugiez, Counting and Equality Constraints for Multitree Automata, Foundations of Software Science and Computational Structures: 6th Int. Conf., FOSSACS, pp.328-342, 2003.
DOI : 10.1007/3-540-36576-1_21

M. L. Minsky, Recursive insolvability of Post's problem of " tag " ard other topics in the theory of turing machines, Annals of Mathematics, Second Series, pp.437-455, 1961.

P. W. O-'hearn, J. C. Reynolds, and H. Yang, Local Reasoning about Programs that Alter Data Structures, Computer Science Logic (CSL), pp.1-19, 2001.

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

H. Seidl, T. Schwentick, and A. Muscholl, Numerical document queries, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.155-166, 2003.
DOI : 10.1145/773153.773169