A mechanically verified incremental garbage collector

N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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. © 1994 BCS.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Russinoff, D. M. (1994). A mechanically verified incremental garbage collector. Formal Aspects of Computing, 6(4), 359–390. https://doi.org/10.1007/BF01211305

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 7

70%

Professor / Associate Prof. 2

20%

Researcher 1

10%

Readers' Discipline

Tooltip

Computer Science 11

100%

Save time finding and organizing research with Mendeley

Sign up for free