The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental data-flow analysis algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Applicable Family of Data Flow Testing Criteria
IEEE Transactions on Software Engineering
The program summary graph and flow-sensitive interprocedual data flow analysis
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
An overview of the PTRAN analysis system for multiprocessing
Proceedings of the 1st International Conference on Supercomputing
Fast interprocedual alias analysis
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Incremental Version of Iterative Data Flow Analysis
IEEE Transactions on Software Engineering
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A shape matching approach for scheduling fine-grained parallelism
MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
A tool for data flow oriented program testing
Proceedings of the second conference on Software development tools, techniques, and alternatives
Efficient computation of flow insensitive interprocedural summary information
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Selecting and Using Data for Integration Testing
IEEE Software
A Fine-Grained Approach to Scheduling Asynchronous Multiprocessors
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
An evaluation of required element testing strategies
ICSE '84 Proceedings of the 7th international conference on Software engineering
An approach to incremental testing
An approach to incremental testing
Efficient construction of program dependence graphs
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
An extensible program representation for object-oriented software
ACM SIGPLAN Notices
An Extensible System for Source Code Analysis
IEEE Transactions on Software Engineering
Software restructuring: implementing a code abstraction transformation
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
| Hi-index | 0.00 |
Unified interprocedural graph (UIG) that extracts the important features of existing program representations and adds new information to provide an integrated representation for maintenance tasks is presented. Algorithms that were developed for previous representations are adapted to use the UIG by identifying the subset of nodes and edges in the UIG required for that computation. Newly developed algorithms can use the UIG since it contains data flow, control flow, data dependence, and control dependence information. The main benefits of this approach are the reduction in storage space since individual representations are not kept, the savings in maintenance time of a single representation over the individual representations, and the convenience of accessing a single program representation without increase in access time. A single program representation also assists in program understanding since relationships among program elements are incorporated into one graph.