Constructing CDG for program with transfer statements

Program Slicing is a basic technique on Program analysis and converse engineering. The Control Dependence Graph is the basic representation of the source code in Program Slicing. From CDG you can do analysis on control flow. In this paper we present algorithms for constructing Control Dependence Graph for programs with transfer statements. We study on the follow region that is caused by the transfer statements and bring up a method which constructs CDG by using and maintaining the virtual nodes stack. From the method you can do control dependence analysis on program with multiple nesting transfer statements.