ITU

Imperative-program transformation by instrumented-interpreter specialization

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Standard

Imperative-program transformation by instrumented-interpreter specialization. / Debois, Søren.

In: Higher-Order and Symbolic Computation, Vol. 21, No. 1-2, 15.04.2008, p. 37-58.

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Harvard

APA

Vancouver

Author

Bibtex

@article{78ce8300dcc911dda259000ea68e967b,
title = "Imperative-program transformation by instrumented-interpreter specialization",
abstract = "We describe how to implement strength reduction, loop-invariant code motion and loop quasi-invariant code motion by specializing instrumented interpreters. To curb code duplication intrinsic to such specialization, we introduce a new program transformation, rewinding, which uses Moore-automata minimization to remove duplicated code.",
author = "S{\o}ren Debois",
note = "Paper id:: 10.1007/s10990-008-9027-3",
year = "2008",
month = apr,
day = "15",
language = "English",
volume = "21",
pages = "37--58",
journal = "Higher-Order and Symbolic Computation",
issn = "1388-3690",
publisher = "Springer New York LLC",
number = "1-2",

}

RIS

TY - JOUR

T1 - Imperative-program transformation by instrumented-interpreter specialization

AU - Debois, Søren

N1 - Paper id:: 10.1007/s10990-008-9027-3

PY - 2008/4/15

Y1 - 2008/4/15

N2 - We describe how to implement strength reduction, loop-invariant code motion and loop quasi-invariant code motion by specializing instrumented interpreters. To curb code duplication intrinsic to such specialization, we introduce a new program transformation, rewinding, which uses Moore-automata minimization to remove duplicated code.

AB - We describe how to implement strength reduction, loop-invariant code motion and loop quasi-invariant code motion by specializing instrumented interpreters. To curb code duplication intrinsic to such specialization, we introduce a new program transformation, rewinding, which uses Moore-automata minimization to remove duplicated code.

M3 - Journal article

VL - 21

SP - 37

EP - 58

JO - Higher-Order and Symbolic Computation

JF - Higher-Order and Symbolic Computation

SN - 1388-3690

IS - 1-2

ER -

ID: 271587