J. B. Karo and J. D. Ullman. Global data fiow analysis and iterative algorithms. J. ACM, 23(1):158-171, 1976. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Symbolic Reaching Definitions Analysis of Ada Programs - Blieberger, Burgstaller (1998) (1 citation) (Correct)
....c( v(o, This data flow framework has been introduced in [3] 4 Solving the Symbolic Evaluation Data Flow Framework Unfortunately the definition of PrpgtCond( prevents the symbolic evaluation framework from being bounded. Thus it cannot be solved by iteration algorithms (compare [9, 7, 8]) Nevertheless we can solve symbolic evaluation frameworks with help of elim ination algorithms (see [11, 10] Note that the set of equations (i 1, n) Ei: xi = Wi(xi, xi, 1) implies a dependency relation on the variables xi. We say that xi on the left side depends on all ....
J. B. Karo and J. D. Ullman. Global data fiow analysis and iterative algorithms. J. ACM, 23(1):158-171, 1976.
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