Compiler Optimization: A Case for the Transformation Tool Contest

Sebastian Buchwald
(Karlsruhe Institute of Technology (KIT))
Edgar Jakumeit
(Karlsruhe Institute of Technology (KIT))

An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of operations supported by the target hardware. In modern compiler construction graph-based IRs are employed. Optimization and lowering tasks can then be implemented with graph transformation rules. This case provides two compiler tasks to evaluate the participating tools regarding performance.

In Pieter Van Gorp, Steffen Mazanek and Louis Rose: Proceedings Fifth Transformation Tool Contest (TTC 2011), Zürich, Switzerland, June 29-30 2011, Electronic Proceedings in Theoretical Computer Science 74, pp. 6–16.
Published: 16th November 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.74.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org