Tue 16 Jun 2015 10:05 - 10:30 at PLDI Main BLUE (Portland 254-255) - Concurrency II Chair(s): Suresh Jagannathan

Efficient implementations of concurrent objects such as semaphores, locks, and atomic collections are essential to modern computing. Programming such objects is error prone: in minimizing the synchronization overhead between concurrent object invocations, one risks the conformance to reference implementations — or in formal terms, one risks violating observational refinement. Precisely testing this refinement even within a single execution is intractable, limiting existing approaches to executions with very few object invocations.

We develop scalable and effective algorithms for detecting refinement violations. Our algorithms are founded on incremental, symbolic reasoning, and exploit foundational insights into the refinement-checking problem. Our approach is sound, in that we detect only actual violations, and scales far beyond existing violation-detection algorithms. Empirically, we find that our approach is practically complete, in that we detect nearly all violations arising in actual executions.

PLDI 2015 Artifact Evaluated Badge

Tue 16 Jun

pldi2015-papers
09:15 - 10:55: Research Papers - Concurrency II at PLDI Main BLUE (Portland 254-255)
Chair(s): Suresh JagannathanPurdue University
pldi2015-papers143443890000009:15 - 09:40
Talk
Ofri ZivTel Aviv University, Alex AikenStanford University, Guy Golan-GuetaYahoo Labs, G. RamalingamMicrosoft Research, Mooly SagivTel Aviv University
Media Attached
pldi2015-papers143444040000009:40 - 10:05
Talk
Naling ZhangVirginia Tech, Markus KusanoVirginia Tech, Chao WangVirginia Tech
Media Attached
pldi2015-papers143444190000010:05 - 10:30
Talk
Michael Emmi, Constantin EneaLIAFA, Université Paris Diderot, Jad HamzaLIAFA, Université Paris Diderot
Media Attached
pldi2015-papers143444340000010:30 - 10:55
Talk
Stephen LongfieldCornell University, Brittany NkounkouCornell University, Rajit ManoharCornell University, Ross TateCornell University
Media Attached