A new approach to compiling adaptive programs

Jens Palsberg; Boaz Patt-Shamir; Karl Lieberherr

doi:10.1016/s0167-6423(97)00004-x

A new approach to compiling adaptive programs

Jens Palsberg^*
, Boaz Patt-Shamir
, Karl Lieberherr

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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 et al. (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.

Original language	English
Pages (from-to)	303-326
Number of pages	24
Journal	Science of Computer Programming
Volume	29
Issue number	3
DOIs	https://doi.org/10.1016/s0167-6423(97)00004-x
State	Published - Sep 1997
Externally published	Yes

Funding

Funders	Funder number
BRIGS
Basic Research in Computer Science, Centre of the Danish National Research Foundation
National Science Foundation	CCR-9402486, CDA-9015692

Access to Document

10.1016/s0167-6423(97)00004-x

Cite this

@article{06f6371e14a7481a85109b04130331c7,

title = "A new approach to compiling adaptive programs",

abstract = "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 et al. (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.",

author = "Jens Palsberg and Boaz Patt-Shamir and Karl Lieberherr",

note = "Funding Information: We thank Linda Seiter and the anonymous referees for many insightful comments on a draft of the paper. This work has been partially supportedb y the National Science Foundation under grant numbers CDA-9015692 (Research Instrumentation), and CCR-9402486 (Software Engineering). The first author was supported by BRIGS (Basic Research in Computer Science, Centre of the Danish National Research Foundation).",

year = "1997",

month = sep,

doi = "10.1016/s0167-6423(97)00004-x",

language = "אנגלית",

volume = "29",

pages = "303--326",

journal = "Science of Computer Programming",

issn = "0167-6423",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - A new approach to compiling adaptive programs

AU - Palsberg, Jens

AU - Patt-Shamir, Boaz

AU - Lieberherr, Karl

N1 - Funding Information: We thank Linda Seiter and the anonymous referees for many insightful comments on a draft of the paper. This work has been partially supportedb y the National Science Foundation under grant numbers CDA-9015692 (Research Instrumentation), and CCR-9402486 (Software Engineering). The first author was supported by BRIGS (Basic Research in Computer Science, Centre of the Danish National Research Foundation).

PY - 1997/9

Y1 - 1997/9

N2 - 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 et al. (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.

AB - 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 et al. (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.

UR - https://www.scopus.com/pages/publications/0031234788

U2 - 10.1016/s0167-6423(97)00004-x

DO - 10.1016/s0167-6423(97)00004-x

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0031234788

SN - 0167-6423

VL - 29

SP - 303

EP - 326

JO - Science of Computer Programming

JF - Science of Computer Programming

IS - 3

ER -

A new approach to compiling adaptive programs

Abstract

Funding

Access to Document

Other files and links

Fingerprint

Cite this