Kim Tae Hee, Kim Byung Ki

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 11, pp. 2874-2883, Nov. 1998
10.3745/KIPSTE.1998.5.11.2874,   PDF Download:

Abstract

Program slicing is a method that supports software developer or maintainer to readily understand the program by decomposing it into several slices. In this paper we propose a dynamic program slice extraction algorithm that extracts the smallest and accurate program slice using variable-variable relationships. In this algorithm, we first define a set of variables from the left variable and the right variables in each sentence. Then, the variable-variable relationships is defined for the sentence in the declaration part. When we defined the variable-variable relationships in the declaration part, the sentences with the left variable defined in the set are always included in the related set. On the other hand, if the variable in the set is a right variable, only the sentences that are related with the criterion variable are included in the related set after the sentences are compared and evaluated against other sentences. Proposed algorithms is found to extract accurate and executable dynamic slice when applied to C language. When searching for the related sentences, it also reduced the number of sentence comparisons up to 42% compared to existing methods. Reduction of the number of comparisons is marked as the number of criterion variables is increased and as the number of comparison variables that are not related with the criterion variable is increased.

Statistics
Cite this article