Uncertainty Problem in Dynamic Slicing of Concurrent Programs

Although both static and dynamic slicing of sequential programs have been applied to software engineering practices, there still arc, some challenges, problems, and issues in slicing concurrent programs, in particular, dynamic slicing of concurrent programs. This paper presents a methodological review of dynamic slicing methods for concurrent programs, points out that the most intrinsic problem in all existing dynamic slicing methods is the uncertainty problem, and shows a new research direction for dynamic slicing of concurrent programs. The paper proposes two basic criteria, i.e., completeness and soundness, for dynamic slicing of concurrent programs, and shows that we should develop a dependence/influence analysis method based on self-measurement principle to obtain complete and sound dynamic slices of concurrent programs.