Field analysis: getting useful and low-cost interprocedural information

We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectoriented programming, automatic memory management, and run-time checks required for type safety. Unlike many previous interprocedural analyses, our analysis is cheap, and does not require access to the entire program. Field analysis exploits the declared access restrictions placed on fields in a modular language (e.g. field access modifiers in Java) in order to determine useful properties of fields of an object. We describe our implementation of field analysis in the Swift optimizing compiler for Java, as well a set of optimizations that exploit the results of field analysis. These optimizations include removal of run-time tests, compiletime resolution of method calls, object inlining, removal of unnecessary synchronization, and stack allocation. Our results demonstrate that field analysis is efficient and...

• Type: Conference
• Year: 2000
• Where: PLDI
• Authors: Sanjay Ghemawat, Keith H. Randall, Daniel J. Scales
• Keywords: Declared Access Restrictions, Interprocedural Analysis, PLDI 2000, Programming Languages, field Analysis