How to analyze large programs efficiently and informatively
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
A variation of Knoop, Rüthing, and Steffen's Lazy Code Motion
ACM SIGPLAN Notices
Complexity of bi-directional data flow analysis
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An elimination algorithm for bidirectional data flow problems using edge placement
ACM Transactions on Programming Languages and Systems (TOPLAS)
GIVE-N-TAKE—a balanced code placement framework
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Optimal code motion: theory and practice
ACM Transactions on Programming Languages and Systems (TOPLAS)
A generalized theory of bit vector data flow analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
The power of assignment motion
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Practical adaption of the global optimization algorithm of Morel and Renvoise
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial redundancy elimination in SSA form
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A balanced code placement framework
ACM Transactions on Programming Languages and Systems (TOPLAS)
E-path_PRE: partial redundancy elimination made easy
ACM SIGPLAN Notices
Partial redundancy elimination is not bidirectional
ACM SIGPLAN Notices
Bidirectional data flow analysis: myths and reality
ACM SIGPLAN Notices
Bidirectional Data Flow Analysis in Code Motion: Myth and Reality
SAS '98 Proceedings of the 5th International Symposium on Static Analysis
Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm
Science of Computer Programming
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Optimal interprocedural program optimization: a new framework and its application
Optimal interprocedural program optimization: a new framework and its application
Interacting code motion transformations: their impact and their complexity
Interacting code motion transformations: their impact and their complexity
A fresh look at PRE as a maximum flow problem
CC'06 Proceedings of the 15th international conference on Compiler Construction
Bidirectional data flow analysis for type inferencing
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
Code optimisation algorithms using bi-directional data flow dependencies have become increasingly important in recent years. The use of these algorithms faces two difficulties in practice: (a) Low profitabilities, and (b) high solution costs. This paper develops a new approach to the use of bi-directional dependencies using the concept of edge placement. This is shown to yield higher profitabilities of optimisation. An efficient solution method for such algorithms is also developed. The complexity of this method is shown to be bounded by O(e) operations, where e is the number of edges in the program flow graph. Ths is comparable to the complexity of uni-directional flow algorithms commonly used in optimisation.