Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting (1994)
| Citations: | 211 - 0 self |
BibTeX
@INPROCEEDINGS{Deutsch94interproceduralmay-alias,
author = {Alain Deutsch},
title = {Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting},
booktitle = {},
year = {1994},
pages = {230--241},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: k-limiting, which blurs distinction between sub-objects below depth k; and store-based (or equivalently location or regionbased) approximations, which blur distinction between elements of recursive data structures. Although notable progress in interprocedural alias analysis has been recently accomplished, very little progress in the precision of analysis of recursive pointer data structures has been seen since the inception of these approximation techniques by Jones and Muchnick a decade ago. As a result, optimizing, verifying and parallelizing programs with pointers has remained difficult. We present a new parametric framework for analyzing recursive pointer data structures which can express a new natural class of alias information not accessib...
