Anne Neirynck, Prakash Panangaden, and Alan J. Demers. Computation of aliases and support sets. In POPL [POPL1987], pages 274--283.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....analysis is a crucial component of any optimizer because aliasing increases the likelihood that a side effect will foil an optimization. Much work on alias analysis has been restricted to languages that do not allow pointers [3, 10] or that restrict pointers to at most one level of indirection [43]. Some exceptions are [7, 29, 33] which use interprocedural analysis. The alias analysis techniques in [7, 29, 33] annotate each edge in a FG with a summary graph approximating the data structures at that point in the program. Because the size of the summary graphs must be bounded at ....

A. Neirynck, P. Panangaden, and A. J. Demers. Computation of aliases and support sets. In Proceedings of the 1987.

.... ZRL96, HP98, LH99, RC00, Das00, FRD00, FFA00] There are flow sensitive techniques as well which calculate program point specific aliases [Coo89, LR92, CBC93, MLR 93, EGH94, GH98, WL95, Ruf95, HA90, SFRW90, CRL99] Other work concentrates on aliases in higher order functional languages [Deu90, NPD87] SSA form is used to transform the program in a way that e#ectively adds adjustable flow sensitivity to a flow69 insensitive pointer alias analysis in [HH98] no empirical results are given and it is not clear if this technique is scalable. Newer work calculates pointer aliasing in programs ....

A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274-- 283, January 1987.

.... concentrate on aliases in heap storage [HPR89, CWZ90, Deu94, HN90, EGH94, JM82, LH88, SRW96] Others calculate program wide (flow insensitive) aliases [Cou86, Gua88, BCCH94, And94, SH97, Ste95, Wei80, ZRL96] Still other work concentrated on aliases in higher order functional languages [Deu90, NPD87] Incremental algorithms update data flow information after a program change rather than recomputing it from scratch, with the belief that the change impact will be limited and that the update cost will be proportional to the size of the impact. Given the expense of calculating aliases with ....

A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274--283, January 1987.

.... on aliases in heap storage [HPR89, CWZ90, Deu94, HN90, EGH94, GH96a, GH96b, JM82a, LH88, SRW98] Others calculate program wide (flowinsensitive) aliases [Cou86, Gua88, BCCH94, And94, SH97b, Ste96, Wei80, ZRL96] Still other work concentrated on aliases in higher order functional languages [Deu90, NPD87] 3.2 MOD Problem For the MOD problem for Fortran like languages, Banning [Ban79] proposed a decomposition, which separates the aliasing problem from the MOD problem; Cooper 18 and Kennedy [Coo85, CK88, CK87] further decomposed the problem into side e#ects on global variables and side e#ects ....

A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274--283, January 1987.

....aliases through more than one level of dereference and adding additional language constructs (e.g. structures and arrays) Benjamin Cooper [Coo89] developed an algorithm which used alias histories to insure that a procedure returns to the call site that invoked it. There also has been some work [Deu90, Deu92, NPD87] in detecting aliases in higher order programming languages. NPD87] only considers programs with single level dereferences and has the added difficulty of tracking the binding of functions to names. The problem addressed by [Deu90] is an order of magnitude complication over general aliasing; he ....

....constructs (e.g. structures and arrays) Benjamin Cooper [Coo89] developed an algorithm which used alias histories to insure that a procedure returns to the call site that invoked it. There also has been some work [Deu90, Deu92, NPD87] in detecting aliases in higher order programming languages. [NPD87] only considers programs with single level dereferences and has the added difficulty of tracking the binding of functions to names. The problem addressed by [Deu90] is an order of magnitude complication over general aliasing; he allows closures (partially evaluated functions) and continuations ....

A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274--283, January 1987.

.... Gua88, BCCH94, And94, SH97b, Ste95, Wei80, ZRL96] There are flow sensitive techniques as well which calculate programpoint specific aliases [Coo89, LR92, CBC93, MLR 93, EGH94, WL95, Ruf95, HA90, SFRW90] Still other work concentrated on aliases in higher order functional languages [Deu90, NPD87] 6 OBSERVATIONS The obvious conclusion of the empirical results is that flow sensitive analysis yields significantly more precise solutions at far greater computation cost. Nevertheless, this is a complex and interesting trade off. 6.1 Flow and context sensitive analysis Flow and ....

A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274-- 283, January 1987.

....execution of a Fortran procedure, ii) aliases in the calling procedure in Fortran cannot be affected by activity in the called procedure. Both (i) and (ii) can occur in C programs. Most previous work in analyzing pointer induced aliasing has been incomplete, impractical, or imprecise by design [5, 6, 9, 10, 12, 31, 42]. This would render corresponding Def Use analysis imprecise as well. Thus, our work on Interprocedural Reaching Definitions in the presence of pointers, which builds on our work in pointer induced aliasing, is qualitatively different from previous work. There also has been some work in discerning ....

A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274--283, January 1987.

....to our assumed alias (Chapter 4.2.3) except that we do not maintain the top of the execution stack and we restrict our alias sets at entry to size one (or zero) Cooper s method seems time and space infeasible without restricting the size of the alias sets. There also has been some work [Deu90, NPD87] in detecting aliases in higher order programming languages (i.e. languages where functions are treated like any other data type) NPD87] only considers programs with single level dereferences and has the 19 added difficulty of tracking the binding of functions to names. Interprocedurally, ....

....to size one (or zero) Cooper s method seems time and space infeasible without restricting the size of the alias sets. There also has been some work [Deu90, NPD87] in detecting aliases in higher order programming languages (i.e. languages where functions are treated like any other data type) [NPD87] only considers programs with single level dereferences and has the 19 added difficulty of tracking the binding of functions to names. Interprocedurally, they solve the alias problem for a procedure with the initial information induced by each call chain 9 . They fail to take advantage of ....

[Article contains additional citation context not shown here]

A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274--283, January 1987.

....non destructive operations on aggregates such as arrays or hash tables by cheaper destructive ones. This can take place at run time, using reference counting [GSH88] or reverse difference lists [Coh84] It can also be performed at compile time, using one of the optimization techniques of [Hud87, NPD87, Blo89, Deu90, DP90] for instance. A third alternative is to let the programmer perform effect analysis, and reduce the task of the computer to effect checking; the computer simply verifies that the transition from non destructive to destructive operations is semantics preserving. In this ....

A. Neirynk, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Proc. 14th ACM Symp. on Principles of Programming Languages, pages 274--283, Jan. 1987.

....as with single level pointers. Existing methods. Approximate existential alias analysis methods for pointers can be classified into: store based methods and access paths based methods. These methods use either finite graphs (or abstract stores) to represent potential run time stores [JM81, JM82, NPD87, RM88, LH88a, Ha89, HPR89, De90, Sh91, De92a, St92] possibly augmented with reference count information [Hu86, He88, CWZ90] sets of pairs of access paths to represent aliasing [CC77b, We80, ASU86, He90, SF 90, La92a, LR92] or a combination of the two [CBC93] Data flow values are kept finite ....

A. Neirynck, P. Panangaden, and A.J. Demers. Computation of aliases and support sets. In Fourteenth Annual ACM Symp. on Principles of Programming Languages, pp. 274--283, 1987.

No context found.

Anne Neirynck, Prakash Panangaden, and Alan J. Demers. Computation of aliases and support sets. In POPL [POPL1987], pages 274--283.

No context found.

Neyrinck, A., Panangaden, P., and Demers, A. Computation of aliases and support sets. In Fourteenth Annual ACM Symp. on Principles of Programming Languages (Jan. 1987), ACM Press, pp. 274--283.

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