University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Local Reasoning for Storable Locks and Threads

  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

Local Reasoning for Storable Locks and Threads

Download to your calendar using vCal

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

This talk has been canceled/deleted

We present a resource-oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. The logic is inspired by concurrent separation logic, but handles these more realistic concurrency primitives. We demonstrate that the proposed logic allows for local reasoning about programs that exhibit a high degree of information hiding in their locking mechanisms. This is joint work with Josh Berdine, Byron Cook (MSR), Noam Rinetzky, Mooly Sagiv (Tel-Aviv University).

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

This talk is included in these lists:

  • This talk is not included in any other list

Note that ex-directory lists are not shown.

Other lists

Information Theory Seminar Meeting Room, Clare Hall Type the title of a new list here

Other talks

Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Cambridge RNA Club - ONLINE Toward affordable preventive healthcare Studying viruses to understand what makes pandemic viruses special and how innate immunity works Title TBC Shining a light on the origin of supermassive black holes with cosmological simulations
 

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