University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Verification of a copying garbage collector

Verification of a copying garbage collector

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk.

I’ll present an outline of a verification proof for a copying garbage collector. Unlike published proofs of copying collectors, this verification proof is structured to aid proof reuse: it is not tied to a specific programming logic and keeps as much as possible simple and separate from the low-level details (such as how heap cells are represented in machine memory). I’ll end the talks with a few comments on how this copying collector might aid verification of a generational copying collector.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity