MoSeL: a general, extensible modal framework for interactive proofs in separation logic
Authors:
Open Access
- 30 July 2018
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 2 (ICFP) , 1-30
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.Keywords
Funding Information
- French National Research Agency (ANR-15-CE25-0008)
- European Research Council (683289)
- Flemish Research Fund (G.0962.17N)
This publication has 45 references indexed in Scilit:
- Unifying refinement and hoare-style reasoning in a logic for higher-order concurrencyACM SIGPLAN Notices, 2013
- The bedrock structured programming systemACM SIGPLAN Notices, 2013
- Syntactic soundness proof of a type-and-capability system with hidden stateJournal of Functional Programming, 2012
- Characteristic formulae for the verification of imperative programsACM SIGPLAN Notices, 2011
- Structuring the verification of heap-manipulating programsACM SIGPLAN Notices, 2010
- Multimodal Separation Logic for Reasoning About Operational SemanticsElectronic Notes in Theoretical Computer Science, 2008
- Resources, concurrency, and local reasoningTheoretical Computer Science, 2007
- A semantics for concurrent separation logicTheoretical Computer Science, 2007
- Types, bytes, and separation logicACM SIGPLAN Notices, 2007
- Possible worlds and resources: the semantics of BITheoretical Computer Science, 2004