article · 1992

Abstractions for recursive pointer data structures

Laurie Hendren, Joseph Hummell, Alexandru Nicolau

Cited by 101Abstract and details only

Abstract

Even though impressive progress has been made in the area of optimizing and parallelizing programs with arrays, the application of similar techniques to programs with pointer data structures has remained difficult. In this paper we introduce a new approach that leads to improved analysis and transformation of programs with recursively-defined pointer data structures.We discuss how an abstract data structure description can improve program analysis by presenting an analysis approach that combines an alias analysis technique, path matrix, with information available from an ADDS declaration. Given this improved alias analysis technique, we provide a concrete example of applying a software pipelining transformation to loops involving pointer data structures.

Cite this paper

APA 7

Hendren, L., Hummell, J., & Nicolau, A. (1992). Abstractions for recursive pointer data structures. https://doi.org/10.1145/143095.143138

MLA 9

Hendren, Laurie, et al. “Abstractions for recursive pointer data structures.” 1992, pp. 249–60, https://doi.org/10.1145/143095.143138.

Chicago

Hendren, Laurie, Joseph Hummell, and Alexandru Nicolau. 1992. “Abstractions for recursive pointer data structures.” https://doi.org/10.1145/143095.143138.

Harvard

Hendren, L., Hummell, J. and Nicolau, A. (1992) ‘Abstractions for recursive pointer data structures’. Available at: https://doi.org/10.1145/143095.143138.

BibTeX

@article{hendren1992abstractions,
  title = {{Abstractions for recursive pointer data structures}},
  author = {Hendren, Laurie and Hummell, Joseph and Nicolau, Alexandru},
  pages = {249--260},
  year = {1992},
  doi = {10.1145/143095.143138}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.