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

Local Reasoning for Storable Locks and Threads

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

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

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.

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