Skip to Main content Skip to Navigation
Conference papers

MoSeL: a general, extensible modal framework for interactive proofs in separation logic

Abstract : A number of tools have been developed for carrying out separation-logic proofs mechanically using an interactive proof assistant. One of the most advanced such tools is the Iris Proof Mode (IPM) for Coq, which offers a rich set of tactics for making separation-logic proofs look and feel like ordinary Coq proofs. However, IPM is tied to a particular separation logic (namely, Iris), thus limiting its applicability. In this paper, we propose MoSeL, a general and extensible Coq framework that brings the benefits of IPM to a much larger class of separation logics. Unlike IPM, MoSeL is applicable to both affine and linear separation logics (and combinations thereof), and provides generic tactics that can be easily extended to account for the bespoke connectives of the logics with which it is instantiated. To demonstrate the effectiveness of MoSeL, we have instantiated it to provide effective tactical support for interactive and semi-automated proofs in six very different separation logics.
Complete list of metadatas

Cited literature [54 references]  Display  Hide  Download
Contributor : Jacques-Henri Jourdan <>
Submitted on : Thursday, October 18, 2018 - 3:12:46 PM
Last modification on : Tuesday, April 21, 2020 - 1:09:14 AM



Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, et al.. MoSeL: a general, extensible modal framework for interactive proofs in separation logic. International Conference on Functional Programming (ICFP 2018), ACM, Sep 2018, St Louis, MO, United States. pp.77, ⟨10.1145/3236772⟩. ⟨hal-01898522⟩



Record views


Files downloads