Affiliation:
1. Washington Univ. in St. Louis, MD
2. Univ. of California at San Diego, La Jolla
Abstract
Recently, Static Single-Assignment Form and Sparse Evaluation Graphs have been advanced for the efficient solution of program optimization problems. Each method is provided with an initial set of flow graph nodes that inherently affect a problem's solution. Other relevant nodes are those where potentially disparate solutions must combine. Previously, these so-called φ-nodes were found by computing the iterated dominance frontiers of the initial set of nodes, a process that could take worst-case quadratic time with respect to the input flow graph. In this article we present an almost-linear algorithm for determining exactly the same set of φ-nodes.
Publisher
Association for Computing Machinery (ACM)
Reference17 articles.
1. Ago A. I-IopcROI~T .} ~ AND ULLMAN: ._}{. 1974. The Design and Analys~s of Computer Algorzthms. Addison-Wesley Reading Mass. Ago A. I-IopcROI~T .} ~ AND ULLMAN: ._}{. 1974. The Design and Analys~s of Computer Algorzthms. Addison-Wesley Reading Mass.
2. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A sparse evaluation technique for detailed semantic analyses;Computer Languages, Systems & Structures;2014-10
2. Global Sparse Analysis Framework;ACM Transactions on Programming Languages and Systems;2014-09-25
3. Design and implementation of sparse global analyses for C-like languages;ACM SIGPLAN Notices;2012-08-06
4. Design and implementation of sparse global analyses for C-like languages;Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation;2012-06-11
5. Semi-sparse flow-sensitive pointer analysis;ACM SIGPLAN Notices;2009-01-21