Deriving Pre-conditions for Array Bound Check Elimination

Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant checks. Our approach combines a forward analysis to infer precise contextual constraint at designated program points, and a backward method for deriving a safety pre-condition for each bound check. Both analyses are formulated with the help of a practical constraint solver based on Presburger formulae; resulting in an accurate and fully automatable optimization. The derived pre-conditions are also used to guide bound check specialization, for the purpose of eliminating partially redundant checks.

• Type: Conference
• Year: 2001
• Where: PADO
• Authors: Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu
• Keywords: Bound Check, Bound Check Optimization, PADO 2001, Programming Languages, Redundant Checks