| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 91 ===
Program slicing is a technique of nding the statements that a ect the speci c
variables in a speci c point of a program. It can help programmer understand
complicated code. The original concept of program slicing may trace back to the
notation introduced by Weiser [WM79, WM81, WM84]. They de ne program
slicing as the solution to data-
ow problem using a control
ow graph as an
intermediate representation. Then Ottenstein K. and Ottenstein L. provide a
method based on dependence graph [OO84, RY88].
Instead of using dependence graph, we propose a semantic method of pro-
gram slicing using abstract interpretation in the thesis. Our approach ana-
lyzes a program based on the de ne-use attributes and the indirectly relevant
attributes of the values in the program. We develop augmented semantic func-
tions for computing these attributes and extracting program slices.
|
|---|
