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

Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, Amin Timany, Arthur Charguéraud, Derek Dreyer

Research output: Contribution to journalArticleScientificpeer-review

15 Downloads (Pure)


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.
Original languageUndefined/Unknown
Article number77
Pages (from-to)77:1-77:30
Number of pages30
JournalProceedings of the ACM on Programming Languages
Issue numberICFP
Publication statusPublished - 2018

Cite this

Krebbers, R., Jourdan, J-H., Jung, R., Tassarotti, J., Kaiser, J-O., Timany, A., Charguéraud, A., & Dreyer, D. (2018). MoSeL: A general, extensible modal framework for interactive proofs in separation logic. Proceedings of the ACM on Programming Languages, 2(ICFP), 77:1-77:30. [77].