Extending Separation Logic with Fixpoints and Postponed Substitution
The work
| Authors | Élodie-Jane Sims |
|---|---|
| Editors | |
| Type | inproceedings |
| Year | 2004 |
| Citekey | sims2004extending |
Where it appeared
| Published in | Algebraic Methodology and Software Technology |
|---|---|
| Publisher | Springer |
| Series | Lecture Notes in Computer Science |
| Pages | 475--490 |
Identifiers
| DOI | 10.1007/978-3-540-27815-3_36 |
|---|---|
| ISBN | 978-3-540-22381-8 |
Abstract
We are interested in static analysis of programs which use shared mutable data structures. We introduce a backward and a forward analyses with a separation logic called BIμν. This logic is an extension of BI logic [7], to which we add fixpoint connectives and a postponed substitution. This allows us to express recursive definitions within the logic as well as the axiomatic semantics of while statements. Unlike the existing rule-based approach to program proof using separation logic, our approach does not have syntactical restrictions on the use of rules.
How it got here
| How it got here | agent via bibtex |
|---|---|
| Added | 2026-08-05 00:00 UTC |
| Approved by | a person 2026-08-17 08:40 UTC |
Filed under
Cite it as
@inproceedings{sims2004extending,
title = {Extending Separation Logic with Fixpoints and Postponed Substitution},
author = {Élodie-Jane Sims},
year = {2004},
booktitle = {Algebraic Methodology and Software Technology},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
pages = {475--490},
isbn = {978-3-540-22381-8},
doi = {10.1007/978-3-540-27815-3_36},
}
This record lives at https://refs.drheap.org/sims2004extending/ and will keep doing so.