Fuzzy Array Dataflow Analysis

Dataflow analyses track the definitions and uses of variable values and are useful for optimizing and parallelizing compilers. Such analyses compute, for every (array cell) value read in a right-hand-side expression, the very operation which produced it. These analyses, however, require quite stringent hypotheses on the input programs: the control flow should be known at compile-time (i.e., static), and array subscripts must be affine functions of surrounding counters and possibly of symbolic constants. In contrast, the analysis presented in this paper handles generalifs andwhileloops and general nonaffine array subscripts.