A Slicing Algorithm Suitable for Program Modification

Tsuyoshi OHTA; Takashi WATANABE; Tadanori MIZUNO

A Slicing Algorithm Suitable for Program Modification

Tsuyoshi OHTA, Takashi WATANABE, Tadanori MIZUNO

Full Text Views

0

Share
Cite this

Summary :

A program slice is a set of program statements that directly or indirectly contribute to the values assumed by a set of variables at some program execution point. A few slicing algorithms have proposed to far but none of them are considered from the viewpoint of program modification. In this paper, we define a variable dependence graph (VDG) and show a new slicing algorithm on VDG. We also compare the time complexity of the algorithm with that of other existing algorithms and discuss the suitableness of our algorithm for program modification. As the result of this, we argue our algorithm is suitable for embedding debugging systems.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.4 pp.540-546

Publication Date: 1996/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Tsuyoshi OHTA, Takashi WATANABE, Tadanori MIZUNO, "A Slicing Algorithm Suitable for Program Modification" in IEICE TRANSACTIONS on Fundamentals, vol. E79-A, no. 4, pp. 540-546, April 1996, doi: .
Abstract: A program slice is a set of program statements that directly or indirectly contribute to the values assumed by a set of variables at some program execution point. A few slicing algorithms have proposed to far but none of them are considered from the viewpoint of program modification. In this paper, we define a variable dependence graph (VDG) and show a new slicing algorithm on VDG. We also compare the time complexity of the algorithm with that of other existing algorithms and discuss the suitableness of our algorithm for program modification. As the result of this, we argue our algorithm is suitable for embedding debugging systems.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e79-a_4_540/_p

Copy

@ARTICLE{e79-a_4_540,
author={Tsuyoshi OHTA, Takashi WATANABE, Tadanori MIZUNO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Slicing Algorithm Suitable for Program Modification},
year={1996},
volume={E79-A},
number={4},
pages={540-546},
abstract={A program slice is a set of program statements that directly or indirectly contribute to the values assumed by a set of variables at some program execution point. A few slicing algorithms have proposed to far but none of them are considered from the viewpoint of program modification. In this paper, we define a variable dependence graph (VDG) and show a new slicing algorithm on VDG. We also compare the time complexity of the algorithm with that of other existing algorithms and discuss the suitableness of our algorithm for program modification. As the result of this, we argue our algorithm is suitable for embedding debugging systems.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - A Slicing Algorithm Suitable for Program Modification
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 540
EP - 546
AU - Tsuyoshi OHTA
AU - Takashi WATANABE
AU - Tadanori MIZUNO
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1996
AB - A program slice is a set of program statements that directly or indirectly contribute to the values assumed by a set of variables at some program execution point. A few slicing algorithms have proposed to far but none of them are considered from the viewpoint of program modification. In this paper, we define a variable dependence graph (VDG) and show a new slicing algorithm on VDG. We also compare the time complexity of the algorithm with that of other existing algorithms and discuss the suitableness of our algorithm for program modification. As the result of this, we argue our algorithm is suitable for embedding debugging systems.
ER -