A Prototype Tool for Slicing Concurrent Programs
Xiaofang Qi · Jisuanji kexue yu tansuo · 2012
Slicing is an important approach to analyzing and understanding concurrent programs. Based on the basic program information extracted with a program analyzing tool, CodeSurfer, this paper builds program reachability graph for multi-threaded programs with shared variables, then generates a novel dependence graph, which vertex is a 2-tuple composed of program state and statement, and implements a prototype tool for slicing concurrent programs. Preliminary experimental results show that the intransitivity problem of dependence relations can be solved and more precise slices are obtained efficiently by the proposed approach in contrast to traditional slicing approaches.