Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.