Separation Logic: A Logic for Shared Mutable Data Structures (2002) [347 citations — 5 self]
by
John Reynolds
Add To MetaCart
Abstract:
In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure.
Citations
| 56 | Some techniques for proving correctness of programs which alter data structures – Burstall - 1972 |
| 35 | Computability and complexity results for a spatial assertion language for data structures – Calcagno, Yang, et al. |
| 20 | Program logic and equivalence in the presence of garbage collection – Calcagno, O’Hearn, et al. - 2002 |
| 9 | Verifiable and Executable Specifications of Concurrent Objects in L – Caires, Monteiro - 1998 |
| 7 | On garbage and program logic – Calcagno, O'Hearn - 2001 |
| 6 | Semantic and Logical Properties of Stateful Programming – Calcagno - 2002 |
| 3 | Program logics in the presence of garbage collection (abstract – Calcagno - 2001 |
| 2 | Explicit description in BI pointer logic. Unpublished – Bornat - 2001 |

