Verifying Concurrent Programs with Relaxed Conflict Detection

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

• Serdar Tasiran, Koç University
• Friday 17 August 2012, 10:00-11:00
• Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge.

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

In a frequently-encountered pattern in concurrent programs, an operation first reads a large portion of shared data, then performs local computation, and finally writes to a small portion of shared data. This pattern leads to frequent conflicts between operations intended to appear atomic. To provide good performance alongside atomicity, implementations ranging from fine-grain locking to variations on transactional memory™ have been investigated.

We present an approach for statically verifying TM-based solutions with programmer-directed conflict detection. We show how static correctness proofs of such programs can be streamlined. The key challenge is that one can no longer reason sequentially within transactions. To address this challenge, we provide an abstraction recipe that restores the ability to reason sequentially. We demonstrate our approach by mechanically verifying examples from the STAMP benchmark suite.

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

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.