Code Generation = A* + BURS

Albert Nymeyer, Joost P. Katoen, Ymte Westra, H. Alblas

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)
53 Downloads (Pure)

Abstract

A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is re-developed, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived from the termrewrite system to direct the search. The advantage of using a search algorithm is that we need to compute only those costs that may be part of an optimal rewrite sequence.
Original languageUndefined
Title of host publicationCompiler Construction, 6th International Conference, CC'96
EditorsTibor Gyimóthy
Place of PublicationBerlin
PublisherSpringer
Pages160-177
Number of pages18
ISBN (Print)3-540-61053-7
DOIs
Publication statusPublished - 1996
Event6th International Conference on Compiler Construction, CC 1996 - Linköping, Sweden
Duration: 24 Apr 199626 Apr 1996
Conference number: 6

Publication series

NameLecture Notes in Computer Science
PublisherSpringer-Verlag
Volume1060
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Workshop

Workshop6th International Conference on Compiler Construction, CC 1996
Abbreviated titleCC
CountrySweden
CityLinköping
Period24/04/9626/04/96

Keywords

  • IR-66279
  • EWI-6493
  • METIS-318694
  • FMT-CC: COMPILER CONSTRUCTION

Cite this

Nymeyer, A., Katoen, J. P., Westra, Y., & Alblas, H. (1996). Code Generation = A* + BURS. In T. Gyimóthy (Ed.), Compiler Construction, 6th International Conference, CC'96 (pp. 160-177). (Lecture Notes in Computer Science; Vol. 1060). Berlin: Springer. https://doi.org/10.1007/3-540-61053-7_60
Nymeyer, Albert ; Katoen, Joost P. ; Westra, Ymte ; Alblas, H. / Code Generation = A* + BURS. Compiler Construction, 6th International Conference, CC'96. editor / Tibor Gyimóthy. Berlin : Springer, 1996. pp. 160-177 (Lecture Notes in Computer Science).
@inproceedings{21383036c25844718034ffdf3abb8ec8,
title = "Code Generation = A* + BURS",
abstract = "A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is re-developed, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived from the termrewrite system to direct the search. The advantage of using a search algorithm is that we need to compute only those costs that may be part of an optimal rewrite sequence.",
keywords = "IR-66279, EWI-6493, METIS-318694, FMT-CC: COMPILER CONSTRUCTION",
author = "Albert Nymeyer and Katoen, {Joost P.} and Ymte Westra and H. Alblas",
note = "eemcs-eprint-6493",
year = "1996",
doi = "10.1007/3-540-61053-7_60",
language = "Undefined",
isbn = "3-540-61053-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "160--177",
editor = "Tibor Gyim{\'o}thy",
booktitle = "Compiler Construction, 6th International Conference, CC'96",

}

Nymeyer, A, Katoen, JP, Westra, Y & Alblas, H 1996, Code Generation = A* + BURS. in T Gyimóthy (ed.), Compiler Construction, 6th International Conference, CC'96. Lecture Notes in Computer Science, vol. 1060, Springer, Berlin, pp. 160-177, 6th International Conference on Compiler Construction, CC 1996, Linköping, Sweden, 24/04/96. https://doi.org/10.1007/3-540-61053-7_60

Code Generation = A* + BURS. / Nymeyer, Albert; Katoen, Joost P.; Westra, Ymte; Alblas, H.

Compiler Construction, 6th International Conference, CC'96. ed. / Tibor Gyimóthy. Berlin : Springer, 1996. p. 160-177 (Lecture Notes in Computer Science; Vol. 1060).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Code Generation = A* + BURS

AU - Nymeyer, Albert

AU - Katoen, Joost P.

AU - Westra, Ymte

AU - Alblas, H.

N1 - eemcs-eprint-6493

PY - 1996

Y1 - 1996

N2 - A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is re-developed, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived from the termrewrite system to direct the search. The advantage of using a search algorithm is that we need to compute only those costs that may be part of an optimal rewrite sequence.

AB - A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is re-developed, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived from the termrewrite system to direct the search. The advantage of using a search algorithm is that we need to compute only those costs that may be part of an optimal rewrite sequence.

KW - IR-66279

KW - EWI-6493

KW - METIS-318694

KW - FMT-CC: COMPILER CONSTRUCTION

U2 - 10.1007/3-540-61053-7_60

DO - 10.1007/3-540-61053-7_60

M3 - Conference contribution

SN - 3-540-61053-7

T3 - Lecture Notes in Computer Science

SP - 160

EP - 177

BT - Compiler Construction, 6th International Conference, CC'96

A2 - Gyimóthy, Tibor

PB - Springer

CY - Berlin

ER -

Nymeyer A, Katoen JP, Westra Y, Alblas H. Code Generation = A* + BURS. In Gyimóthy T, editor, Compiler Construction, 6th International Conference, CC'96. Berlin: Springer. 1996. p. 160-177. (Lecture Notes in Computer Science). https://doi.org/10.1007/3-540-61053-7_60