Simple and E ective Analysis ofStatically-Typed Object-Oriented ProgramsAmer

To use modern hardware eeectively, compilers need extensive control-ow information. Unfortunately, the frequent method invocations in object-oriented languages obscure control ow. In this paper, we describe and evaluate a range of analysis techniques to convert method invocations into direct calls for statically-typed object-oriented languages and thus improve control-ow information in object-oriented languages. We present simple algorithms for type hierarchy analysis, aggregate analysis, and inter-procedural and intraprocedural type propagation. These algorithms are also fast, O(jproceduresj P procedures p n p v p) worst case time (linear in practice) for our slowest analysis, where n p is the size of procedure p and v p is the number of variables in procedure p, and are thus practical for use in a compiler. When they fail, we introduce cause analysis to reveal the source of imprecision and suggest where more powerful algorithms may be warranted. We show that our simple analyses perform almost as well as an oracle that resolves all method invo-cations that invoke only a single procedure. this document is hereby granted provided that this notice is retained on all copies, that copies are not altered, and that ACM is credited when the material is used to form other copyright policies.