Michael Burke. An interval-based approach to interprocedural analysis. ACM Transactions on Programming Languages and Systems, 12(3):341--395, July 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Tree-Based Code Optimization - Mcconnell (1993) (3 citations) (Correct)
.... that are easy to analyze, then merge the analyses of these structures to arrive at a solution to the data flow problem [RP86] Algorithm F Flow is basically the CAST version of the simplest elimination algorithm, Allen Cocke interval analysis [AC77] it is also very similar to the algorithm in [Bur90] Although elimination algorithms are generally considered more efficient than iterative algorithms, they are also harder to understand and implement [BR90] This is due to the analysis required to reveal the structure in the flow graph, as well as the bookkeeping required to manipulate the flow ....
Michael Burke. An interval-based approach to interprocedural analysis. ACM Transactions on Programming Languages and Systems, 12(3):341--395, July 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC