W. Andrew and . Appel, Amortised resource analysis with separation logic, LMCS, vol.7, issue.2, 2006.

J. Bengtson, J. B. Jensen, and L. Birkedal, Charge!-A framework for higher-order separation logic in Coq, ITP, vol.7406, pp.315-331, 2012.

J. Berdine, C. Calcagno, and P. W. O'hearn, A decidable fragment of separation logic, FSTTCS, pp.97-109, 2004.

J. Berdine, C. Calcagno, and P. W. O'hearn, Smallfoot: Modular automatic assertion checking with separation logic, FMCO, pp.115-137, 2005.

A. Bizjak and L. Birkedal, On models of higher-order separation logic, ENTCS, vol.336, pp.57-78, 2018.

S. Brookes, A semantics for concurrent separation logic, TCS, vol.375, pp.227-270, 2007.

C. Calcagno, W. Peter, H. O'hearn, and . Yang, Local action and abstract separation logic, LICS, pp.366-378, 2007.

Q. Cao, L. Beringer, S. Gruetter, J. Dodds, and A. W. Appel, VST-Floyd: A separation logic tool to verify correctness of C programs, JAR, vol.61, pp.367-422, 2018.

Q. Cao, S. Cuellar, and A. W. Appel, Bringing order to the separation logic jungle, APLAS, vol.10695, pp.190-211, 2017.

A. Charguéraud, Characteristic formulae for the verification of imperative programs, ICFP, pp.418-430, 2011.

A. Charguéraud, , 2018.

A. Charguéraud and F. Pottier, Temporary read-only permissions for separation logic, ESOP, vol.10201, pp.260-286, 2017.

H. Chen, D. Ziegler, T. Chajed, A. Chlipala, M. F. Kaashoek et al., Using Crash Hoare logic for certifying the FSCQ file system, SOSP, pp.18-37, 2015.

A. Chlipala, The Bedrock structured programming system: combining generative metaprogramming and Hoare logic in an extensible program verifier, ICFP, pp.391-402, 2013.

J. Courtault, D. Galmiche, and D. J. Pym, A logic of separating modalities, TCS, vol.637, pp.30-58, 2016.

P. Da-rocha, T. Pinto, P. Dinsdale-young, and . Gardner, TaDA: A logic for time and data abstraction, ECOOP, vol.8586, pp.207-231, 2014.

D. Delahaye, A tactic language for the system Coq, LPAR, vol.1955, pp.85-95, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01125070

R. Dockins, A. W. Appel, and A. Hobor, Multimodal separation logic for reasoning about operational semantics, MFPS, 2008.
DOI : 10.1016/j.entcs.2008.10.002
URL : https://doi.org/10.1016/j.entcs.2008.10.002

R. Dockins, A. Hobor, and A. W. Appel, A fresh look at separation algebras and share accounting, APLAS, vol.5904, pp.161-177, 2009.
DOI : 10.1007/978-3-642-10672-9_13

F. Garillot, G. Gonthier, A. Mahboubi, and L. Rideau, Packaging mathematical structures, In TPHOLs, vol.5674, pp.327-342, 2009.
DOI : 10.1007/978-3-642-03359-9_23
URL : https://hal.archives-ouvertes.fr/inria-00368403

A. Hobor and J. Villard, The ramifications of sharing in data structures, POPL, pp.523-536, 2013.

J. Braband-jensen, N. Benton, and A. Kennedy, High-level separation logic for low-level code, POPL, pp.301-314, 2013.

R. Jung, J. Jourdan, R. Krebbers, and D. Dreyer, Rustbelt: Securing the foundations of the Rust programming language, POPL, vol.2, p.34, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01633165

R. Jung, R. Krebbers, L. Birkedal, and D. Dreyer, Higher-order ghost state, ICFP, pp.256-269, 2016.
DOI : 10.1145/2951913.2951943

R. Jung, R. Krebbers, and J. Jourdan, Ale? Bizjak, Lars Birkedal, and Derek Dreyer. 2018b. Iris from the ground up: A modular foundation for higher-order concurrent separation logic, 2018.

R. Jung, D. Swasey, F. Sieczkowski, K. Svendsen, A. Turon et al., Iris: Monoids and invariants as an orthogonal basis for concurrent reasoning, pp.637-650, 2015.

J. Kaiser, H. Dang, and D. Dreyer, Strong logic for weak memory: Reasoning about release-acquire consistency in Iris, ECOOP (LIPIcs), vol.74, p.29, 2017.

R. Krebbers, The C standard formalized in Coq. Ph.D. Dissertation. Radboud University, 2015.

R. Krebbers, J. Jourdan, R. Jung, J. Tassarotti, J. Kaiser et al., Coq repository for MoSeL, 2018.

R. Krebbers, R. Jung, A. Bizjak, J. Jourdan, D. Dreyer et al., The essence of higher-order concurrent separation logic, ESOP, vol.10201, pp.696-723, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01633133

R. Krebbers, A. Timany, and L. Birkedal, Interactive proofs in higher-order concurrent separation logic, POPL, pp.205-217, 2017.
DOI : 10.1145/3009837.3009855
URL : http://dl.acm.org/ft_gateway.cfm?id=3009855&type=pdf

J. Daniel, A. Lehmann, J. Pnueli, and . Stavi, Impartiality, justice and fairness: The ethics of concurrent termination, Automata, Languages and Programming, pp.264-277, 1981.

A. Mccreight, Practical tactics for separation logic, TPHOLs, vol.5674, pp.343-358, 2009.

, Proc. ACM Program. Lang, vol.2, p.30, 2018.

J. Krebbers, . Jung, . Tassarotti, . Kaiser, C. Timany et al.,

A. Nanevski, V. Vafeiadis, and J. Berdine, Structuring the verification of heap-manipulating programs, POPL, pp.261-274, 2010.

W. Peter and . O'hearn, Resources, concurrency, and local reasoning, TCS, vol.375, pp.271-307, 2007.

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

W. Peter, J. C. O'hearn, H. Reynolds, and . Yang, Local reasoning about programs that alter data structures, CSL, vol.2142, pp.1-18, 2001.

F. Pottier, Syntactic soundness proof of a type-and-capability system with hidden state, JFP, vol.23, pp.38-144, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00877589

D. J. Pym, The semantics and proof theory of the logic of bunched implications, 2002.

D. J. Pym, P. W. O'hearn, and H. Yang, Possible worlds and resources: the semantics of BI, TCS, vol.315, pp.257-305, 2004.

C. John and . Reynolds, Intuitionistic reasoning about shared mutable data structure, Millennial Perspectives in Computer Science, pp.303-321, 2000.

J. C. Reynolds, Separation logic: A logic for shared mutable data structures, LICS, pp.55-74, 2002.

I. Sergey, A. Nanevski, and A. Banerjee, Mechanized verification of fine-grained concurrent programs, PLDI, pp.77-87, 2015.

I. Sergey, A. Nanevski, and A. Banerjee, Specifying and verifying concurrent algorithms with histories and subjectivity, ESOP, pp.333-358, 2015.

M. Sozeau and N. Oury, First-class type classes, TPHOLs, vol.5170, pp.278-293, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00628864

B. Spitters and E. Van-der-weegen, Type classes for mathematics in type theory, MSCS, vol.21, pp.795-825, 2011.

D. Swasey, D. Garg, and D. Dreyer, Robust and compositional verification of object capability patterns, PACMPL, vol.1, p.26, 2017.

J. Tassarotti, R. Jung, and R. Harper, A higher-order logic for concurrent termination-preserving refinement, ESOP, vol.10201, pp.909-936, 2017.

A. Timany, L. Stefanesco, M. Krogh-jespersen, and L. Birkedal, A logical relation for monadic encapsulation of state: Proving contextual equivalences in the presence of runST, POPL, vol.2, p.28, 2018.

H. Tuch, G. Klein, and M. Norrish, Types, bytes, and separation logic, POPL, pp.97-108, 2007.

A. Turon, D. Dreyer, and L. Birkedal, Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency, pp.377-390, 2013.

V. Vafeiadis and M. J. Parkinson, A marriage of rely/guarantee and separation logic, CONCUR, vol.4703, pp.256-271, 2007.