]. W. Ahrendt, T. Baar, B. Beckert, M. Giese, E. Habermalz et al., Verification of object-oriented software: the Key approach, 2000.

R. Alur, . Th, and . Henzinger, A really temporal logic, Journal of the ACM, vol.41, issue.1, pp.181-204, 1994.
DOI : 10.1145/174644.174651

T. Antonopoulos and A. Dawar, Separating Graph Logic from MSO, FOSSACS'09, pp.63-77, 2009.
DOI : 10.1007/11874683_32

S. Arora and B. Barak, Computational complexity ? a modern approach, 2009.

P. Balbiani and J. F. Condotta, Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning, FROCOS'02, volume 2309 of LNAI, pp.162-173, 2002.
DOI : 10.1007/3-540-45988-X_13

K. Bansal, R. Brochenin, and E. Lozes, Beyond Shapes: Lists with Ordered Data, FOSSACS'09, pp.425-439, 2009.
DOI : 10.1007/978-3-540-69738-1_18

S. Bardin, A. Finkel, E. Lozes, and A. Sangnier, From pointer systems to counter systems using shape analysis, 2006.

S. Bardin, A. Finkel, and D. Nowak, Toward symbolic verification of programs handling pointers, 2004.

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.
DOI : 10.1023/A:1020083231504

J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. W. O-'hearn et al., Shape Analysis for Composite Data Structures, CAV'07, pp.178-192, 2007.
DOI : 10.1007/978-3-540-73368-3_22

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

J. Berdine, C. Calcagno, and P. O. Hearn, Smallfoot: Modular Automatic Assertion Checking with Separation Logic, FMCO'05, pp.115-137, 2005.
DOI : 10.1007/11804192_6

J. Berdine, C. Calcagno, and P. W. O-'hearn, Symbolic Execution with Separation Logic, APLAS'05, pp.52-68, 2005.
DOI : 10.1007/11575467_5

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

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software. In The essence of computation: complexity, analysis, transformation, LNCS, vol.2566, pp.85-108, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00528442

M. Boja´nczykboja´nczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David, Two-variable logic on words with data, LICS'06, pp.7-16, 2006.

E. Börger, E. Grädel, and Y. Gurevich, The classical decision problem, Perspectives in Mathematical Logic, 1997.
DOI : 10.1007/978-3-642-59207-2

A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro et al., Programs with lists are counter automata, CAV'06, pp.517-531, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01418868

A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, A Logic-Based Framework for Reasoning about Composite Data Structures, CONCUR'09, pp.178-195, 2009.
DOI : 10.1016/j.jlap.2006.12.001

A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, On inter-procedural analysis of programs with lists and data, PLDI'11, pp.578-589, 2011.

A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data, ATVA'12, pp.167-182, 2012.
DOI : 10.1007/978-3-642-33386-6_14

A. Bouajjani, R. Echahed, and P. Habermehl, On the verification problem of nonregular properties for nonregular processes, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp.123-133, 1995.
DOI : 10.1109/LICS.1995.523250

A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar, Verifying programs with dynamic 1-selector-linked structured in regular model-checking, TACAS'05, pp.13-29, 2005.

A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar, Abstract regular (tree) model checking, International Journal on Software Tools for Technology Transfer, vol.24, issue.3, pp.167-191, 2012.
DOI : 10.1007/s10009-011-0205-y

URL : https://hal.archives-ouvertes.fr/hal-00156828

M. Bozga, R. Iosif, and Y. Lakhnech, On Logics of Aliasing, SAS'04, pp.344-360, 2004.
DOI : 10.1007/978-3-540-27864-1_25

URL : https://hal.archives-ouvertes.fr/hal-00369338

M. Bozga, R. Iosif, and S. Perarnau, Quantitative separation logic and programs with lists, IJCAR'08, pp.34-49, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01418870

R. Brochenin, S. Demri, and E. Lozes, Reasoning about sequences of memory states, LFCS'07, pp.100-114, 2007.

R. Brochenin, S. Demri, and E. Lozes, On the almighty wand, CSL'08, pp.322-337, 2008.
DOI : 10.1016/j.ic.2011.12.003

R. Brochenin, S. Demri, and E. Lozes, Reasoning about sequences of memory states, Annals of Pure and Applied Logic, vol.161, issue.3, pp.305-323, 2009.
DOI : 10.1016/j.apal.2009.07.004

