A Precise Fixpoint Reaching Definition Analysis for Arrays

摘要: This paper describes a precise reaching definition (RD) analysis tuned for arrays. RD analyses are of two kinds. The first group, Maximal Fixed Point (MFP) analyses, considers arrays as indivisible objects and does not contrast the side-effects separate instances writes. Its main benefit, however, is its wide applicability (e.g. to any unstructured program). On other hand, based on integer linear programming able pinpoint, given read instance, which instance write reference actually defined value. They are, restricted limited classes programs. Our tries take best both worlds by computing, in an iterated MFP framework, instancewise RDs array elements.