Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A practical data flow framework for array reference analysis and its use in optimizations
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Journal of Parallel and Distributed Computing
Advanced compiler design and implementation
Advanced compiler design and implementation
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Array Dataflow Analysis for Explicitly Parallel Programs
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
The Interprocedural Coincidence Theorem
CC '92 Proceedings of the 4th International Conference on Compiler Construction
Basic-Block Graphs: Living Dinosaurs?
CC '98 Proceedings of the 7th International Conference on Compiler Construction
Instance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free Transductions
PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
Forward communication only placements and their use for parallel program construction
LCPC'02 Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing
| Hi-index | 0.00 |
This paper describes a precise reaching definition (RD) analysis tuned for arrays. RD analyses are of two kinds. The first group, Maximal Fixed Point (MFP) analyses, considers arrays as indivisible objects and does not contrast the side-effects of separate instances of writes. Its main benefit, however, is its wide applicability (e.g. to any unstructured program). On the other hand, analyses based on integer linear programming are able to pinpoint, for a given read instance, which instance of which write reference actually defined the read value. They are, however, restricted to limited classes of programs. Our analysis tries to take the best of both worlds by computing, in an iterated MFP framework, instancewise RDs of array elements.