Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CC
2001
Springer

favoriteEmaildiscussreport

177views System Software» more CC 2001»

Imperative Program Transformation by Rewriting

13 years 8 months ago

Imperative Program Transformation by Rewriting

Download www.dcs.warwick.ac.uk

Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expressions with simple patterns to matching blocks in a control ﬂow graph. In order to express the complex restrictions on the applicability of these rewrites we add temporal logic side conditions. The combination of these features allows a ﬂexible, high level, yet executable speciﬁcation of many of the transformations found in optimising compilers.

David Lacey, Oege de Moor

Real-time Traffic

CC 2001 | Control ﬂow Graph | Rewrite System | Standard Imperative Program | System Software |

claim paper

Related Content

» A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

» Automated Termination Analysis of Java Bytecode by Term Rewriting

» Transforming Process Models Executable Rewrite Rules versus a Formalized Java Program

» iRho an imperative rewriting calculus

» Generalizing Cooks Transformation to Imperative Stack Programs

» Imperative LF MetaProgramming

» Using SPARK for a beginners course on reasoning about imperative programs

» Formal Verification of a Clike Memory Model and Its Uses for Verifying Program Transformat...

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CC
Authors	David Lacey, Oege de Moor

Comments (0)