A Novel Algorithm for Construction Control Dependence Subgraph

Program slicing is used to program analysis and reverse engineering. It can give the programmer the statements only relevant to the computation of a given function. Traversal across the program dependence graph is a basic way to compute the program slice. In this paper, we present a new algorithm to produce control dependence subgraph (CDS) which is the component of program dependence graph. The algorithm uses an input called F(p) which models each program in the form of an algebraic expression. We do the deeply study on issues called follow region resulted by structured transfers statements and develop a tool to draw the CDS automatically.