Abstract

. The problem of concrete type-inference for statically typed object-oriented programming languages (e.g., Java, C ++ ) determines at each program point, those objects to which a reference may refer or a pointer may point during execution. We present a new technique called analysis-using-abstract-values which performs modular and demanddriven concrete type-inference of a robust subset of Java without threads and exceptions and C ++ without exceptions. Our algorithm is provably precise on programs with only single-level types 2 and without dynamic dispatch, and has the worst-case complexity of O(n 4 ) which is an improvement over the O(n 7 ) worst-case bound achievable by applying previous approaches of [RHS95] and [LR91] to this case. For general programs, the algorithm is polynomial-time and computes a safe solution. 1 Introduction The problem of concrete type-inference for statically typed object-oriented programming languages (e.g., Java, C ++ ) is to determine at each...

Citations