Tags:Garbage Collection, Program Verification and Separation Logic
Abstract:
We present a program logic for reasoning about heap space in a λ-calculus equipped with garbage collection and mutable state. Compared with prior work by Madiot and Pottier, we target a higher-level language. This requires us to introduce an assertion to reason about the roots held by the evaluation context.
Polishing a Rough Diamond: an Enhanced Separation Logic for Heap Space Under Garbage Collection