Program Slicing

From MaRDI portal





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
(only showing first 100 items - show all)








This page was built for publication: Program Slicing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345745)