Interprocedural Symbolic Range Propagation for Optimizing Compilers

Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algorithm contrasts with related work on interprocedural value range analysis in that it extends the ability to handle symbolic range expressions. It builds on our previous work of intraprocedural symbolic range analysis. We have evaluated our algorithm using 11 Perfect Benchmarks and 10 SPEC floating-point benchmarks of the CPU 95 and CPU 2000 suites. We have measured the ability to perform test elision, dead code elimination, and detect data dependences. We have also evaluated the algorithm’s ability to help detect zero-trip loops for induction variable substitution and subscript ranges for array reductions.

• Type: Conference
• Year: 2005
• Where: LCPC
• Authors: Hansang Bae, Rudolf Eigenmann
• Keywords: Algorithm, LCPC 2005, Symbolic Range, Value Range