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

A multithreaded program's interleaving space is discrete and astronomically large, making effectively sampling thread schedules for manifesting concurrency bugs a challenging task. Observing that concurrency bugs can be manifested by adjusting thread relative speeds, this paper presents the new concept of speed space in which each vector denotes a family of thread schedules. A multithreaded program's speed space is approximately continuous, easy-to-sample, and preserves certain categories of concurrency bugs. We discuss the design, implementation, and evaluation of our speed-controlled scheduler for exploring adversarial/abnormal schedules. The experimental results confirm that our technique is effective in sampling diverse schedules. Our implementation also found previously unknown concurrency bugs in real-world multithreaded programs.

Tue 6 Nov
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

10:30 - 12:00: Research Papers - Concurrency and Races at Horizons 10-11
Chair(s): Willem VisserStellenbosch University
fse-2018-research-papers10:30 - 10:52
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
fse-2018-research-papers10:52 - 11:15
Dongjie Chen, Yanyan JiangNanjing University, Chang XuNanjing University, Xiaoxing MaNanjing University, Jian LuNanjing University
fse-2018-research-papers11:15 - 11:37
Dileep KiniUniversity of Illinois at Urbana-Champaign, Umang MathurUniversity of Illinois at Urbana-Champaign, Mahesh ViswanathanUniversity of Illinois at Urbana-Champaign
fse-2018-research-papers11:37 - 12:00
Christoffer Quist AdamsenAarhus University, Anders MøllerAarhus University, Saba AlimadadiNortheastern University, Frank TipNortheastern University