A Verified Generational Garbage Collector for CakeML
Inledande text i tidskrift, 2018

This paper presents the verification of a generational copying garbage collector for the CakeML runtime system. The proof is split into an algorithm proof and an implementation proof. The algorithm proof follows the structure of the informal intuition for the generational collector’s correctness, namely, a partial collection cycle in a generational collector is the same as running a full collection on part of the heap, if one views pointers to old data as non-pointers. We present a pragmatic way of dealing with ML-style mutable state, such as references and arrays, in the proofs. The development has been fully integrated into the in-logic bootstrapped CakeML compiler, which now includes command-line arguments that allow configuration of the generational collector. All proofs were carried out in the HOL4 theorem prover.

Garbage collection

Formal methods

Interactive theorem proving

Compiler verification

Författare

Adam Sandberg Eriksson

Programvaruteknik, Grupp C1

Magnus Myreen

Programvaruteknik, Grupp A

Johannes Åman Pohjala

CSIRO Data61

Journal of Automated Reasoning

0168-7433 (ISSN) 1573-0670 (eISSN)

Vol. 63 2 463-488

Ämneskategorier

Mediateknik

Inbäddad systemteknik

Datavetenskap (datalogi)

DOI

10.1007/s10817-018-9487-z

Mer information

Senast uppdaterat

2019-12-02