Verification of a copying garbage collector

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

• Magnus Myreen (University of Cambridge)
• Tuesday 18 May 2010, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.