Imperative program transformation by rewriting

DOI10.1007/3-540-45306-7_5MaRDI QIDQ2764063zbMATH OpenFDO

Authors David Lacey, Oege de Moor

Publication date 22 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2027/20270052

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42) Computing methodologies and applications (68U99)

Recommendations

• Compiler optimization correctness by temporal logic
• Program transformation and rewriting
• Building program optimizers with rewriting strategies
• Imperative-program transformation by instrumented-interpreter specialization
• A survey of rewriting strategies in program transformation systems

Cited in

(12)

• A higher-order strategy for eliminating common subexpressions
• Compiler optimization correctness by temporal logic
• Specification languages in algebraic compilers
• Pattern eliminating transformations
• Imperative-program transformation by instrumented-interpreter specialization
• A survey of strategies in rule-based program transformation systems
• Rewriting of imperative programs into logical equations
• Silver: an extensible attribute grammar system
• A survey of rewriting strategies in program transformation systems
• Term-graph rewriting in \textsc{Tom} using relative positions
• Program transformation and rewriting
• Building program optimizers with rewriting strategies

This page was built for publication: Imperative program transformation by rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764063)