BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Safety of program transformations in shared-memory concurrency - J
 aroslav Sevcik (visiting from Edinburgh)
DTSTART:20090527T100000Z
DTEND:20090527T110000Z
UID:TALK18665@talks.cam.ac.uk
CONTACT:Sam Staton
DESCRIPTION:Most programmers assume an interleaved semantics when reasonin
 g about shared-memory concurrent programs. Unfortunately\, even simple and
  widely implemented optimisations\, such as constant propagation\, violate
  the interleaved semantics. In this talk\, I will argue that in absence of
  data races\, interleaved semantics can be recovered for common classes of
  optimisations. My argument focuses on two classes of program transformati
 ons - eliminations and reorderings - which seem to explain most of the opt
 imisations performed by realistic compilers.\n\nThe core of our technique 
 is trace semantic: programs are viewed as sets of action traces and transf
 ormations as relations on tracesets. This makes the proof largely independ
 ent of concrete language details.
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR