A mechanically verified incremental garbage collector
- 1 July 1994
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 6 (4) , 359-390
- https://doi.org/10.1007/bf01211305
Abstract
As an application of a system designed for concurrent program verification, we describe a formalisation and mechanical proof of the correctness of Ben-Ari's incremental garbage collection algorithm. The proof system is based on the Manna-Pnueli model of concurrency and is implemented as an extension of the Boyer-Moore prover. The correctness of the garbage collector is represented by two theorems, stating a) that nothing except garbage is ever collected (safety), and b) that all garbage is eventually collected (liveness). We compare our mechanised treatment with several published proofs of the same results.Keywords
This publication has 8 references indexed in Scilit:
- A verification system for concurrent programs based on the Boyer-Moore proverFormal Aspects of Computing, 1992
- Developing formally verified Ada programsPublished by Association for Computing Machinery (ACM) ,1989
- An incremental garbage collection algorithm for multi-mutator systemsDistributed Computing, 1988
- A Computational Logic HandbookPublished by Elsevier ,1988
- “Algorithms for on-the-fly garbage collection” revisitedInformation Processing Letters, 1987
- Adequate proof principles for invariance and liveness properties of concurrent programsScience of Computer Programming, 1984
- Algorithms for on-the-fly garbage collectionACM Transactions on Programming Languages and Systems, 1984
- On-the-fly garbage collectionCommunications of the ACM, 1978