Separation predicates: A taste of separation logic in first-order logic
The work
| Authors | François Bobot; Jean-Christophe Filliâtre |
|---|---|
| Editors | |
| Type | inproceedings |
| Year | 2012 |
| Citekey | bobot2012separation |
Where it appeared
| Published in | International Conference on Formal Engineering Methods |
|---|---|
| Publisher | Springer |
| Series | Lecture Notes in Computer Science |
| Number in series | 7635 |
| Pages | 167--181 |
Identifiers
| DOI | 10.1007/978-3-642-34281-3_14 |
|---|
Abstract
This paper introduces separation predicates, a technique to reuse some ideas from separation logic in the framework of program verification using a traditional first-order logic. The purpose is to benefit from existing specification languages, verification condition generators, and automated theorem provers. Separation predicates are automatically derived from user-defined inductive predicates. We illustrate this idea on a non-trivial case study, namely the composite pattern, which is specified in C/ACSL and verified in a fully automatic way using SMT solvers Alt-Ergo, CVC3, and Z3.
A copy is held
pdf, 286.1 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via bibtex |
|---|---|
| Added | 2026-08-05 00:00 UTC |
| Approved by | a person 2026-08-16 15:32 UTC |
Filed under
Cite it as
@inproceedings{bobot2012separation,
title = {Separation predicates: A taste of separation logic in first-order logic},
author = {François Bobot and Jean-Christophe Filliâtre},
year = {2012},
booktitle = {International Conference on Formal Engineering Methods},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
pages = {167--181},
doi = {10.1007/978-3-642-34281-3_14},
}
This record lives at https://refs.drheap.org/bobot2012separation/ and will keep doing so.