We consider the problem of detecting data races in program traces that
have been compressed using straight line programs (SLP), which are
special context-free grammars that generate exactly one string, namely
the trace that they represent. We consider two classical approaches to
race detection — using the happens-before relation and the lockset
discipline. We present algorithms for both these methods that run in
time that is linear in the size of the compressed, SLP representation.
Typical program executions almost always exhibit patterns that
lead to significant compression. Thus, our algorithms are expected to
result in large speedups when compared with analyzing the uncompressed
trace. Our experimental evaluation of these new algorithms on
standard benchmarks confirms this observation.
Tue 6 NovDisplayed time zone: Guadalajara, Mexico City, Monterrey change
10:30 - 12:00 | Concurrency and RacesResearch Papers at Horizons 10-11 Chair(s): Willem Visser Stellenbosch University | ||
10:30 22mTalk | CloudRaid: Hunting Concurrency Bugs in the Cloud via Log-Mining Research Papers Jie Lu , Feng Li Institute of Computing Technology at Chinese Academy of Sciences, China, Lian Li Institute of Computing Technology at Chinese Academy of Sciences, China, Xiaobing Feng ICT CAS | ||
10:52 22mTalk | Testing Multithreaded Programs via Thread Speed Control Research Papers Dongjie Chen , Yanyan Jiang Nanjing University, Chang Xu Nanjing University, Xiaoxing Ma Nanjing University, Jian Lu Nanjing University | ||
11:15 22mTalk | Data Race Detection on Compressed Traces Research Papers Dileep Kini University of Illinois at Urbana-Champaign, Umang Mathur University of Illinois at Urbana-Champaign, Mahesh Viswanathan University of Illinois at Urbana-Champaign | ||
11:37 22mTalk | Practical AJAX Race Detection for JavaScript Web Applications Research Papers Christoffer Quist Adamsen Aarhus University, Anders Møller Aarhus University, Saba Alimadadi Northeastern University, Frank Tip Northeastern University | ||