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.
Highlights
Over the past 20 years, separation logic [O’Hearn et al 2001; Reynolds 2002] has come to play an essential role in the program verification toolbox, with a wide range of variations and applications.Proc
We propose MoSeL, a general and extensible Coq framework that brings the benefits of Iris Proof Mode (IPM) to a much larger class of separation logics
This work only considered restricted fragments of separation logic [Berdine et al 2004, 2005]. In their seminal development of Concurrent Separation Logic (CSL), O’Hearn [2007] and Brookes [2007] demonstrated that the core concept of separation logicÐnamely, that propositions describe ownership of resourcesÐwas just as useful, if not more so, for reasoning modularly about shared state in concurrent programs
Summary
Over the past 20 years, separation logic [O’Hearn et al 2001; Reynolds 2002] has come to play an essential role in the program verification toolbox, with a wide range of variations and applications. MoSeL: A General, Extensible Modal Framework for Interactive Proofs in Separation Logic 77:3 tactical support for reasoning both at the higher level of iGPS and at the lower level of its Iris encoding, and for mixing the two levels of abstraction when needed. We explain how MoSeL extends the approach of the original IPM with more aggressive use of Coq’s type classes (including the little-known feature of łhigher-order type classesž), in order to make the implementations of its tactics parametric in the particular connectives/modalities they are applied to In this way, when MoSeL is instantiated with a new logic, it can be extended with tactical support for the bespoke connectives of that logic (ğ5). We conclude the paper with a discussion of related work (ğ6)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
