Practical virtual method call resolution for Java
- 1 October 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 35 (10), 264-280
- https://doi.org/10.1145/354222.353189
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Scalable propagation-based call graph construction algorithmsPublished by Association for Computing Machinery (ACM) ,2000
- Optimizing Java Bytecode Using the Soot Framework: Is It Feasible?Lecture Notes in Computer Science, 2000
- Practical experience with an application extractor for JavaPublished by Association for Computing Machinery (ACM) ,1999
- Simple and effective analysis of statically-typed object-oriented programsPublished by Association for Computing Machinery (ACM) ,1996
- Precise concrete type inference for object-oriented languagesACM SIGPLAN Notices, 1994
- Optimizing dynamically-dispatched calls with run-time type feedbackPublished by Association for Computing Machinery (ACM) ,1994
- Constraint-based type inference and parametric polymorphismLecture Notes in Computer Science, 1994
- Constructing call multigraphs using dependence graphsPublished by Association for Computing Machinery (ACM) ,1993
- Efficient call graph analysisACM Letters on Programming Languages and Systems, 1992
- Efficient implementation of the smalltalk-80 systemPublished by Association for Computing Machinery (ACM) ,1984