DMCA
Semi-Sparse Flow-Sensitive Pointer Analysis (2009)
Cached
Download Links
| Venue: | POPL'09 |
| Citations: | 40 - 3 self |
BibTeX
@MISC{Hardekopf09semi-sparseflow-sensitive,
author = {Ben Hardekopf and et al.},
title = { Semi-Sparse Flow-Sensitive Pointer Analysis},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major axes of pointer analysis precision are flow-sensitivity and context-sensitivity, and while there has been significant recent progress regarding scalable context-sensitive pointer analysis, relatively little progress has been made in improving the scalability of flow-sensitive pointer analysis. This paper presents a new interprocedural, flow-sensitive pointer analysis algorithm that combines two ideas—semi-sparse analysis and a novel use of BDDs—that arise from a careful understanding of the unique challenges that face flow-sensitive pointer analysis. We evaluate our algorithm on 12 C benchmarks ranging from 11K to 474K lines of code. Our fastest algorithm is on average 197× faster and uses 4.6 × less memory than the state of the art, and it can analyze programs that are an order of magnitude larger than the previous state of the art.
Keyphrases
semi-sparse flow-sensitive pointer analysis flow-sensitive pointer analysis novel use flow-sensitive pointer analysis algorithm major ax scalable context-sensitive pointer analysis previous state many program analysis pointer analysis precision careful understanding pointer information pointer analysis unique challenge significant recent progress little progress idea semi-sparse analysis
