Constructing CDG for program with transfer statements

Authors:
Zhe Han;Shihong Chen
Affiliations:
School of Computer, Wuhan University, Wuhan;School of Computer, Wuhan University, Wuhan
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Year:
2010

Citing 7
Cited 0

Dynamic program slicing

Information Processing Letters
Interprocedural slicing using dependence graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Slicing object-oriented software

Proceedings of the 18th international conference on Software engineering
Programmers use slices when debugging

Communications of the ACM
The program dependence graph in a software development environment

SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Distributed dynamic slicing of Java programs

Journal of Systems and Software
Computing dynamic slices of concurrent object-oriented programs

Information and Software Technology

Quantified Score

Hi-index	0.03

Visualization

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.