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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings of ACM on programming languages Ročník 4; číslo ICFP; s. 1 - 34
Hlavní autor:	Charguéraud, Arthur
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	ACM 02.08.2020
Témata:	Computer Science Programming Languages CCS Concepts: • Theory of computation → Separation logic Logic and verification Separation Logic Coq Program verification
ISSN:	2475-1421, 2475-1421
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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