4 citations found. Retrieving documents...
W. A. Landi, B. G. Ryder, P. A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural modification side-effect analysis with pointer aliasing. Technical Report DCS-TR-336, Rutgers University, May 1998.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Equivalence Analysis: A General Technique to Improve the.. - Liang, Harrold (1999)   (4 citations)  (Correct)

....flow insensitive algorithms (e.g. 1, 13, 15, 16] sacrifice precision for efficiency, and quickly compute less precise alias information that holds throughout a procedure or the entire program. Many researchers report ways to use alias information in dataflow analyses to ensure safety (e.g. [2, 12, 14]) The method used 1 Aliasing occurs when two different names access the same memory location at a point in a program. by all these techniques to handle pointer variables in a program can be described as follows: when the data facts, such as definitions and uses, are computed for a statement, a ....

.... Researchers have studied the effects of the alias information computed by different alias analysis algorithms, with varying levels of precision, on the precision and efficiency of data flow analyses when the pointer variables are handled using the method discussed in the previous paragraph [12, 14, 19]. The empirical results of these studies show that, when the size of the subject program is large, the side effects of a statement or a procedure can be greatly increased through dereferences of pointer variables. For example, Zhang, Ryder, and Landi [19] report that, when Landi and Ryder s ....

[Article contains additional citation context not shown here]

W. A. Landi, B. G. Ryder, P. A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural modification side-effect analysis with pointer aliasing. Technical Report DCS-TR-336, Rutgers University, May 1998.


Which Pointer Analysis Should I Use? - Hind, Pioli (2000)   (Correct)

....points to b, and b points to c, the compact representation records only the following alias set: fha; bi; hb; cig, from which it can be inferred that h a; ci and h a; bi are also aliases. The cost and time when such information is inferred can affect the precision and efficiency of the analysis [22, 12, 20]. Interprocedural data flow analysis can be classified as flowsensitive or flow insensitive, depending on whether controlflow information of a procedure is used during the analysis [23] By not considering control flow information, and therefore computing a conservative summary, a ....

....variables are automatically modeled as assignment statements in the dummy main function. Array initializations are expanded into an assignment for each array component. 4. CLIENT ANALYSES This section summarizes the client analyses used in this study. 4. 1 Mod Ref Analysis Mod Ref analysis [20] determines what objects may be modified referenced at each CFG node. This information is subsequently used by other analyses, such as reaching definitions and live variable analysis. This information is computed by first visiting each CFG node and computing what objects are modified or ....

[Article contains additional citation context not shown here]

W. A. Landi, B. G. Ryder, P. A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural modification side-effect analysis with pointer aliasing. Technical Report DCS-TR-336, Department of Computer Science, Rutgers University, May 1998.


Interprocedural Pointer Alias Analysis - Hind, Burke, Carini, Choi (1999)   (8 citations)  (Correct)

....et al. 1998] Landi and Ryder [1992] use a representation that explicitly describes all alias relations at the cost of increased storage. The Appendix illustrates how the compact and explicit representations have incomparable precision. Similar discussions can be found in Marlowe et al. 1993] Landi et al. 1998], and Pioli [1999] To kill alias relations at assignment statements whose left side contains pointer dereferences, must information about the left side expression is required. Our treatment optimistically kills alias relations if the current alias information resolves the pointer expression to ....

....metrics they report is the number of thru deref assigns, which corresponds to the write metric reported in Figure 14. However, since their results included compiler introduced temporaries in their thru deref count [Landi 1997] a direct comparison is not possible. Stocks et al. 1998] and Landi et al. 1998] use the same metric without including temporaries. Using the flow sensitive context sensitive analysis of Landi and Ryder [1992] the average number of objects ranges from 1.0 to 2.0 on the benchmarks we have in common (allroots, lex315, loader, football, compiler, assembler, simulator) On these ....

Landi, W. A., Ryder, B. G., Stocks, P. A., Zhang, S., and Altucher, R. 1998. A schema for interprocedural modification side-effect analysis with pointer aliasing. Tech. Rep. DCS-TR-336, Department of Computer Science, Rutgers University. May.


Conditional Pointer Aliasing and Constant Propagation - Pioli (1999)   (3 citations)  (Correct)

....is given in (d) of Figure 5. This set represents all aliases that are implied by the three base aliases in (b) Others have used this exhaustive alias representation [LR92] instead. These two representations have trade offs in terms of both efficiency and precision [MLR 93, EGH94, BCCH97, LSZA98] In some cases the compact representation may combine aliases that cannot exist at the same time along some execution path. This occurs at S7 in Figure 6 where the compact representation assumes that both alias relations q,s and p,q exist when clearly they cannot since they come from ....

....of a program decomposition technique for pointer aliasing of well typed C programs. After the program is decomposed, they investigate various combinations of three pointer alias analyses, one flow and context sensitive and two different flow and context insensitive analyses. Landi et al. LSZA98] provide a schema for computing modification side effects with pointer aliasing. They provide empirical data for the flow sensitive analysis of Landi and Ryder [LR92] and a flow insensitive analysis described in [ZRL96] Diwan et al. DMM98] provide both static and dynamic measurements of the ....

William Landi, Barbara G. Ryder Philip A. Stocks, Sean Zhang, and Rita Altucher. A schema for interprocedural modification side-effect analysis with pointer aliasing. Technical Report DCS-TR-336, Department of Computer Science, Rutgers University, May 1998.

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