Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures.
As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the compatibility of nested Hoare triples with several variations of higher-order frame rules.
The interaction of nested triples and frame rules can be subtle, and the inclusion of certain frame rules is in fact unsound. A particular combination of rules can be shown consistent by means of a Kripke model where worlds live in a recursively defined ultrametric space. The resulting logic allows us to elegantly prove programs involving stored code. In particular, using recursively defined assertions, it leads to natural specifications and proofs of invariants required for dealing with recursion through the store.
Available from the LMCS homepage and arXiv.
Revised and expanded version of CSL'09 paper.
Login to edit
Wed Sep 16 10:47:00 2009