1 research outputs found
A Relational Static Semantics for Call Graph Construction
The problem of resolving virtual method and interface calls in
object-oriented languages has been a long standing challenge to the program
analysis community. The complexities are due to various reasons, such as
increased levels of class inheritance and polymorphism in large programs. In
this paper, we propose a new approach called type flow analysis that represent
propagation of type information between program variables by a group of
relations without the help of a heap abstraction. We prove that regarding the
precision on reachability of class information to a variable, our method
produces results equivalent to that one can derive from a points-to analysis.
Moreover, in practice, our method consumes lower time and space usage, as
supported by the experimental results