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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Verification of a copying garbage collector

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Creating transparent intact animal organs for high-resolution 3D deep-tissue imaging DAMTP Fluids Talks LR6, Engineering Department, Baker Building

Other talks

Title to be confirmed Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels Director's Briefing An AI-Assisted Proof in Spectral Geometry Title TBC Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity