Sean Zhang, Barbara G. Ryder, and William Landi. Program decomposition for pointer-induced aliasing analysis. Technical report, Laboratory for Computer Science Research, Rutgers University, July 1996. In preparation. An early report of the work is in LCSR-TR-259. 12  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fast and Accurate Flow-Insensitive Points-To Analysis - Shapiro, Horwitz (1997) (110 citations) (Correct)
....further classified as flow sensitive or flow insensitive, and as context sensitive or contextinsensitive. Flow sensitive analysis (e.g. LR92] CBC93] EGH94] takes into account the order in which statements are executed, while flow insensitive analysis (e.g. Wei80] MCCH94] And94] Ste96b] [ZRL96] ) assumes that statements can be executed in any order. Similarly, context sensitive analysis takes into account the fact that a function must return to the site of the most recent call, while context insensitive analysis propagates information from a call site, through the called function, ....
S. Zhang, B. G. Ryder, and W. Landi. Program decomposition for pointer-induced aliasing analysis. Technical report, Rutgers University LCSR-TR-259, 1996.
Program Decomposition for Pointer Aliasing: A Step toward.. - Zhang, Ryder, Landi (1996) (23 citations) Self-citation (Zhang Ryder Landi) (Correct)
....We call R e the FA (Flow insensitive Alias) relation. Intuitively, a tuple (o 0 1 ,o 0 2 ) is in the FA relation if the two object names are aliased, assuming pointer related assignments are considered symmetric and the control flow in the program is not taken into account. We prove in [44] that the FA relation defined above is weakly right regular. For the example program in Figure 4, the FA relation has the following equivalence classes: f p g f q g f tt g f q, y g f p, tt, x g f r g f p f, tt f, x.f g f q, y, r, w, u g f p g, tt g, x.g g f (p f ) tt f ) x.f ) z g By ....
....according to weakly connected components of GPE , that is, there is a subrelation of the FA relation for each component, which is independent of other components in GPE . For instance, for the example program in Figure 4, the FA relation can be partitioned into two subrelations. We prove in [44] that the FA relation for a program contains the run time aliases at any program point on an execution path of the program. The subrelation of the FA relation for each weakly connected component of GPE is a safe estimate of the run time aliases that can be induced by the pointer related ....
[Article contains additional citation context not shown here]
Sean Zhang, Barbara G. Ryder, and William Landi. Program decomposition for pointer-induced aliasing analysis. Technical report, Laboratory for Computer Science Research, Rutgers University, July 1996. In preparation. An early report of the work is in LCSR-TR-259. 12
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