Tue 6 Nov 2018 11:15 - 11:37 at Horizons 10-11 - Concurrency and Races Chair(s): Willem Visser

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 Nov
Times are displayed in time zone: Guadalajara, Mexico City, Monterrey change

10:30 - 12:00: Concurrency and RacesResearch Papers at Horizons 10-11
Chair(s): Willem VisserStellenbosch University
10:30 - 10:52
Research Papers
JieLu , Feng LiInstitute of Computing Technology at Chinese Academy of Sciences, China, Lian LiInstitute of Computing Technology at Chinese Academy of Sciences, China, Xiaobing FengICT CAS
10:52 - 11:15
Research Papers
Dongjie Chen, Yanyan JiangNanjing University, Chang XuNanjing University, Xiaoxing MaNanjing University, Jian LuNanjing University
11:15 - 11:37
Research Papers
Dileep KiniUniversity of Illinois at Urbana-Champaign, Umang MathurUniversity of Illinois at Urbana-Champaign, Mahesh ViswanathanUniversity of Illinois at Urbana-Champaign
11:37 - 12:00
Research Papers
Christoffer Quist AdamsenAarhus University, Anders MøllerAarhus University, Saba AlimadadiNortheastern University, Frank TipNortheastern University