BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Concurrent Data Representation Synthesis - Mooly Sagiv\, Tel-Aviv 
 University
DTSTART:20120814T093000Z
DTEND:20120814T110000Z
UID:TALK39292@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:We describe an approach for synthesizing data representations\
 nfor concurrent programs. Our compiler takes as input a program\nwritten u
 sing concurrent relations and synthesizes a representation\nof the relatio
 ns as sets of cooperating data structures as well as the\nplacement and ac
 quisition of locks to synchronize concurrent access\nto those data structu
 res. The resulting code is correct by construction:\nindividual relational
  operations are implemented correctly and the\naggregate set of operations
  is serializable and deadlock free. The\nrelational specification also per
 mits a high-level optimizer to choose\nthe best performing of many possibl
 e legal data representations\nand locking strategies\, which we demonstrat
 e with an experiment\nautotuning a graph benchmark.\n\nThis is a joint wor
 k with Peter Hawkins (Google)\,  Alex Aiken\n(Stanford)\, Kathleen Fisher 
 (Tufts University) and Martin Rinard\n(MIT).
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR