Program slicing
Mark Weiser · 1981
Program slicing is a method used by experienced computer programmers for abstracting from programs. 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 faithfully represent the original program within the domain of the specified subset of behavior.Finding a slice is in general unsolvable. A dataflow algorithm is presented for approximating slices when the behavior subset is specified as the values of a set of variables at a statement. Experimental evidence is presented that these slices are used by programmers during debugging. Experience with two automatic slicing tools is summarized. New measures of program complexity are suggested based on the organization of a program's slices.
Cited by 695 works. doi:10.5555/800078.802557
Authors
References
- On the criteria to be used in decomposing systems into modules
- A Complexity Measure
- Flow Analysis of Computer Programs
- Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
- Elements of software science (Operating and programming systems series)
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Specification techniques for data abstractions
- Certification of programs for secure information flow
- Data Flow Analysis in Software Reliability
- A fast algorithm for finding dominators in a flowgraph