Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved to be functionally correct. Our verification proof is structured as a sequence of refinements to aid clarity and proof reuse; it is the first to map implementations into three different machine languages and, unlike some noteworthy published proofs, our verified implementations of memory allocation handle termination and the 'out-of-memory' case properly. The work presented here has been developed in the HOL4 theorem prover. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Myreen, M. O. (2010). Reusable verification of a copying collector. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6217 LNCS, pp. 142–156). https://doi.org/10.1007/978-3-642-15057-9_10
Mendeley helps you to discover research relevant for your work.