O. Burkart, D. Caucal, F. Moller, and B. Steffen, Verification of infinite structures, Handbook of Process Algebra, pp.545-623, 2001.

S. Bardin, A. Finkel, and D. Nowak, Toward symbolic verification of programs handling pointers, 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS'04), 2004.

A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro et al., Programs with lists are counter automata, in: CAV'06, vol.4144, pp.517-531, 2006.

J. Reynolds, Separation logic: a logic for shared mutable data structures, LICS'02, pp.55-74, 2002.
DOI : 10.1109/lics.2002.1029817
URL : http://ttic.uchicago.edu/~dreyer/seplogic.pdf

J. Jensen, M. Jorgensen, N. Klarlund, and M. Schwartzbach, Automatic verification of pointer programs using monadic secondorder logic, PLDI'97, pp.226-236, 1997.

T. Lev-ami and M. Sagiv, TVLA: A system for implementing static analyses, SAS'00, pp.280-301, 2000.

M. Bozga, R. Iosif, and Y. Lakhnech, On logics of aliasing, SAS'04, vol.3148, pp.344-360, 2004.
DOI : 10.1007/978-3-540-27864-1_25
URL : https://hal.archives-ouvertes.fr/hal-00369338

A. Pnueli, The temporal logic of programs, FOCS'77, pp.46-57, 1977.

M. Vardi and P. Wolper, Reasoning about infinite computations, Information and Computation, vol.115, pp.1-37, 1994.
DOI : 10.1006/inco.1994.1092
URL : https://doi.org/10.1006/inco.1994.1092

O. Kupferman, M. Y. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, Journal of the Association for Computing Machinery, vol.47, issue.2, pp.312-360, 2000.
DOI : 10.1145/333979.333987

J. Berdine, C. Calcagno, and P. W. O'hearn, Symbolic execution with separation logic, APLAS'05, vol.3780, pp.52-68, 2005.
DOI : 10.1007/11575467_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.5578

J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. W. O'hearn et al., Shape analysis for composite data structures, CAV, vol.4590, pp.178-192, 2007.
DOI : 10.1007/978-3-540-73368-3_22
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-73368-3_22.pdf

A. Bouajjani, R. Echahed, and P. Habermehl, On the verification problem of nonregular properties for nonregular processes, LICS'95, pp.123-133, 1995.

H. Comon and V. Cortier, Flatness is not a weakness, CSL'00, vol.1862, pp.262-276, 2000.
DOI : 10.1007/3-540-44622-2_17

S. Demri and R. Gascon, The effects of bounding syntactic resources on Presburger LTL, Journal of Logic

D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev, Many-dimensional modal logics: theory and applications, 2003.

B. Bennett, F. Wolter, and M. Zakharyaschev, Multi-dimensional modal logic as a framework for spatio-temporal reasoning, Applied Intelligence, vol.17, issue.3, pp.239-251, 2002.

P. Balbiani and J. Condotta, Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning, FROCOS'02, vol.2309, pp.162-173, 2002.

S. Demri and D. Souza, An automata-theoretic approach to constraint LTL, Information and Computation, vol.205, issue.3, pp.380-415, 2007.
DOI : 10.1016/j.ic.2006.09.006
URL : https://doi.org/10.1016/j.ic.2006.09.006

A. Sistla and E. Clarke, The complexity of propositional linear temporal logic, Journal of the Association for Computing Machinery, vol.32, issue.3, pp.733-749, 1985.
DOI : 10.1145/800070.802189

C. Calcagno, H. Yang, and P. O'hearn, Computability and complexity results for a spatial assertion language for data structures, FST&TCS'01, vol.2245, pp.108-119, 2001.

E. Lozes, Expressivité des logiques spatiales, 2004.

C. Calcagno, P. Gardner, and M. Hague, From separation logic to first-order logic, FOSSACS'05, vol.3441, pp.395-409, 2005.
DOI : 10.1007/978-3-540-31982-5_25
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-31982-5_25.pdf

D. Galmiche and D. Mery, Characterizing provability in BI's pointer logic through resource graphs, LPAR'05, vol.3835, pp.459-473, 2005.
DOI : 10.1007/11591191_32

D. Galmiche and D. Méry, Tableaux and resource graphs for separation logic, Journal of Logic
URL : https://hal.archives-ouvertes.fr/hal-00580299

E. Yahav, T. Reps, M. Sagiv, and R. Wilhelm, Verifying temporal heap properties specified via evolution logic, ESOP'03, vol.2618, pp.204-226, 2003.
DOI : 10.1093/jigpal/jzl009

D. Distefano, J. Katoen, and A. Rensink, Who is pointing when to whom? on the automated verification of linked list structures, FST&TCS'04, vol.3328, pp.250-262, 2004.

R. Brochenin, S. Demri, and E. Lozes, Reasoning about sequences of memory states, LFCS'07, vol.4514, pp.100-114, 2007.
DOI : 10.1007/978-3-540-72734-7_8
URL : https://hal.archives-ouvertes.fr/hal-01905172

S. Ishtiaq and P. O'hearn, BI as an assertion language for mutable data structures, POPL'01, pp.14-26, 2001.
DOI : 10.1145/1988042.1988050
URL : http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/fox-19/member/jcr/www15819A3s2001/bi-assertion-lan.pdf

D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi, On the temporal analysis of fairness, 7th Annual ACM Symposium on Principles of Programming Languages, pp.163-173, 1980.

S. Bardin, A. Finkel, E. Lozes, and A. Sangnier, From pointer systems to counter systems using shape analysis, 5th International Workshop on Automated Verification of Infinite-State Systems (AVIS'06)

J. Berdine, C. Calcagno, and P. O'hearn, Smallfoot: Modular automatic assertion checking with separation logic, FMCO'05, vol.4111, pp.115-137, 2005.
DOI : 10.1007/11804192_6

A. Finkel, E. Lozes, and A. Sangnier, Towards model-checking programs with lists, Infinity in Logic and Computation, vol.5489, 2009.
DOI : 10.1007/978-3-642-03092-5_6

R. Brochenin, S. Demri, and E. Lozes, On the almighty wand, CSL'08, vol.5213, pp.322-337, 2008.
DOI : 10.1007/978-3-540-87531-4_24
URL : https://hal.archives-ouvertes.fr/hal-01905158

K. Bansal, R. Brochenin, and E. Lozes, Beyond shapes: Lists with ordered data, FOSSACS'09, vol.5504, pp.425-439, 2009.
DOI : 10.1007/978-3-642-00596-1_30
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-00596-1_30.pdf

R. Alur and T. Henzinger, A really temporal logic, Journal of the Association for Computing Machinery, vol.41, pp.181-204, 1994.
DOI : 10.1109/sfcs.1989.63473