Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis
暂无分享,去创建一个
[1] Alexander Aiken,et al. Partial online cycle elimination in inclusion constraint graphs , 1998, PLDI.
[2] Olivier Tardieu,et al. Ultra-fast aliasing analysis using CLA: a million lines of C code in a second , 2001, PLDI '01.
[3] Monica S. Lam,et al. Efficient context-sensitive pointer analysis for C programs , 1995, PLDI '95.
[4] Jakob Rehof,et al. Estimating the Impact of Scalable Pointer Analysis on Optimization , 2001, SAS.
[5] Michael Hind,et al. Pointer analysis: haven't we solved this problem yet? , 2001, PASTE '01.
[6] Lars Ole Andersen,et al. Program Analysis and Specialization for the C Programming Language , 2005 .
[7] Manuvir Das,et al. Unification-based pointer analysis with directional assignments , 2000, PLDI '00.
[8] Matthias Felleisen,et al. Componential set-based analysis , 1997, TOPL.
[9] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .
[10] Jong-Deok Choi,et al. Stack allocation and synchronization optimizations for Java using escape analysis , 2003, TOPL.
[11] Chris Lattner,et al. Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis , 2003 .
[12] Barbara G. Ryder,et al. Relevant context inference , 1999, POPL '99.
[13] David A. McAllester. On the complexity analysis of static analyses , 2002, JACM.
[14] Calvin Lin,et al. Client-Driven Pointer Analysis , 2003, SAS.
[15] Bjarne Steensgaard,et al. Points-to analysis in almost linear time , 1996, POPL '96.
[16] Laurie J. Hendren,et al. Context-sensitive interprocedural points-to analysis in the presence of function pointers , 1994, PLDI '94.
[17] Alexander Aiken,et al. Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C , 2000, SAS.
[18] Barbara G. Ryder,et al. A safe approximate algorithm for interprocedural aliasing , 1992, PLDI '92.
[19] Erik Ruf,et al. Context-insensitive alias analysis reconsidered , 1995, PLDI '95.
[20] Jakob Rehof. Minimal typings in atomic subtyping , 1997, POPL '97.
[21] Helmut Veith,et al. Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.
[22] David A. McAllester. On the complexity analysis of static analyses , 1999, JACM.
[23] Monica S. Lam,et al. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams , 2004, PLDI '04.
[24] Jakob Rehof,et al. Scalable context-sensitive flow analysis using instantiation constraints , 2000, PLDI '00.
[25] Donglin Liang,et al. Efficient points-to analysis for whole-program analysis , 1999, ESEC/FSE-7.
[26] Jong-Deok Choi,et al. Interprocedural pointer alias analysis , 1999, TOPL.
[27] Thomas W. Reps,et al. Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.
[28] Wen-mei W. Hwu,et al. Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation , 2000, PLDI '00.