Linear-time subtransitive control flow analysis (1997) [41 citations — 1 self]
Download:
|
|
by Nevin Heintze, David Mcallester
In Proceedings of ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation
http://www.cs.cmu.edu/afs/cs/user/nch/ftp/linear-cfa.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Heintze97linear-timesubtransitive,author = {Nevin Heintze and David Mcallester},
title = {Linear-time subtransitive control flow analysis},
booktitle = {In Proceedings of ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation},
year = {1997},
pages = {261--272}
}
Years of Citing Articles
Abstract:
We present a linear-time algorithm for boundedtype programs that builds a directed graph whose transitive closure gives exactly the results of the standard (cubic-time) Control-Flow Analysis (CFA) algorithm. Our algorithm can be used to list all functions calls from all call sites in (optimal) quadratic time. More importantly, it can be used to give linear-time algorithms for CFAconsuming applications such as: ffl effects analysis: find the side-effecting expressions in a program. ffl k-limited CFA: for each call-site, list the functions if there are only a few of them ( k) and otherwise output "many". ffl called-once analysis: identify all functions called from only one call-site. 1
