BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Concurrency Assertions – Providing the Right Semantics to ASSERT
  Statements - Madan Musuvathi\, Microsoft Research
DTSTART:20111124T140000Z
DTEND:20111124T150000Z
UID:TALK34579@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:This work is motivated by the observation that existing implem
 entations of ASSERT statements are broken in important ways for concurrent
  programs. Concurrency assertions fix these problems by \n1) Evaluating th
 e assertion expression atomically\, and\n2) Taking the program checkpoint 
 atomically with the evaluation on a failure\n\nThese ensure that the asser
 tion expression is not concurrently modified during evaluation and that th
 e checkpoint generated on a failure represents a valid violating program s
 tate. \n\nApart from fixing the semantics\, concurrency assertions improve
  the chances of an assertion failure by continuously evaluating the assert
 ion expression for a randomly chosen time window. During this window\, any
  concurrent write that violates the expression will trigger a failure. \n\
 nWe have implemented concurrency assertions for C/C++ programs. In this ta
 lk\, I will describe our design choices\, our implementation\, and our exp
 erience in using concurrency assertions on SQL Server. \n\nThis is work in
  progress\, and done jointly with Jacob Burnim (U.C. Berkeley) and Shaz Qa
 deer (MSR).
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR