Sign in
A safe approximate algorithm for interprocedural pointer aliasing
Technical documentation   Open access

A safe approximate algorithm for interprocedural pointer aliasing

William Landi and Barbara G. Ryder
Rutgers University
1991
DOI:
https://doi.org/10.7282/t3-fxm3-5847

Abstract

Aliasing occurs at some program point during execution when two or more names exist for the same location. In a language which allows pointers, the problem of determining the set of pairs of names at a program point which may refer to the same location during program execution is NP-hard. We present an algorithm which safely approximates Interprocedural May Alias in the presence of pointers. This algorithm has been implemented in a prototype analysis tool for C programs.
pdf
lcsr-tr-168386.37 kBDownloadView
Author's Original (AO) Open Access

Metrics

52 File downloads
45 Record Views

Details