Separation Logic for Sequential Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Proceedings of the ACM on Programming Languages Year : 2020

Separation Logic for Sequential Programs


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.
Fichier principal
Vignette du fichier
seq_seplogic.pdf (798.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03108936 , version 1 (13-01-2021)



Arthur Charguéraud. Separation Logic for Sequential Programs. Proceedings of the ACM on Programming Languages, 2020, 4, ⟨10.1145/3408998⟩. ⟨hal-03108936⟩
55 View
164 Download



Gmail Facebook X LinkedIn More