On-demand dynamic summary-based points-to analysis
- 31 March 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the Tenth International Symposium on Code Generation and Optimization - CHO '12
- p. 264-274
- https://doi.org/10.1145/2259016.2259050
Abstract
No abstract availableKeywords
Funding Information
- Australian Research Council (DP0987236)
This publication has 19 references indexed in Scilit:
- Demand-driven context-sensitive alias analysis for JavaPublished by Association for Computing Machinery (ACM) ,2011
- SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSALecture Notes in Computer Science, 2011
- Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias AnalysisLecture Notes in Computer Science, 2009
- Demand-driven alias analysis for CPublished by Association for Computing Machinery (ACM) ,2008
- Subcubic algorithms for recursive state machinesPublished by Association for Computing Machinery (ACM) ,2008
- The ant and the grasshopperPublished by Association for Computing Machinery (ACM) ,2007
- Demand-driven points-to analysis for JavaPublished by Association for Computing Machinery (ACM) ,2005
- Completeness Analysis for Incomplete Object-Oriented ProgramsLecture Notes in Computer Science, 2005
- The set constraint/CFL reachability connection in practicePublished by Association for Computing Machinery (ACM) ,2004
- Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer AnalysisLecture Notes in Computer Science, 2004