Mon 15 Jun 2015 16:00 - 16:25 at PLDI Main BLUE (Portland 254-255) - Concurrency I Chair(s): Santosh Nagarakatte

Programming efficient asynchronous systems is challenging because it can often be hard to express the design declaratively, or to defend against interleaving-dependent bugs such as data races and other assertion violations. Previous work has only addressed these challenges individually, either by designing a new declarative language, or a new data race detection tool, or a new testing technique. We present P#, a language for high-reliability asynchronous programming co-designed with a static analysis and testing infrastructure. We describe our experience using P# to write several distributed protocols and port an industrial-scale system internal to Microsoft, showing that the supporting techniques, by leveraging the design of P#, are effective in finding bugs.

PLDI 2015 Artifact Evaluated Badge

Conference Day
Mon 15 Jun

Displayed time zone: Tijuana, Baja California change

16:00 - 17:40
Concurrency IResearch Papers at PLDI Main BLUE (Portland 254-255)
Chair(s): Santosh NagarakatteRutgers University
16:00
25m
Talk
Asynchronous Programming, Analysis and Testing with State Machines
Research Papers
Pantazis DeligiannisImperial College London, Alastair F. DonaldsonImperial College London, Jeroen Ketema, Akash LalMicrosoft Research India, Paul ThomsonImperial College London
Media Attached
16:25
25m
Talk
Stateless Model Checking Concurrent Programs with Maximal Causality Reduction
Research Papers
Jeff HuangTexas A&M University
Media Attached
16:50
25m
Talk
Synthesizing racy tests
Research Papers
Malavika SamakIndian Institute of Science, Bangalore, Murali Krishna RamanathanIndian Institute of Science, Bangalore, Suresh JagannathanPurdue University
Media Attached
17:15
25m
Talk
The Push/Pull model of transactions
Research Papers
Eric KoskinenIBM TJ Watson Research Center, Matthew ParkinsonMicrosoft Research, UK
Media Attached