T. Antonopoulos, N. Gorogiannis, C. Haase, M. Kanovich, and J. Ouaknine, Foundations for decision problems in separation logic with general inductive predicates, FOSSACS'14, vol.8412, pp.411-425, 2014.
DOI : 10.1007/978-3-642-54830-7_27
URL : https://eprints.mdx.ac.uk/15930/1/2014-fossacs.pdf

J. Berdine, C. Calcagno, and P. O'hearn, A decidable fragment of separation logic, FSTTCS'04, vol.3328, pp.97-109, 2004.
DOI : 10.1007/978-3-540-30538-5_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2849

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

R. Brochenin, S. Demri, and E. Lozes, Reasoning about sequences of memory states, APAL, vol.161, issue.3, pp.305-323, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01905172

R. Brochenin, S. Demri, and E. Lozes, On the almighty wand, vol.211, pp.106-137, 2012.
DOI : 10.1007/978-3-540-87531-4_24
URL : https://hal.archives-ouvertes.fr/hal-01905158

J. Brotherston, C. Fuhs, N. Gorogiannis, and J. N. Perez, A decision procedure for satisfiability in separation logic with inductive predicates, CSLLICS'14, 2014.

J. Brotherston and J. Villard, Parametric completeness for separation theories, POPL'14, pp.453-464, 2014.
DOI : 10.1145/2535838.2535844
URL : http://dl.acm.org/ft_gateway.cfm?id=2535844&type=pdf

C. Calcagno and D. Distefano, Infer: An automatic program verifier for memory safety of C programs, NASA Formal Methods, vol.6617, pp.459-465, 2011.
DOI : 10.1007/978-3-642-20398-5_33

C. Calcagno, D. Distefano, P. O'hearn, and H. Yang, Compositional shape analysis by means of bi-abduction, JACM, vol.58, issue.6, 2011.

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

C. Calcagno, P. O'hearn, and H. Yang, Computability and complexity results for a spatial assertion language for data structures, FSTTCS'01, vol.2245, pp.108-119, 2001.
DOI : 10.1007/3-540-45294-x_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.3831

B. Cook, C. Haase, J. Ouaknine, M. Parkinson, and J. Worrell, Tractable reasoning in a fragment of separation logic, CONCUR'11, vol.6901, pp.235-249, 2011.

C. David, D. Kroening, and M. Lewis, Propositional reasoning about safety and termination of heap-manipulating programs, ESOP'15, vol.9032, pp.661-684, 2015.

S. Demri and M. Deters, Expressive completeness of separation logic with two variables and no separating conjunction, vol.17, p.12, 2016.
DOI : 10.1145/2835490
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DD-csllics14.pdf

S. Demri, D. Galmiche, D. Larchey-wendling, and D. Mery, Separation logic with one quantified variable. Theory of Computing Systems, vol.61, pp.371-461, 2017.
DOI : 10.1007/s00224-016-9713-1
URL : https://hal.archives-ouvertes.fr/hal-01258802

D. Distefano, P. O'hearn, and H. Yang, A local shape analysis based on separation logic, TACAS'06, vol.3920, pp.287-302, 2006.
DOI : 10.1007/11691372_19
URL : https://link.springer.com/content/pdf/10.1007%2F11691372_19.pdf

C. Haase, S. Ishtiaq, J. Ouaknine, and M. Parkinson, SeLoger: A tool for graphbased reasoning in separation logic, CAV'13, vol.8044, pp.790-795, 2013.
DOI : 10.1007/978-3-642-39799-8_55
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HIOP-cav13.pdf

Z. Hou, R. Goré, and A. Tiu, Automated theorem proving for assertions in separation logic with all connectives, CADE'15, vol.9195, pp.501-516, 2015.

R. Iosif, A. Rogalewicz, and J. Simacek, The tree width of separation logic with recursive definitions, CADE'13, vol.7898, pp.21-38, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01418897

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

Q. Le, M. Tatsuta, J. Sun, and W. Chin, A decidable fragment in separation logic with inductive predicates and arithmetic, CAV'17, vol.10427, pp.495-517, 2017.

E. Lozes, Expressivité des Logiques Spatiales, 2004.

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

P. Müller, M. Schwerhoff, and A. Summers, Viper: A verification infrastructure for permission-based reasoning, VMCAI'16, vol.9583, pp.41-62, 2016.

P. O'hearn, J. Reynolds, and H. Yang, Local reasoning about programs that alter data structures, CSL'01, vol.2142, pp.1-19, 2001.

R. Piska?, T. Wies, and D. Zufferey, Automating separation logic using SMT, CAV'13, vol.8044, pp.773-789, 2013.

S. Ranise and C. Zarba, A theory of singly-linked lists and its extensible decision procedure, SEFM'06, pp.206-215, 2006.

J. Reynolds, Separation logic: a logic for shared mutable data structures, LICS'02, pp.55-74, 2002.

M. Schwerhoff and A. Summers, Lightweight support for magic wands in an automatic verifier, Leibniz-Zentrum für Informatik, LIPICS, pp.999-1023, 2015.

A. Thakur, Symbolic Abstraction: Algorithms and Applications, 2014.

A. Thakur, J. Breck, and T. Reps, Satisfiability modulo abstraction for separation logic with linked lists, SPIN'14, pp.58-67, 2014.

H. Yang, Local Reasoning for Stateful Programs, 2001.

H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook et al., Scalable shape analysis for systems code, CAV'08, vol.5123, pp.385-398, 2008.