BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Formally Verifying the Performance of Concurrent Systems
DTSTART:20220824T130000
DTEND:20220824T150000
DTSTAMP:20260510T025345Z
UID:c6837bdd8ceabfaff37faf0f4d68a406241405e74406801758f58a58
CATEGORIES:Conferences - Seminars
DESCRIPTION:Can Cebeci\nEDIC candidacy exam\nExam president: Prof. James L
 arus\nThesis advisor: Prof. George Candea\nCo-examiner: Prof. Sanidhya Kas
 hyap\n\nAbstract\nMy current goal is to design a set of abstractions to se
 rve as a performance interface for synchronization primitives\, succinctly
  yet accurately summarizing their performance behavior\, akin to how seman
 tic interfaces summarize functionality. These summaries would then help de
 velopers of multithreaded applications choose which synchronization mechan
 ism to use\, identify performance bugs\, and reason about the end-to-end p
 erformance. As the overarching goal of my thesis\, I aim to design abstrac
 tions and methodologies to formally reason about the performance of concur
 rent systems.\n\nBackground papers\n\n	Non-scalable locks are dangerous\, 
 Boyd-Wickizer et al.\, 2012.\n	Everything you always wanted to know about
  synchronization but were afraid to ask\,  David et al.\, 2013.\n	The Sc
 alable Commutativity Rule: Designing Scalable Software for Multicore Pro
 cessors\, Clements et al\, 2015.\n
LOCATION:INN 326 https://plan.epfl.ch/?room==INN%20326
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR