Incremental Algorithms and Empirical Comparison for Flow- and Context-sensitive Pointer Aliasing Analysis (1998)
| Venue: | In Proceedings of the 21st International conference on Software Engineering |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Yur98incrementalalgorithms,
author = {Jyh-Shiarn Yur and Barbara G. Ryder and William A. Landi},
title = {Incremental Algorithms and Empirical Comparison for Flow- and Context-sensitive Pointer Aliasing Analysis},
booktitle = {In Proceedings of the 21st International conference on Software Engineering},
year = {1998}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Pointer aliasing analysis is used to determine if two object names containing dereferences and/or field selectors, (e.g., *p,q->t), may refer to the same location during execution. Such information is necessary for applications such as data-flow-based testers, program understanding tools, and debuggers, but is expensive to calculate with acceptable precision. Incremental algorithms update data flow information after a program change rather than recomputing it from scratch, with the belief that the change impact will be limited. Two versions of a practical incremental pointer aliasing algorithm have been developed, based on Landi-Ryder flow- and context-sensitive alias analysis. Empirical results attest to the time savings over exhaustive analysis (a six-fold speedup on average), and the precision of the approximate solution obtained (on average same solution as exhaustive algorithm for 75% of the tests.)
