BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium : Concurrent Data Representation Synthesis
DTSTART:20131007T161500
DTEND:20131007T173000
DTSTAMP:20260406T194439Z
UID:13a6b809c87f468ab09b37ff2e7d68ac2716e4c017dc5254a943cbe4
CATEGORIES:Conferences - Seminars
DESCRIPTION:Mooly Sagiv - School of Computer Science\, Tel Aviv University
 \nAbstract :\nI will first describe our experience with testing composed c
 oncurrent Java operations which exposed many bugs in public domain softwar
 e.\nI will also describe two approaches avoiding these bugs. The first app
 roach combines a simple compilation scheme with runtime synchronizations.\
 nThe second approach is completely static. We build a compiler that takes 
 as input a program written using concurrent relations and synthesizes a re
 presentation of the relations as sets of cooperating data structures as we
 ll as the placement and acquisition of locks to synchronize concurrent acc
 ess to those data structures. The resulting code is correct by constructio
 n: individual relational operations are implemented correctly and the aggr
 egate set of operations is serializable and deadlock free. The relational 
 specification also permits a high-level optimizer to choose the best perfo
 rming of many possible legal data representations and locking strategies.\
 nThis is joint work with Alex Aiken\, Nathan Bronson\, and Peter Hawkins(S
 tanford University)\, Katleen Fisher(DARPA)\,\nGuy Golan-Gueta\, Ohad Shac
 ham\, and Ofri Ziv (Tel Aviv University)\, G. Ramalingam (Microsoft Resear
 ch)\, Martin Rinard(MIT) and Eran Yahav (Technion)\nParts of this work app
 ear in Petrer Hawkins thesis http://theory.stanford.edu/~hawkinsp/ (Honora
 ble mention for the ACM doctoral dissertation award)\nBio:\nMooly Sagiv is
  Professor of Computer Science at Tel Aviv University. His research focuse
 s on program analysis and verification\, in particular reasoning about imp
 erative programs manipulating dynamic data structures. His current work in
 cludes shape analysis and reasoning about software defined networks. Sagiv
  is a recipient of a 2013 senior ERC research grant for Verifying and Synt
 hesizing Software Composition.\nSagiv was a visiting professor at UC Berke
 ley and Stanford University in 2010-2011\, and was a Postdoc with Tom Reps
  at The University of Wisconsin in 1994-1995.  He spent 3 years at IBM as
  a researcher after earning his PhD from the Technion Israel in 1991.
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR