Nonuniform Alias Analysis of Recursive Data Structures and Arrays (2002)
| Venue: | In Proceedings of the 9th International Symposium on Static Analysis SAS’02 |
| Citations: | 18 - 4 self |
BibTeX
@INPROCEEDINGS{Venet02nonuniformalias,
author = {Arnaud Venet},
title = {Nonuniform Alias Analysis of Recursive Data Structures and Arrays},
booktitle = {In Proceedings of the 9th International Symposium on Static Analysis SAS’02},
year = {2002},
pages = {36--51},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present an alias analysis which is able to infer position-dependent equality relationships between pointers in recursively de ned data structures or arrays. Our work is based on a semantic model of the execution of a program in which every allocated object is identi ed by a timestamp which represents the state of the program at the instant of the object creation. We provide a simple numerical abstraction of timestamps which is accurate enough to distinguish between elements of arrays or list-like structures. We follow the methodology of Abstract Interpretation to derive a sound approximation of the program semantics from this abstraction. The computability of our analysis is then guaranteed by using an abstract numerical lattice to represent relations between timestamps.
