On interleaving space exploration of multi-threaded programs  

作　　者：Dongjie CHEN Yanyan JIANG Chang XU Xiaoxing MA 

机构地区：[1]State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210023,China [2]Department of Computer Science and Technology,Nanjing University,Nanjing 210023,China

出　　处：《Frontiers of Computer Science》2021年第4期17-28,共12页中国计算机科学前沿（英文版）

基　　金：This work was supported in part by National Key R&D Program(2017YFB1001801)of China;the National Natural Science Foundation of China(Grant Nos.61932021,61690204,61802165).

摘　　要：Exploring the interleaving space of a multithreaded program to efficiently detect concurrency bugs is important but also difficult because of the astronomically many thread schedules.This paper presents a novel framework to decompose a thread schedule generator that explores the interleaving space into the composition of a basic generator and its extension under the“small interleaving hypothesis”.Under this framework,we in-depth analyzed research work on interleaving space exploration,illustrated how to design an effective schedule generator,and shed light on future research opportunities.

关 键 词：SURVEY TESTING concurrency bugs interleaving space 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]