Separation logic for sequential programs (functional pearl)
The work
| Authors | Arthur Charguéraud |
|---|---|
| Editors | |
| Type | article |
| Year | 2020 |
| Citekey | chargueraud2020separation |
Where it appeared
| Published in | Proceedings of the ACM on Programming Languages |
|---|---|
| Publisher | Association for Computing Machinery |
| Volume | 4 |
| Issue | ICFP |
| Pages | 116:1--116:43 |
Identifiers
| DOI | 10.1145/3408998 |
|---|---|
| OpenAlex | W3047334575 |
Access
| Landing page | https://doi.org/10.1145/3408998 |
|---|---|
| Free full text | https://dl.acm.org/doi/pdf/10.1145/3408998 |
Related
| Distinct from | ohearn2012primer |
|---|
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.
A copy is held
pdf, 1.0 MB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-08-04 00:00 UTC |
| Approved by | a person 2026-08-21 05:49 UTC |
Filed under
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},
publisher = {Association for Computing Machinery},
volume = {4},
number = {ICFP},
pages = {116:1--116:43},
doi = {10.1145/3408998},
}
This record lives at https://refs.drheap.org/chargueraud2020separation/ and will keep doing so.