Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL

Reference:

L. Prensa Nieto and J. Esparza. Verifying single and multi-mutator garbage collectors with Owicki-Gries in Isabelle/HOL. In M. Nielsen and B. Rovan, editors, Proceedings of the 25th Conference on Mathematical Foundations of Computer Science, number 1893 in Lecture Notes in Computer Science, pages 619–628. Springer-Verlag, 2000.

Abstract:

Using a formalization of the Owicki-Gries method in the theorem prover Isabelle/HOL, we obtain mechanized correctness proofs for two incremental garbage collection algorithms, the second one parametric in the number of mutators. No full Owicki-Gries proofs of these algorithms existed so far, and for the second algorithm no mechanized proof at all. The Owicki-Gries method allows to reason directly on the program code; it also splits the proof into many small goals, most of which are very simple, and can thus be proved automatically. Thanks to Isabelle's facilities in dealing with syntax, the formalization can be done in a very natural way.

Suggested BibTeX entry:

@inproceedings{PE00,
    author = {L. Prensa Nieto and J. Esparza},
    booktitle = {{Proceedings of the 25th~Conference on Mathematical Foundations of Computer Science}},
    editor = {M. Nielsen and B. Rovan},
    number = {1893},
    pages = {619--628},
    publisher = {{Springer-Verlag}},
    series = {{Lecture Notes in Computer Science}},
    title = {Verifying Single and Multi-mutator Garbage Collectors with {O}wicki-{G}ries in {I}sabelle/{HOL}},
    year = {2000}
}

GZipped PostScript (72 kB)
PDF (224 kB)