A mechanically verified incremental garbage collector |
| |
Authors: | David M Russinoff |
| |
Affiliation: | (1) Computational Logic, Inc., 1717 West Sixth Street Suite 290, 78703-4776 Austin, TX, USA |
| |
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: | Boyer-Moore prover Concurrent programming Incremental garbage collection Mechanical program verification |
本文献已被 SpringerLink 等数据库收录! |
|