OPTRAN - A language/system for the specification of program transformations: System overview and experiences

Lipps, Peter; Möncke, Ulrich; Wilhelm, Reinhard

doi:10.1007/3-540-51364-7_4

Cited by 22 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because programs are represented in a functional notation, there is no need for complex side conditions, and the transformations are all of a local nature. OPTRAN is also based on rewriting, but it offers far more sophisticated pattern matching facilities [Lipps et al 1988]. TrafoLa is another system able to specify sophisticated syntactic program patterns [Heckmann 1988].…”

Section: Rewritingmentioning

confidence: 99%

Program transformations using temporal logic side conditions

Kalvala

Warburton

Lacey

2009

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

This paper describes an approach to program optimisation based on transformations, where temporal logic is used to specify side conditions, and strategies are created which expand the repertoire of transformations and provide a suitable level of abstraction. We demonstrate the power of this approach by developing a set of optimisations using our transformation language and showing how the transformations can be converted into a form which makes it easier to apply them, while maintaining trust in the resulting optimising steps. The approach is illustrated through a transformational case study where we apply several optimisations to a small program.

show abstract

Section: Rewritingmentioning

confidence: 99%

Program transformations using temporal logic side conditions

Kalvala

Warburton

Lacey

2009

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…can be generated automatically from these descriptions. Generic tree pattern matching with similar pattern description syntax is widely used in generic tree transformation systems such as OPTRAN [16], TXL [5], puma [11], Gentle [18], or TRAFOLA [13], as well as in retargetable code generation, such as IBURG [10].…”

Section: Tree Patternsmentioning

confidence: 99%

A Formal Framework for Automated Round-Trip Software Engineering in Static Aspect Weaving and Transformations

Chalabine

Keßler

2007

29th International Conference on Software Engineering (ICSE'07)

View full text Add to dashboard Cite

We present a formal framework for a recently introduced approach to Automated Round-trip Software Engineering (ARE) in source-level aspect weaving systems. Along with the formalization we improve the original method and suggest a new concept of weaving transactions in Aspect-oriented Programming (AOP). As the major contribution we formally show how, given a tree-shaped intermediate representation of a program and an ancillary transposition tree, manual edits in statically woven code can consistently be mapped back to their proper source of origin, which is either in the application core or in an element in the aspect space. The presented formalism is constructive. It frames AOP by generalizing static aspect weaving to classical tree transformations.

show abstract

“…Because programs are represented in a functional notation, there is no need for complex side conditions, and the transformations are all of a local nature. OPTRAN is also based on rewriting, but it offers far more sophisticated pattern matching facilities [24]. A yet more modern system in the same tradition is Stratego, built by Visser [32].…”

Section: Introductionmentioning

confidence: 99%

Imperative Program Transformation by Rewriting

Lacey

Moor

2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 flow 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 flexible, high level, yet executable specification of many of the transformations found in optimising compilers.

show abstract

OPTRAN - A language/system for the specification of program transformations: System overview and experiences

Cited by 22 publications

References 10 publications

Program transformations using temporal logic side conditions

Program transformations using temporal logic side conditions

A Formal Framework for Automated Round-Trip Software Engineering in Static Aspect Weaving and Transformations

Imperative Program Transformation by Rewriting

Contact Info

Product

Resources

About