Separation logic for sequential programs (functional pearl)

The work

TitleSeparation logic for sequential programs (functional pearl)
AuthorsArthur Charguéraud
Typearticle
Year2020
Citekeychargueraud2020separation

Where it appeared

Published inProceedings of the ACM on Programming Languages
PublisherAssociation for Computing Machinery
Volume4
IssueICFP
Pages116:1--116:43

Identifiers

DOI10.1145/3408998
OpenAlexW3047334575

Access

Landing pagehttps://doi.org/10.1145/3408998
Free full texthttps://dl.acm.org/doi/pdf/10.1145/3408998

Abstract

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.

Copy held

KindPDF, 1.1 MB
Retrieved2026-08-10
Heldlocal, for personal reference
Opens atpage 2
Where it came fromhttps://inria.hal.science/hal-03108936/file/seq_seplogic.pdf

Where this came from

How it got herethe agent went looking · found via openalex
First seen2026-08-04
Recordreviewed by a person
Approved2026-08-21

Cite it as

@article{chargueraud2020separation,
  title = {Separation logic for sequential programs (functional pearl)},
  author = {Arthur Charguéraud},
  year = {2020},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {4},
  number = {ICFP},
  pages = {116:1--116:43},
  publisher = {Association for Computing Machinery},
  doi = {10.1145/3408998},
  url = {https://dl.acm.org/doi/pdf/10.1145/3408998},
}

This record lives at https://refs.drheap.org/chargueraud2020separation/ and will keep doing so.