Algorithm for Control Dependence Subgraph Construction

Program slicing provides a new way to software maintenance, program understanding. It can give the programmer the statements only relevant to the computation of a given function. It can transform a large program into a smaller one. In this paper, we present a new algorithm to produce Control Dependence SubGraph which is used in Program slicing. The Control Dependence SubGraph is used to collect the control dependence of the statements. The Data Dependence Subgraph is used to collect the data dependence of the statements. With these two subgraphs we can construct the Program Dependence Graph and compute the program slice through traversing the Program Dependence Graph. The algorithm uses an input called F(p) which models each program in the form of an algebraic expression.