PROGRAM SLICING
PROGRAM SLICING
复制标题
DOI:
10.1109/tse.1984.5010248
复制
发表时间:
1984-01-01
影响因子:
7.4
通讯作者:
WEISER, M
中科院分区:
文献类型:
--
作者:
WEISER, M
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.