Efficient Computation of Fixpoints that Arise in Complex Program Analysis
Cached
Download Links
- [ropas.kaist.ac.kr]
- [polaris.cs.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 4 - 2 self |
BibTeX
@MISC{Chen_efficientcomputation,
author = {Li-ling Chen and Williams Ludwell Harrison III and Kwangkeun Yi},
title = {Efficient Computation of Fixpoints that Arise in Complex Program Analysis},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper proposes a model for studying the computation of fixpoints that arise in complex program analysis based on abstract interpretation, and presents an efficient algorithm for computing fixpoints based on the model. Abstract interpretation provides a unified framework for handling interprocedural analysis of programs with unrestricted pointer manipulation, higher-order functions, and continuations. In the general case, the structure of the fixpoint computation is not known before analysis; that is, the flow graph cannot be determined from the syntax of a program. Abstract interpretation handles this situation easily. In our algorithm, the entailment graph, representing the structure of the fixpoint computation, is developed during analysis. The strategies for determining the evaluation order, which underlie the algorithm, are described. Based on the strategies, local knowledge of the entailment graph at each node is exploited to determine dynamically an effective order of evalu...
