Program slicing in understanding of large programs
被引:24
作者:
Korel, B
论文数: 0引用数: 0
h-index: 0
机构:
IIT, Dept Comp Sci, Chicago, IL 60616 USAIIT, Dept Comp Sci, Chicago, IL 60616 USA
Korel, B
[1
]
Rilling, J
论文数: 0引用数: 0
h-index: 0
机构:
IIT, Dept Comp Sci, Chicago, IL 60616 USAIIT, Dept Comp Sci, Chicago, IL 60616 USA
Rilling, J
[1
]
机构:
[1] IIT, Dept Comp Sci, Chicago, IL 60616 USA
来源:
6TH INTERNATIONAL WORKSHOP ON PROGRAM COMPREHENSION (IWPC 98) - PROCEEDINGS
|
1998年
关键词:
D O I:
10.1109/WPC.1998.693339
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
Program slicing transforms a large program into a smaller one that contains only statements relevant to the computation of a given function. It has been shown that program slicing can be useful in program understanding. Traditionally, program slices are represented in the textual form. Although slicing does narrow the size of the program, the textual representation of a slice does not provide much guidance in the understanding of large programs. In this paper,ve present program slicing concepts on the module level that allow for better understanding of program slices of large programs and their executions. These concepts have been developed for static and dynamic program slicing and are combined with different methods of visualization to guide programmers in the process of program understanding. The presented concepts have been implemented in the slicing tool that is used to investigate the usefulness of these concepts in the process of understanding of large programs.