论文信息 - Optimizations of Eiffel programs: SmallEiffel, the GNU Eiffel Compiler

Optimizations of Eiffel programs: SmallEiffel, the GNU Eiffel Compiler

The design of the Eiffel language makes it possible to perform global optimizations on Eiffel programs. We describe some of the techniques we used in SmallEiffel, The GNU Eiffel Compiler, to generate highly efficient excecutables for Eiffel programs. Most of these techniques-related to global analysis or not-may also be applied to other object oriented languages.

Olivier Zendra | Dominique Colnet

[1] Olivier Zendra,et al. Compiler support to customize the mark and sweep algorithm , 1998, ISMM '98.

[2] Craig Chambers,et al. Optimizing Dynamically-Typed Object-Oriented Languages With Polymorphic Inline Caches , 1991, ECOOP.

[3] Ole Agesen,et al. Concrete type inference: delivering object-oriented applications , 1995 .

[4] Dirk Grunwald,et al. Reducing indirect function call overhead in C++ programs , 1994, POPL '94.

[5] Jan Vitek,et al. Message Dispatch on Pipelined Processors , 1995, ECOOP.

[6] Bertrand Meyer,et al. Eiffel: The Language , 1991 .

[7] Urs Hölzle,et al. Eliminating Virtual Function Calls in C++ Programs , 1996, ECOOP.

[8] R. Jakobson. On Language , 1990 .

[9] Olivier Zendra,et al. Efficient dynamic dispatch without virtual function tables: the SmallEiffel compiler , 1997, OOPSLA '97.

[10] Bernhard Steffen,et al. Partial dead code elimination , 1994, PLDI '94.

[11] Amer Diwan,et al. Simple and effective analysis of statically-typed object-oriented programs , 1996, OOPSLA '96.

[12] Dhananjay M. Dhamdhere. Practical adaption of the global optimization algorithm of Morel and Renvoise , 1991, TOPL.

[13] Olivier Zendra,et al. Type Inference for Late Binding: The SmallEiffel Compiler , 1997, JMLC.