Evaluating the precision of static reference analysis using profiling
暂无分享,去创建一个
[1] Alexandru Nicolau,et al. Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs , 1992, PLDI '92.
[2] Barbara G. Ryder,et al. A safe approximate algorithm for interprocedural aliasing , 1992, PLDI '92.
[3] Jong-Deok Choi,et al. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects , 1993, POPL '93.
[4] Barbara G. Ryder,et al. Points-to analysis for Java based on annotated constraints , 2000 .
[5] Bjarne Steensgaard,et al. Points-to analysis in almost linear time , 1996, POPL '96.
[6] Barbara G. Ryder,et al. Points-to analysis for Java using annotated constraints , 2001, OOPSLA '01.
[7] Alain Deutsch,et al. Interprocedural may-alias analysis for pointers: beyond k-limiting , 1994, PLDI '94.
[8] G. Ramalingam,et al. The undecidability of aliasing , 1994, TOPL.
[9] Alexandru Nicolau,et al. Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs. , 1992, PLDI 1992.
[10] Manuvir Das,et al. Unification-based pointer analysis with directional assignments , 2000, PLDI '00.
[11] Donglin Liang,et al. Extending and evaluating flow-insenstitive and context-insensitive points-to analyses for Java , 2001, PASTE '01.
[12] David S. Wise. Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation , 1991, PLDI 1991.
[13] Susan Horwitz,et al. Fast and accurate flow-insensitive points-to analysis , 1997, POPL '97.
[14] Markus Mock,et al. Dynamic points-to sets: a comparison with static analyses and potential applications in program understanding and optimization , 2001, PASTE '01.
[15] Donglin Liang,et al. Efficient points-to analysis for whole-program analysis , 1999, ESEC/FSE-7.
[16] Barbara G. Ryder,et al. Relevant context inference , 1999, POPL '99.