R. Brochenin, S. Demri, and E. Lozes, On the almighty wand, Information and Computation, vol.211, pp.106-137, 2012.
DOI : 10.1016/j.ic.2011.12.003

J. Brotherston and M. I. Kanovich, Undecidability of propositional separation logic and its neighbours, LICS'10, pp.130-139, 2010.

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Logic, Methodology , and Philosophy of Science, pp.1-11, 1960.
DOI : 10.1007/978-1-4613-8928-6_23

O. Burkart, D. Caucal, F. Moller, and B. Steffen, Verification on Infinite Structures, Handbook of Process Algebra, pp.545-623, 2001.
DOI : 10.1016/B978-044482830-9/50027-8

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

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

C. Calcagno, P. Gardner, and U. Zarfaty, Context logic as modal logic: completeness and parametric inexpressivity, POPL'07, pp.123-134, 2007.

C. Calcagno, H. Yang, and P. O. Hearn, Computability and complexity results for a spatial assertion language, APLAS'01, pp.289-300, 2001.

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

H. Comon and V. Cortier, Flatness Is Not a Weakness, CSL'00, pp.262-276, 2000.
DOI : 10.1007/3-540-44622-2_17

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

B. Cook, C. Haase, J. Ouaknine, M. Parkinson, and J. Worrell, Tractable Reasoning in a Fragment of Separation Logic, CONCUR'11, pp.235-249
DOI : 10.1007/3-540-45294-X_10

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, 2009.

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973

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

A. Dawar, P. Gardner, and G. Ghelli, Adjunct Elimination Through Games in Static Ambient Logic, FST&TCS'04, pp.211-223, 2004.
DOI : 10.1007/978-3-540-30538-5_18

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

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

S. Demri and R. Gascon, The Effects of Bounding Syntactic Resources on Presburger LTL, Journal of Logic and Computation, vol.19, issue.6, pp.1541-1575, 2009.
DOI : 10.1093/logcom/exp037

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

S. Demri, R. Lazi´clazi´c, and D. Nowak, On the freeze quantifier in constraint LTL: decidability and complexity, TIME'05, pp.113-121, 2005.

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

M. Dodds and D. Plump, From Separation Logic to Hyperedge Replacement and Back, ICGT'08, pp.484-486, 2008.
DOI : 10.1007/978-3-540-87405-8_40

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

K. Etessami, M. Vardi, and T. Wilke, First-Order Logic with Two Variables and Unary Temporal Logic, Information and Computation, vol.179, issue.2, pp.279-295, 2002.
DOI : 10.1006/inco.2001.2953

URL : http://doi.org/10.1006/inco.2001.2953

J. C. Filliâtre and C. Marché, The Why/Krakatoa/Caduceus Platform for Deductive Program Verification, CAV'07, pp.173-177, 2007.
DOI : 10.1007/978-3-540-73368-3_21

A. Finkel, E. Lozes, and A. Sangnier, Towards Model-Checking Programs with Lists, ILC'07, pp.56-86, 2009.
DOI : 10.1007/978-3-642-03092-5_6

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

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

D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi, On the temporal analysis of fairness, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '80, pp.163-173, 1980.
DOI : 10.1145/567446.567462

D. Galmiche and D. Méry, Characterizing Provability in BI???s Pointer Logic Through Resource Graphs, LPAR'05, 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 and Computation, vol.20, issue.1, pp.189-231, 2010.
DOI : 10.1093/logcom/exn066

URL : https://hal.archives-ouvertes.fr/hal-00580299

N. Gorogiannis, M. I. Kanovich, and P. W. O-'hearn, The Complexity of Abduction for Separated Heap Abstractions, SAS'11, pp.25-42, 2011.
DOI : 10.1016/j.jlap.2006.12.001

S. Gulwani, B. Mccloskey, and A. Tiwari, Lifting abstract interpreters to quantified logical domains, ACM SIGPLAN Notices, vol.43, issue.1, pp.235-246, 2008.
DOI : 10.1145/1328897.1328468

C. A. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969.
DOI : 10.1145/363235.363259

C. A. Hoare, A. Hussain, B. Möller, P. W. O-'hearn, R. L. Petersen et al., On Locality and the Exchange Law for Concurrent Processes, CONCUR'11, pp.250-264, 2011.
DOI : 10.1007/3-540-45931-6_28

