Tue 16 Jun 2015 09:15 - 09:40 at PLDI Main BLUE (Portland 254-255) - Concurrency II Chair(s): Suresh Jagannathan

Concurrency control poses significant challenges when composing computations over multiple data-structures (objects) with different concurrency-control implementations. We formalize the usually desired requirements (serializability, abort-safety, deadlock-safety, and opacity) as well as stronger versions of these properties that enable composition. We show how to compose protocols satisfying these properties so that the resulting combined protocol also satisfies these properties. Our approach generalizes well-known protocols (such as two-phase-locking and two-phase-commit) and leads to new protocols. We apply this theory to show how we can safely compose optimistic and pessimistic concurrency control. For example, we show how we can execute a transaction that accesses two objects, one controlled by an STM and another by locking.

Tue 16 Jun
Times are displayed in time zone: Tijuana, Baja California change

09:15 - 10:55: Concurrency IIResearch Papers at PLDI Main BLUE (Portland 254-255)
Chair(s): Suresh JagannathanPurdue University
09:15 - 09:40
Talk
Composing Concurrency Control
Research Papers
Ofri ZivTel Aviv University, Alex AikenStanford University, Guy Golan-GuetaYahoo Labs, G. RamalingamMicrosoft Research, Mooly SagivTel Aviv University
Media Attached
09:40 - 10:05
Talk
Dynamic Partial Order Reduction for Relaxed Memory Models
Research Papers
Naling ZhangVirginia Tech, Markus KusanoVirginia Tech, Chao WangVirginia Tech
Media Attached
10:05 - 10:30
Talk
Monitoring Refinement via Symbolic Reasoning
Research Papers
Michael Emmi, Constantin EneaLIAFA, Université Paris Diderot, Jad HamzaLIAFA, Université Paris Diderot
Media Attached
10:30 - 10:55
Talk
Preventing Glitches and Short Circuits in High-Level Self-Timed Chip Specifications
Research Papers
Stephen LongfieldCornell University, Brittany NkounkouCornell University, Rajit ManoharCornell University, Ross TateCornell University
Media Attached