Local Reasoning about a Copying Garbage Collector

We present a programming language, model, and logic appropriate for implementing and reasoning about a memory management system. We state semantically what is meant by correctness of a copying garbage collector, and employ a variant of the novel separation logics to formally specify partial correctness of Cheney’s copying garbage collector in our program logic. Finally, we prove that our implementation of Cheney’s algorithm meets its specification, using the logic we have given, and auxiliary variables.