A new dependence test based on shape analysis for pointer-based codes

  • Authors:

  • A. Navarro;F. Corbera;R. Asenjo;A. Tineo;O. Plata;E. L. Zapata

  • Affiliations:

  • Dpt. of Computer Architecture, University of Málaga, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Málaga, Spain

  • Venue:
  • LCPC'04 Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The approach presented in this paper focus on detecting data dependences induced by heap-directed pointers on loops that access dynamic data structures. Knowledge about the shape of the data structure accessible from a heap-directed pointer, provides critical information for disambiguating heap accesses originating from it. Our approach is based on a previously developed shape analysis that maintains topological information of the connections among the different nodes (memory locations) in the data structure. Basically, the novelty is that our approach carries out abstract interpretation of the statements being analyzed, and let us annotate the memory locations reached by each statement with read/write information. This information will be later used in order to find dependences in a very accurate dependence test which we introduce in this paper.