Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience
暂无分享,去创建一个
[1] Manu Sridharan,et al. Refinement-based context-sensitive points-to analysis for Java , 2006, PLDI '06.
[2] Monica S. Lam,et al. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams , 2004, PLDI '04.
[3] Vineet Kahlon. Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis , 2008, PLDI '08.
[4] Barbara G. Ryder,et al. An incremental flow- and context-sensitive pointer aliasing analysis , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).
[5] C. R. Ramakrishnan,et al. Incremental and demand-driven points-to analysis using logic programming , 2005, PPDP.
[6] Olivier Tardieu,et al. Demand-driven pointer analysis , 2001, PLDI '01.
[7] Atanas Rountev,et al. Demand-driven context-sensitive alias analysis for Java , 2011, ISSTA '11.
[8] Thomas W. Reps,et al. Program analysis via graph reachability , 1997, Inf. Softw. Technol..
[9] Alexander Aiken,et al. Banshee: A Scalable Constraint-Based Analysis Toolkit , 2005, SAS.
[10] Hongtao Yu,et al. Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code , 2010, CGO '10.
[11] Jingling Xue,et al. On-demand dynamic summary-based points-to analysis , 2012, CGO '12.