University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Modular reasoning for modular concurrency

  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

Modular reasoning for modular concurrency

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Modular programming and modular verification go hand in hand, but most existing logics for concurrency ignore two crucial forms of modularity: higher-order functions, which are essential for building reusable components, and granularity abstraction, a key technique for hiding the intricacies of fine-grained concurrent data structures from their clients. This talk will present CaReSL, the first logic to apply granularity abstraction for modular verification of higher-order concurrent programs. The talk is organized around a few simple but subtle examples that motivate CaReSL’s key ideas, and that ultimately come together in a significant case study: the first formal proof of correctness for Hendler et al.’s “flat combining” algorithm.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cripps Court, Magdalene College Physics of Living Matter - PLM The Bathhouse

Other talks

Using numerical simulations for solving spectral geometry problems Gastroenterology and Acute Medicine Title TBC Dinner Claudia Ribeiro Almeida, Group Leader, Babraham Institute Precision psychiatry
 

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