The JaSpe specializer: BT-objects and the interprocedural aspect of the binding-time analysis algorithm

This paper is devoted to partial evaluations that use the offline strategy. The power of this method for solving the problem of program specialization depends mainly on the binding-time analysis, which annotates the program constructs as either executable or not executable at the stage of specialization.
The binding-time analysis can use several variants of the annotation of the class fields, depending on their use in the program. Increasing the number of additional optimizations, this class polyvariance allows more programs to be specialized effectively. The better effect is achieved during the specialization of object-oriented programs, involving the creation of many class instances with different purposes.
Known algorithms for the binding-time analysis are extended to be class polyvariant and applied to a general-purpose, object-oriented language. The new methods are implemented as plugins for the Eclipse IDE. The plugins form the JaSpe specializer for Java programs.