N. Agh-+-14]-timos-antonopoulos, C. Gorogiannis, M. I. Haase, J. Kanovich, and . Ouaknine, Foundations for decision problems in separation logic with general inductive predicates, Foundations of Software Science and Computation Structures: 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, pp.411-425, 2014.

]. A. +-06, M. Bouajjani, P. Bozga, R. Habermehl, P. Iosif et al., Shape analysis for composite data structures, Proc. CAV'07, vol.4144, pp.517-531, 2006.

, Computer Aided Verification (CAV), 2011.

J. Berdine, C. Calcagno, and P. W. O'hearn, Symbolic execution with separation logic, Proceedings of the Third Asian Conference on Programming Languages and Systems, APLAS'05, pp.52-68, 2005.

R. Brochenin, S. Demri, and E. Lozes, On the almighty wand. Information and Computation, vol.211, pp.106-137, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01905158

J. Brotherston, D. Distefano, and R. L. Petersen, Automated cyclic entailment proofs in separation logic, Automated Deduction -CADE-23: 23rd International Conference on Automated Deduction, pp.131-146, 2011.

E. Börger, E. Grädel, and Y. Gurevich, The Classical Decision Problem, Perspectives in Mathematical Logic, 1997.

J. Brotherston, N. Gorogiannis, and R. Petersen, A generic cyclic theorem prover, APLAS, pp.350-367, 2012.

P. Cousot and R. Cousot, Systematic design of program analysis frameworks, POPL, pp.269-282, 1979.

C. Calcagno and D. Distefano, Infer: An automatic program verifier for memory safety of c programs, Proc. of NASA Formal Methods'11, vol.6617, 2011.

C. Calcagno, D. Distefano, P. W. O'hearn, and H. Yang, Footprint analysis: A shape analysis that discovers preconditions, Static Analysis, pp.402-418, 2007.

C. Calcagno, D. Distefano, P. W. O'hearn, and H. Yang, Compositional shape analysis by means of bi-abduction, J. ACM, vol.58, issue.6, pp.1-26, 2011.

C. Calcagno, P. Gardner, and M. Hague, From separation logic to first-order logic, Foundations of Software Science and Computational Structures, pp.395-409, 2005.

D. Chu, J. Jaffar, and M. Trinh, Automatic induction proofs of data-structures in imperative programs, Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.457-466, 2015.

B. Courcelle, The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation, vol.85, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00334050

C. Calcagno, H. Yang, and P. W. O'hearn, Computability and complexity results for a spatial assertion language for data structures, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, pp.108-119, 2001.

M. Echenim, R. Iosif, and N. Peltier, The complexity of prenex separation logic with one selector, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01946528

M. Echenim, R. Iosif, and N. Peltier, On the expressive completeness of bernays-schönfinkel-ramsey separation logic, 2018.

R. W. Floyd, Assigning meanings to programs, Proceedings of Symposia in Applied Mathematics, vol.19, pp.19-32, 1967.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-101, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075966

C. A. Hoare, An axiomatic basis for computer programming, Commun. ACM, vol.12, issue.10, pp.576-580, 1969.

S. Samin, . Ishtiaq, W. Peter, and . Hearn, Bi as an assertion language for mutable data structures, ACM SIGPLAN Notices, vol.36, pp.14-26, 2001.

R. Iosif, A. Rogalewicz, and T. Vojnar, Deciding entailments in inductive separation logic with tree automata, Automated Technology for Verification and Analysis: 12th International Symposium, pp.201-218, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01418889

C. Quang-loc-le, S. Gherghina, W. Qin, and . Chin, Shape analysis via second-order bi-abduction, Computer Aided Verification -26th International Conference, pp.52-68, 2014.

W. Peter, D. J. O'hearn, and . Pym, The logic of bunched implications, The Bulletin of Symbolic Logic, vol.5, issue.2, pp.215-244, 1999.

W. Peter, J. C. O'hearn, H. Reynolds, and . Yang, Local reasoning about programs that alter data structures, Proceedings of the 15th International Workshop on Computer Science Logic, CSL '01, pp.1-19, 2001.

W. Peter, H. O'hearn, J. C. Yang, and . Reynolds, Separation and information hiding, SIGPLAN Not, vol.39, issue.1, pp.268-280, 2004.

J. C. Reynolds, Separation logic: A logic for shared mutable data structures, Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, LICS '02, pp.55-74, 2002.

A. Reynolds, R. Iosif, and C. Serban, Reasoning in the bernaysschönfinkel-ramsey fragment of separation logic, Verification, Model Checking, and Abstract Interpretation, pp.462-482, 2017.

A. Reynolds, R. Iosif, C. Serban, and T. King, A decision procedure for separation logic in smt, Automated Technology for Verification and Analysis, pp.244-261, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01418883

M. Sighireanu and D. Cok, Report on sl-comp, Boolean Modeling and Computation, vol.1, 2014.

C. Serban, Inductor: an entailment checker for inductive systems, 2017.