Program Slicing
Mark Weiser · IEEE Transactions on Software Engineering · 1984
Program slicing is a method for automatically decomposing programs by analyzing their data flow and control flow. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a ``slice,'' is an independent program guaranteed to represent faithfully the original program within the domain of the specified subset of behavior. Some properties of slices are presented. In particular, finding statement-minimal slices is in general unsolvable, but using data flow analysis is sufficient to find approximate slices. Potential applications include automatic slicing tools for debuggng and parallel processing of slices.
Cited by 3,204 works. doi:10.1109/tse.1984.5010248
Authors
References
- Program Slicing
- Abstraction mechanisms in CLU
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Programmers use slices when debugging
- Certification of programs for secure information flow
- An Introduction to the Construction and Verification of Alphard Programs
- A fast algorithm for finding dominators in a flowgraph
- A practical interprocedural data flow analysis algorithm
- Preliminary Ada reference manual
- Debugging Techniques in Large Systems