Program transformation is used in a wide range of applications including compiler
construction, optimization, program synthesis, refactoring, software renovation, and reverse …

The internal libraries of Linux are evolving rapidly, to address new requirements and
improve performance. These evolutions, however, entail a massive problem of collateral …

We describe a facility for improving optimization of Haskell programs using rewrite rules.
Library authors can use rules to express domain-specific optimizations that the compiler …

Attribute grammar specification languages, like many domain-specific languages, offer
significant advantages to their users, such as high-level declarative constructs and domain …

Active Appearance Models (AAMs) have been shown to be useful for interpreting images of
deformable objects. Here we place the AAM matching algorithm in a statistical framework …

Program transformation is the mechanical manipulation of a program in order to improve it
relative to some cost function and is understood broadly as the domain of computation …

Many processes can be seen as transformations of tree-like data structures. In compiler
construction, for example, we continuously manipulate trees and perform tree …

Refactorings are behaviour-preserving program transformations, typically for improving the
structure of existing code. A few of these transformations have been mechanised in …

In a modern operating system (OS), device drivers can make up over 70% of the source
code. Driver code is also heavily dependent on the rest of the OS, for functions and data …

Many classical compiler optimizations can be elegantly expressed using rewrite rules of
form: I⇒ I′ if φ, where I, I′ are intermediate language instructions and φ is a property …