Ph.D. thesis defended at the University of California, Berkeley, Computer Science Division, December 1997.

An analysis algorithm for languages like C++ and Java, and a collection of optimizations driven by the analysis. This algorithm is now being used in the JAX Java code compression tool (available on alphaWorks) and in an optimizer for a future IBM C++ compiler.

Paper presented at the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), San Jose, California, October 1996.

Describes and evaluates Rapid Type Analysis, an algorithm that resolves 71% of the dynamic virtual function calls in a suite of seven C++ benchmark programs of significant size. Rapid Type Analysis also reduces compiled program size by 25%, and can be used to help the programmer understand his or her C++ program more easily.