A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
An efficient interprocedural dynamic slicing method
Journal of Systems and Software
A formalisation of the relationship between forms of program slicing
Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
Empirical study of optimization techniques for massive slicing
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Program slicing can be used as a support for programcomprehension, because it allows a large program to be dividedup into smaller slices, each of which can be understoodin isolation from the rest. As such, slicing facilitatesthe familiar approach of 'divide and conquer'.Union slicing (the union of dynamic slices) is a usefultechnique for approximating a precise static slice. For programcomprehension (and many other applications) it is oftenimportant that the union slice be an executable program,rather than merely a collection of statements which are relevantto the slicing criterion.This paper presents an algorithm for computing executableunion slices, using conditioned slicing. A case studyis used to illustrate the algorithm and how the executableunion slice is preferable to the (possibly non executable)union slice. The paper also shows, briefly, that the approachhas wider applications than comprehension.