G. J. Holzmann, Design and validation of computer protocols, 1991.

S. Ishtiaq and P. O. Hearn, BI as an assertion language for mutable data structures, POPL'01, pp.14-26, 2001.

D. Janin and I. Walukiewicz, On the expressive completeness of the propositional mucalculus with respect to monadic second order logic, CONCUR'96, pp.263-277, 1996.

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

J. Kamp, Tense logic and the theory of linear order, 1968.

J. P. Katoen, T. Noll, and S. Rieger, Verifying concurrent list-manipulating programs by LTL model-checking, 2007.

F. Klaedtke and H. Rueb, Monadic Second-Order Logics with Cardinalities, ICALP'03, pp.681-696, 2003.
DOI : 10.1007/3-540-45061-0_54

V. Kuncak and M. Rinard, On spatial conjunction as second-order logic, 2004.

D. Larchey-wendling and D. Galmiche, The Undecidability of Boolean BI through Phase Semantics, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.140-149, 2010.
DOI : 10.1109/LICS.2010.18

URL : https://hal.archives-ouvertes.fr/hal-00577919

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

A. Loginov, T. Reps, and M. Sagiv, Refinement-based verification for possibly-cyclic lists. In Program analysis and compilation, theory and practice, 2007.

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

E. Lozes, Separation logic preserves the expressive power of classical logic. Presented at SPACE'04, 2004.

E. Lozes, Elimination of spatial connectives in static spatial logics, Theoretical Computer Science, vol.330, issue.3, pp.475-499, 2005.
DOI : 10.1016/j.tcs.2004.10.006

P. Madhusudan, G. Parlato, and X. Qiu, Decidable logics combining heap structures and data, POPL'11, pp.611-622, 2011.
DOI : 10.1145/1926385.1926455

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

S. Magill, J. Berdine, E. Clarke, and B. Cook, Arithmetic Strengthening for Shape Analysis, SAS'07, pp.419-436, 2007.
DOI : 10.1007/978-3-540-74061-2_26

S. Mcpeak and G. C. Necula, Data Structure Specifications via Local Equality Axioms, CAV'05, pp.476-490, 2005.
DOI : 10.1007/11513988_47

H. H. Nguyen, C. David, S. Qin, and W. N. Chin, Automated Verification of Shape and Size Properties Via Separation Logic, VMCAI'07, pp.251-266, 2007.
DOI : 10.1007/978-3-540-69738-1_18

P. Odifreddi, Classical recursion theory. Studies in Logic, 1989.

P. W. O-'hearn and D. Pym, Abstract, Bulletin of Symbolic Logic, vol.two, issue.02, pp.215-244, 1999.
DOI : 10.1016/0304-3975(93)90181-R

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

D. Pym, The semantics and proof theory of the logic of bunched implications Applied Logic Series, 2002.

M. Rabin, Decidability of second-order theories and automata on infinite trees. Transactions of the, pp.1-35, 1969.

S. Ranise and C. Zarba, A Theory of Singly-Linked Lists and its Extensible Decision Procedure, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06), pp.206-215, 2006.
DOI : 10.1109/SEFM.2006.7

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

X. Rival and B. Y. Chang, Calling context abstraction with shapes, POPL'11, pp.173-186, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00760421

A. Sistla and E. Clarke, The complexity of propositional linear temporal logics, Journal of the ACM, vol.32, issue.3, pp.733-749, 1985.
DOI : 10.1145/3828.3837

L. Stockmeyer, The complexity of decision problems in automata theory and logic, 1974.

B. A. Trakhtenbrot, The impossibility of an algorithm for the decision problem for finite models, Doklady Akademii Nauk SSSR, vol.7023, pp.596-572, 1063.

M. Vardi and P. Wolper, Reasoning about Infinite Computations, Information and Computation, vol.115, issue.1, pp.1-37, 1994.
DOI : 10.1006/inco.1994.1092

URL : http://doi.org/10.1006/inco.1994.1092

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

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

H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook et al., Scalable Shape Analysis for Systems Code, CAV'08, pp.385-398, 2008.
DOI : 10.1007/978-3-540-70545-1_36

G. Yorsh, A. M. Rabinovich, M. Sagiv, A. Meyer, and A. Bouajjani, A logic of reachable patterns in linked data structures, FOSSACS'05, pp.94-110
URL : https://hal.archives-ouvertes.fr/hal-00149120