[pl-seminar] [Pl-seminar] Practice Talk for OOPSLA @ Thu. (Oct. 24th) 4pm in CS3331

[dongdong <dongdong@xxxxxxxxxxx>]

Hi all,

I am going to give a practice talk for OOPSLA on Thursday (Oct. 24th) at 
4pm in Room CS3331. It would be helpful to receive your questions and 
feedback on the talk.
Thanks,

Dongdong

---

Title: Efficient Concurrency-Bug Detection Across Inputs
Date: Oct. 24th at 4pm
Room: CS3331

This is a practice talk for OOPSLA 2013. The talk will be 20 minutes 
long with time for questions, feedback, and discussion after the talk.
In the multi-core era, it is critical to efficiently test multithreaded 
software and expose concurrency bugs before software release. Previous 
work has made significant progress in detecting and validating 
concurrency bugs under a given input. Unfortunately, software testing 
always faces large sets of test inputs, and existing techniques are 
still too expensive to be applied to every test input in practice.
In this paper, we use open-source software to study how existing 
concurrency-bug detection tools work for a set of inputs. The study 
shows that an interleaving pattern, such as a data race or an atomicity 
violation, can often be exposed by many inputs. Consequently, existing 
bug detectors would inevitably waste their bug detection effort to 
generate duplicate bug reports, when applied to a set of inputs.
Guided by the above study, we propose a coverage metric, Concurrent 
Function Pairs (CFP), to efficiently approximate how interleavings 
overlap across inputs. Using CFP, we have designed a new approach to 
detecting data races and atomicity-violation bugs for a set of inputs.
Our evaluation on open-source C/C++ applications shows that our 
CFP-guided approach can effectively accelerate concurrency-bug detection 
for a set of inputs by reducing redundant detection effort across 
inputs.