A simple framework to calculate the reaching definition of array references and its use in subscript array analysis

The property analysis of subscript arrays can be used to facilitate the aut omatic detection of parallelism in sparse/irregular programs that use indir ectly accessed arrays, In order for property analysis to work, array reachi ng definition information is needed. In this paper, we present a framework to efficiently calculate the array reaching definition. This method is desi gned to handle the common program patterns in real programs. We use some av ailable techniques as the building components, such as data dependence test s and array summary set representations and operations, Our method is more efficient as well as more flexible than the existing techniques. Copyright (C) 2000 John Wiley & Sons, Ltd.