BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Reasoning about Eventual Consistency - Alexey Gotsman\, IMDEA Soft
 ware Institute\, Madrid\, Spain
DTSTART:20131206T110000Z
DTEND:20131206T120000Z
UID:TALK49008@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Modern databases underlying large-scale Internet services guar
 antee immediate availability and tolerate network partitions at the expens
 e of providing only weak forms of consistency\, commonly dubbed eventual c
 onsistency. Even though the folklore notion of eventual consistency is ver
 y weak\, in reality\, the semantics and programming interfaces of systems 
 implementing it can be very subtle. Thus\, such systems can resolve confli
 cting updates using complex protocols\, called replicated data types\, and
  can allow varying kinds of anomalous behaviour.\n\nSo far the semantics p
 rovided by eventually consistent systems has been poorly understood. I wil
 l present a framework for its formal  specification that addresses this pr
 oblem by generalising weak shared-memory models to arbitrary replicated da
 ta types. I will then describe our ongoing effort to develop effective rea
 soning principles for eventually consistent systems.\n\nThis is joint work
  with Sebastian Burckhardt (Microsoft Research)\, Hongseok Yang (Universit
 y of Oxford) and Marek Zawirski (UPMC & INRIA). Part of it will appear in 
 POPL'14. \n\n
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR