Separation logic for sequential programs (functional pearl)

This paper presents a simple mechanized formalization of Separation Logic for sequential programs. This formalization is aimed for teaching the ideas of Separation Logic, including its soundness proof and its recent enhancements. The formalization serves as support for a course that follows the styl...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 4; no. ICFP; pp. 1 - 34
Main Author:	Charguéraud, Arthur
Format:	Journal Article
Language:	English
Published:	ACM 02.08.2020
Subjects:	Computer Science Programming Languages CCS Concepts: • Theory of computation → Separation logic Logic and verification Separation Logic Coq Program verification
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper presents a simple mechanized formalization of Separation Logic for sequential programs. This formalization is aimed for teaching the ideas of Separation Logic, including its soundness proof and its recent enhancements. The formalization serves as support for a course that follows the style of the successful Software Foundations series, with all the statement and proofs formalized in Coq. This course only assumes basic knowledge of lambda-calculus, semantics and logics, and therefore should be accessible to a broad audience.
ISSN:	2475-1421 2475-1421
DOI:	10.1145/3408998