On the Efficiency Comparison of Dynamic Program Slicing Algorithm for Software Testing


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 9, pp. 2323-2333, Sep. 1998
10.3745/KIPSTE.1998.5.9.2323,   PDF Download:

Abstract

Software engineers generally analyze the program behavior under the test-case revealed the error, not under any generic test-case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The efficiency of this algorithm is evaluated on some developed programs. Results are shown by a marking table of execution history, Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph. Consequently, the efficiency of the proposed algorithm is also presented by the comparison with algorithm that was announced previously.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
P. S. Hyung and P. M. Gon, "On the Efficiency Comparison of Dynamic Program Slicing Algorithm for Software Testing," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 9, pp. 2323-2333, 1998. DOI: 10.3745/KIPSTE.1998.5.9.2323.

[ACM Style]
Park Soon Hyung and Park Man Gon. 1998. On the Efficiency Comparison of Dynamic Program Slicing Algorithm for Software Testing. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 9, (1998), 2323-2333. DOI: 10.3745/KIPSTE.1998.5.9.2323.