Using static single assignment form to improve flow-insensitive pointer analysis
暂无分享,去创建一个
[1] Bjarne Steensgaard,et al. Points-to analysis in almost linear time , 1996, POPL '96.
[2] Eugene W. Myers,et al. A precise inter-procedural data flow algorithm , 1981, POPL '81.
[3] CytronRon,et al. Efficient accommodation of may-alias information in SSA form , 1993 .
[4] Mark N. Wegman,et al. Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.
[5] Keith D. Cooper,et al. Combining analyses, combining optimizations , 1995, TOPL.
[6] Barbara G. Ryder,et al. Pointer-induced aliasing: a problem classification , 1991, POPL '91.
[7] Jong-Deok Choi,et al. Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers , 1994, LCPC.
[8] Michael Hind,et al. An Empirical Comparison of Interprocedural Pointer Alias Analyses , 1997 .
[9] Guang R. Gao,et al. A linear time algorithm for placing φ-nodes , 1995, POPL '95.
[10] Susan Horwitz,et al. Precise flow-insensitive may-alias analysis is NP-hard , 1997, TOPL.
[11] Ron Cytron,et al. Efficient accommodation of may-alias information in SSA form , 1993, PLDI '93.
[12] Laurie J. Hendren,et al. Extended SSA numbering: introducing SSA properties to languages with multi-level pointers , 1996, CASCON.
[13] Gary A. Kildall,et al. A unified approach to global program optimization , 1973, POPL.
[14] Susan Horwitz,et al. Fast and accurate flow-insensitive points-to analysis , 1997, POPL '97.