![]() |
![]() |
University of Birmingham > Talks@bham > Lab Lunch > Proving the correctness of a concurrent garbage collector
Proving the correctness of a concurrent garbage collectorAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dan Ghica. Concurrent garbage collectors (also called “on-the-fly” garbage collectors) were some of the earliest multiprocessor algorithms developed and checking their correctness was a considerable challenge. In this talk, I present the use of the Concurrent Separation Logic to deal with the problem and the lessons learned. This talk is part of the Lab Lunch series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsFeatured lists Type the title of a new list here Computer Science Distinguished SeminarOther talksExtending the Lax type operator for finite W-algebras Ultrafast, all-optical, and highly efficient imaging of molecular chirality Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Modelling uncertainty in image analysis. Quantum simulations using ultra cold ytterbium TBC |