The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data Dependency Graphs for Ada Programs
IEEE Transactions on Software Engineering
Context-dependent flow-sensitive interprocedural dataflow analysis
Journal of Software Maintenance: Research and Practice
Slicing object-oriented java programs
ACM SIGPLAN Notices
Slicing concurrent java programs
ACM SIGPLAN Notices
Dependence Analysis of Parallel and Distributed Programs and Its Applications
APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
An Approach to Analyzing Dependency of Concurrent Programs
APAQS '00 Proceedings of the The First Asia-Pacific Conference on Quality Software (APAQS'00)
Slicing Objects Using System Dependence Graphs
ICSM '98 Proceedings of the International Conference on Software Maintenance
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
An approach to analyzing recursive programs with exception handling constructs
ACM SIGPLAN Notices
| Hi-index | 0.00 |
Dependence analysis is an important approach to analyzing, understanding, testing and maintaining programs. This paper develops a new kind of dependence analysis method for recursive Java programs. In our method, the program dependence graph (PDG) of a Java program consists of a set of PDGs that are not connected. They interact with each other by dependences among parameters. Thus, he inter-function dependence analysis is transformed to intra-function dependence analysis. Based on this model, we develop a new approach to analyze dependences of a direct or indirect recursive Java program by simulating its execution.