论文信息 - A New Approach to Compiling Adaptive Programs

A New Approach to Compiling Adaptive Programs

An adaptive program can be understood as an object-oriented program where the class graph is a parameter, and hence the class graph may be changed without changing the program. The problem of compiling an adaptive program and a class graph into an object-oriented program was studied by Palsberg, Xiao, and Lieberherr in 1995. Their compiler is efficient but works only in special cases. In this paper we present and prove the correctness of a compiler that handles the general case. The compiler first computes a finite-state automaton and then uses it to generate efficient code.

Boaz Patt-Shamir | Jens Palsberg | Karl J. Lieberherr

[1] Jens Palsberg,et al. Efficient implementation of adaptive software , 1995, TOPL.

[2] Karl Lieberherr,et al. Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns , 1995 .

[3] Peter Sestoft,et al. Partial evaluation and automatic program generation , 1993, Prentice Hall international series in computer science.

[4] Jens Palsberg,et al. Object-oriented type systems , 1994, Wiley professional computing.

[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[6] Boaz Patt-Shamir,et al. A New Approach to Compiling Adaptive Programs , 1997, Sci. Comput. Program..

[7] Oscar Nierstrasz,et al. Class management for software communities , 1990, CACM.

[8] Karl J. Lieberherr,et al. Object-Oriented Software Evolution , 1993, IEEE Trans. Software Eng..

[9] Karl J. Lieberherr,et al. Adaptive object-oriented programming using graph-based customization , 1994, CACM.

[10] Linda M. Seiter,et al. Automating the Evolution of Object-Oriented Systems , 1996, ISOTAS.