On Slicing Programs with Jump Statements

Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump statements. Two similar algorithms were proposed recently to alleviate this problem. Both require the owgraph and the program dependence graph of the program to be modi ed. In this paper, we propose an alternative algorithm that leaves these graphs intact and uses a separate graph to store the additional required information. We also show that this algorithm permits an extremely e cient, conservative adaptation for use with programs that contain only structured" jump statements.

• Type: Conference
• Year: 1994
• Where: PLDI
• Authors: Hiralal Agrawal
• Keywords: Explicit Jump Statements, Jump Statements, PLDI 1994, Programming Languages, Traditional Slicing Algorithms