B. K. Rosen. Data ow analysis for procedural languages. Journal of the ACM, 26(2):322-344, April 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Language Theoretic Approach to Algorithm and Software Development - Goyal (1999) (Correct)
....problem is to compute a safe approximation to the may alias relation at every program point for programs in an imperative language such as C. We use the problem speci cation from Hind et al. 7] who formulate an intra procedural may alias analysis algorithm using a standard data ow framework [11, 13]. The intra procedural aliasing information is computed by applying well known iterative techniques to the Sparse Evaluation Graph (SEG) 3] The computation requires a transfer function for each node that 2 causes a potential pointer assignment (relating the data ow information owing into ....
B. K. Rosen. Data ow analysis for procedural languages. Journal of the ACM, 26(2):322-344, April 1979.
An Improved Intra-procedural May-alias Analysis Algorithm - Goyal (1999) (2 citations) (Correct)
.... Improved Intra procedural May alias Analysis Algorithm Deepak Goyal Department of Computer Science New York University deepak cs.nyu.edu February 6, 1999 Abstract Hind et al. 5] use a standard data ow framework [15, 16] to formulate an intra procedural may alias computation. The intra procedural aliasing information is computed by applying well known iterative techniques to the Sparse Evaluation Graph (SEG) 3] The computation requires a transfer function for each node that causes a potential pointer ....
....SEG also contains a special entry node NEntry , and an exit node NExit , such that every node is on some path from NEntry to NExit . The computation of the may alias information at each program point (i.e. on entry to, and, on exit from each SEG node n) is done by an iterative data ow analysis ([15, 16]) Equations 4 and 5 (taken from the de nitions in [5] de ne the relationship between the alias information owing into and out of an SEG node n. 3 Let Inn and Outn be the alias relations holding immediately before and immediately after SEG node n. For a node n, Inn is the union of the Out sets ....
B. K. Rosen. Data ow analysis for procedural languages. Journal of the ACM, 26(2):322-344, April 1979.
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