Weiser, Mark Program slicing. (English) Zbl 0552.68004 IEEE Trans. Software Eng. 10, 352-357 (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 debugging and parallel processing of slices. Cited in 1 ReviewCited in 60 Documents MSC: 68Q60 Specification and verification (program logics, model checking, etc.) 68N25 Theory of operating systems Keywords:data flow analysis; debugging; parallel processing; Program slicing; control flow PDFBibTeX XMLCite \textit{M. Weiser}, IEEE Trans. Softw. Eng. 10, 352--357 (1984; Zbl 0552.68004) Full Text: DOI