Dynamic Race Prediction in Linear Time
Writing reliable concurrent software remains a huge challenge for today’s programmers. Programmers rarely reason about their code by explicitly considering different possible interleavings of its execution. We consider the problem of detecting data races from individual executions in a sound manner. The classical approach to solving this problem has been to use Lamport’s happens-before (HB) relation. Until now HB remains the only approach that runs in linear time. Previous efforts in improving over HB such as causally-precedes (CP) and maximal causal models fall short due to the fact they are not implementable efficiently and hence have to compromise on their race detecting ability by limiting their techniques to bounded sized fragments of the execution. We present a new relation weak-causally-precedes (WCP) that is provably better than CP in terms of being able to detect more races. WCP is also sound. Moreover it admits a linear time algorithm which works on the entire execution without having to fragment it.
Mon 19 Jun Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|14:00 - 14:25|
|14:25 - 14:50|
|14:50 - 15:15|
Dileep KiniUniversity of Illinois at Urbana-Champaign, Umang MathurUniversity of Illinois at Urbana-Champaign, Mahesh ViswanathanUniversity of Illinois at Urbana-ChampaignMedia Attached
|15:15 - 15:40|