A new framework for exhaustive and incremental data flow analysis using DJ graphs

Authors:
Vugranam C. Sreedhar;Guang R. Gao;Yong-Fong Lee
Affiliations:
Hewlett-Packard Company, Cupertino, CA;McGill University Montreal, PQ H2X 1W7;Intel Corporation, Santa Clara, CA
Venue:
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Year:
1996

Citing 20
Cited 11

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Elimination algorithms for data flow analysis

ACM Computing Surveys (CSUR)
Incremental data-flow analysis algorithms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental data flow analysis via dominator and attribute update

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient hybrid algorithm for incremental data flow analysis

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Properties of data flow frameworks: a unified model

Acta Informatica
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A linear time algorithm for placing &phgr;-nodes

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental computation of dominator trees

IR '95 Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations
Efficient program analysis using DJ graphs

Efficient program analysis using DJ graphs
A Fast and Usually Linear Algorithm for Global Flow Analysis

Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems

Journal of the ACM (JACM)
A program data flow analysis procedure

Communications of the ACM
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow Analysis of Computer Programs

Flow Analysis of Computer Programs
Optimal-time incremental semantic analysis for syntax-directed editors

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Data flow update via dominator and attribute updates

Data flow update via dominator and attribute updates
Data-flow analysis and incremental iteration

Data-flow analysis and incremental iteration

Identifying loops using DJ graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental computation of dominator trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Making graphs reducible with controlled node splitting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Composing dataflow analyses and transformations

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handling irreducible loops: optimized node splitting versus DJ-graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic common sub-expression elimination during scheduling in high-level synthesis

Proceedings of the 15th international symposium on System Synthesis
Bidirectional data flow analysis: myths and reality

ACM SIGPLAN Notices
A framework for incremental extensible compiler construction

ICS '03 Proceedings of the 17th annual international conference on Supercomputing
SPARK: A High-Lev l Synthesis Framework For Applying Parallelizing Compiler Transformations

VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Coordinated parallelizing compiler optimizations and high-level synthesis

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A framework for incremental extensible compiler construction

International Journal of Parallel Programming - Special issue II: The 17th annual international conference on supercomputing (ICS'03)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new elimination-based framework for exhaustive and incremental data flow analysis using the DJ graph representation of a program. Unlike the previous approaches to elimination-based incremental data flow analysis, our approach can handle arbitrary non-structural and structural changes to program flowgraphs, including those causing irreducibility. We show how our approach is related to (iterated) dominance frontiers, and exploit this relationship to establish the complexity of our exhaustive analysis and to aid the design of our incremental analysis.