Ultra-fast aliasing analysis using CLA: a million lines of C code in a second (2001)
Cached
Download Links
- [www.cs.cmu.edu]
- [www.prolangs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 104 - 0 self |
BibTeX
@INPROCEEDINGS{Heintze01ultra-fastaliasing,
author = {Nevin Heintze},
title = {Ultra-fast aliasing analysis using CLA: a million lines of C code in a second},
booktitle = {},
year = {2001},
pages = {254--263}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe the design and implementation of a system for very fast points-to analysis. On code bases of about a million lines of unpreprocessed C code, our system performs eldbased Andersen-style points-to analysis in less than a second and uses less than 10MB of memory. Our tw o main contributions are a database-centric analysis architecture called compile-link-analyze (CLA), and a new algorithm for implementing dynamic transitive closure. Our points-to analysis system is built into a forward data-dependence analysis tool that is deployed within Lucent to help with consistent type modi cations to large legacy C code bases. 1.
