A comparison of algorithms for interprocedural class analysis

Authors:
David Grove
Affiliations:
Department of Computer Science and Engineering, University of Washington
Venue:
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
Year:
1996

Citing 16
Cited 0

Control flow analysis in scheme

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
TS: an optimizing compiler for smalltalk

OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Interactive type analysis and extended message splitting; optimizing dynamically-typed object-oriented programs

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Type substitution for object-oriented programming

OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Control-flow analysis of higher-order languages of taming lambda

Control-flow analysis of higher-order languages of taming lambda
Optimizing dynamically-dispatched calls with run-time type feedback

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Precise concrete type inference for object-oriented languages

OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Profile-guided receiver class prediction

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Dynamic versus static optimization techniques for object-oriented languages

Theory and Practice of Object Systems - Special issue: type systems
Concrete type inference: delivering object-oriented applications

Concrete type inference: delivering object-oriented applications
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis

ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism

ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Compile-Time Analysis of Object-Oriented Programs

CC '92 Proceedings of the 4th International Conference on Compiler Construction
The impact of interprocedural class analysis on optimization

CASCON '95 Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
Efficient implementation of the smalltalk-80 system

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been developed to convert message sends into statically-bound procedure calls, which are then amenable to traditional compiler optimizations such as inline expansion. In this paper, we examine one such technique, interprocedural class analysis. We develop a general model for describing interprocedural class analysis algorithms, present several previously developed algorithms using this model, and empirically assess the algorithms by applying them to a suite of Cecil applications.