C. Areces, P. Blackburn, and M. Marx, Abstract, The Journal of Symbolic Logic, vol.XLI, issue.03, pp.977-1010, 2001.
DOI : 10.1093/jigpal/8.5.653

S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.
DOI : 10.1016/0196-6774(91)90006-K

I. Balaban, A. Pnueli, and L. D. Zuck, Shape Analysis by Predicate Abstraction, VMCAI, pp.164-180, 2005.
DOI : 10.1007/978-3-540-30579-8_12

M. Benedikt, T. Reps, and M. Sagiv, A Decidable Logic for Describing Linked Data Structures, European Symp. On Programming, pp.2-19, 1999.
DOI : 10.1007/3-540-49099-X_2

J. Berdine, C. Calcagno, and P. O. Hearn, A Decidable Fragment of Separation Logic, FSTTCS'04, 2004.
DOI : 10.1007/978-3-540-30538-5_9

P. A. Bonatti, Towards Service Description Logics, JELIA, pp.74-85, 2002.
DOI : 10.1007/3-540-45757-7_7

P. A. Bonatti and A. Peron, On the undecidability of logics with converse, nominals, recursion and counting, Artificial Intelligence, vol.158, issue.1, pp.75-96, 2004.
DOI : 10.1016/j.artint.2004.04.012

A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar, Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking, Proc. of TACAS '05, 2005.
DOI : 10.1007/978-3-540-31980-1_2
URL : https://hal.archives-ouvertes.fr/hal-00147978

M. Bozga and R. Iosif, Quantitative Verification of Programs with Lists, VISSAS intern. workshop, 2005.

M. Bozga, R. Iosif, and Y. Lakhnech, On Logics of Aliasing, Static Analysis Symp, pp.344-360, 2004.
DOI : 10.1007/978-3-540-27864-1_25
URL : https://hal.archives-ouvertes.fr/hal-00369338

L. Burdy, Y. Cheon, D. Cok, M. Ernst, J. Kiniry et al., An overview of JML tools and applications, International Journal on Software Tools for Technology Transfer, vol.box, issue.3, pp.212-232, 2005.
DOI : 10.1007/s10009-004-0167-4

C. Calcagno, P. Gardner, and M. Hague, From Separation Logic to First-Order Logic, FOSSACS'05, 2005.
DOI : 10.1007/978-3-540-31982-5_25

C. Calcagno, H. Yang, and P. O. Hearn, Computability and Complexity Results for a Spatial Assertion Language for Data Structures, FSTTCS'01, 2001.
DOI : 10.1007/3-540-45294-X_10

D. Calvanese, G. D. Giacomo, and M. Lenzerini, Reasoning in expressive description logics with fixpoints based on automata on infinite trees, IJCAI, pp.84-89, 1999.

B. Courcelle, The monadic second-order logic of graphs, II: Infinite graphs of bounded width, Mathematical Systems Theory, vol.70, issue.1, pp.187-221, 1989.
DOI : 10.1007/BF02088013

F. Baader, The Description Logic Handbook: Theory, Implementation, and Applications, 2003.
DOI : 10.1017/CBO9780511711787

T. Genet and V. Tong, Reachability Analysis of Term Rewriting Systems with Timbuk, LPAR, pp.695-706, 2001.
DOI : 10.1007/3-540-45653-8_48
URL : https://hal.archives-ouvertes.fr/inria-00072321

L. Georgieva and P. Maier, Description logics for shape analysis, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05), pp.321-331, 2005.
DOI : 10.1109/SEFM.2005.16

E. Grädel, M. Otto, and E. Rosen, Undecidability results on two-variable logics, Archive of Math. Logic, vol.38, pp.313-354, 1999.

E. Grädel and I. Walukiewicz, Guarded fixed point logic, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999.
DOI : 10.1109/LICS.1999.782585

E. Graedel, P. Kolaitis, and M. Vardi, On the decision problem for two variable logic, Bulletin of Symbolic Logic, 1997.

L. Hendren, Parallelizing programs with recursive data structures, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.1, 1990.
DOI : 10.1109/71.80123

L. Hendren, J. Hummel, and A. Nicolau, Abstractions for recursive pointer data structures: Improving the analysis and the transformation of imperative programs, SIGPLAN Conf. on Prog. Lang. Design and Impl, pp.249-260, 1992.

J. G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige et al., Mona: Monadic second-order logic in practice, TACAS, 1995.

C. A. Hoare, Recursive data structures, International Journal of Computer & Information Sciences, vol.12, issue.1, pp.105-132, 1975.
DOI : 10.1007/BF00976239

N. Immerman, Languages that Capture Complexity Classes, SIAM Journal on Computing, vol.16, issue.4, pp.760-778, 1987.
DOI : 10.1137/0216051

N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh, The boundery between decidability and undecidability of transitive closure logics, CSL, 2004.

N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh, Verification via Structure Simulation, CAV, 2004.
DOI : 10.1007/978-3-540-27813-9_22

S. S. Ishtiaq and P. W. O-'hearn, Bi as an assertion language for mutable data structures, POPL, pp.14-26, 2001.

N. Klarlund and M. I. Schwartzbach, Graph Types, POPL'93, 1993.

V. Kuncak and M. Rinard, Generalized Records and Spatial Conjunction in Role Logic, Static Analysis Symp, 2004.
DOI : 10.1007/978-3-540-27864-1_26

S. K. Lahiri and S. Qadeer, Verifying properties of well-founded linked lists, Symp. on Princ. of Prog. Lang, 2006.

T. Lev-ami and M. Sagiv, TVLA: A System for Implementing Static Analyses, Static Analysis Symp, pp.280-301, 2000.
DOI : 10.1007/978-3-540-45099-3_15

A. R. Meyer, Weak monadic second-order theory of successor is not elementary recursive, Logic Colloquium (Proc. Symposium on Logic, pp.132-154, 1972.

A. Møller and M. I. Schwartzbach, The pointer assertion logic engine, SIGPLAN Conf. on Prog. Lang. Design and Impl, pp.221-231, 2001.

M. Mortimer, On languages with two variables, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, pp.135-140, 1975.
DOI : 10.1002/malq.19750210118

F. Nielson, H. R. Nielson, and H. Seidl, Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi, SAS, pp.20-35, 2002.
DOI : 10.1007/3-540-45789-5_5

M. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969.

T. Reps, M. Sagiv, and R. Wilhelm, Static program analysis via 3-valued logic, CAV, pp.15-30, 2004.

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

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

M. Sagiv, T. Reps, and R. Wilhelm, Solving shape-analysis problems in languages with destructive updating, ACM Transactions on Programming Languages and Systems, vol.20, issue.1, pp.1-50, 1998.
DOI : 10.1145/271510.271517

M. Sagiv, T. Reps, and R. Wilhelm, Parametric shape analysis via 3-valued logic, ACM Transactions on Programming Languages and Systems, 2002.

U. Sattler and M. Y. Vardi, The hybrid -calculus, IJCAR, pp.76-91, 2001.

D. Seese, Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees, Tree Automata and Languages, pp.83-114, 1992.

G. Yorsh, M. Sagiv, A. Rabinovich, A. Bouajjani, and A. Meyer, Verification framework based on the logic of reachable patterns, 2005.