Work

Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs

Year: 1992

Type: conference-abstract

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.

Source: ACM SIGPLAN Notices

DOI: 10.1145/143103.143138

Authors: Laurie J. Hendren, Joseph Hummell, Alexandru Nicolau

Institution: McGill University

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Natural Sciences and Engineering Research Council of Canada

Award: A Support Environment for Parallel-Program Development

OpenAlex ID: W3006546696

Cites: 19

Cited by: 9

Related to: 10