An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages
- 5 September 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 180-195
- https://doi.org/10.1007/3-540-45789-5_15
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Points-to analysis for Java using annotated constraintsPublished by Association for Computing Machinery (ACM) ,2001
- Extending and evaluating flow-insenstitive and context-insensitive points-to analyses for JavaPublished by Association for Computing Machinery (ACM) ,2001
- Ultra-fast aliasing analysis using CLAPublished by Association for Computing Machinery (ACM) ,2001
- Practical virtual method call resolution for JavaPublished by Association for Computing Machinery (ACM) ,2000
- Optimization of Object-Oriented Programs Using Static Class Hierarchy AnalysisPublished by Springer Science and Business Media LLC ,2000
- Projection mergingPublished by Association for Computing Machinery (ACM) ,2000
- Partial online cycle elimination in inclusion constraint graphsPublished by Association for Computing Machinery (ACM) ,1998
- Fast static analysis of C++ virtual function callsPublished by Association for Computing Machinery (ACM) ,1996
- Points-to analysis in almost linear timePublished by Association for Computing Machinery (ACM) ,1996