Implementation and Experiments


The interprocedural symbolic analysis framework discussed in this book is implemented as the flow analysis scheme of Parafrase-2. Symbolic constant propagation, generalized induction expression recognition, symbolic global forward substitution, and detection of loop-invariant computations are fully implemented. All transformations and parallelization examples presented in this book, except those of Figures 6.4 and 6.5, are performed by the current version of Parafrase-2. Implementation of symbolic dependence analysis, generalized strength reduction, and symbolic timing analysis is underway. We plan to measure the effectiveness of compilation in our symbolic framework on all the codes of Perfect Benchmarks® when Parafrase-2’s symbolic dependence analysis scheme is fully implemented.


Versus Versus Versus Versus Versus Versus Versus Versus Versus Induction Variable Symbolic Analysis Multiple Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Kluwer Academic Publishers 1995

Personalised recommendations