Solving the TTC 2011 Compiler Optimization Case with GROOVE

Arend Rensink, Eduardo Zambon

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    52 Downloads (Pure)

    Abstract

    This report presents a partial solution to the Compiler Optimisation case study using GROOVE. We explain how the input graphs provided with the case study were adapted into a GROOVE representation and we describe an initial solution for Task 1. This solution allows us to automatically reproduce the steps of the constant folding example given in the case description. We did not solve Task 2.
    Original languageUndefined
    Title of host publicationProceedings of the Fifth Transformation Tool Contest (TTC 2011)
    EditorsPieter van Gorp, Steffen Mazanek, Louis Rose
    PublisherOpen Publishing Association
    Pages126-130
    Number of pages5
    ISBN (Print)not assigned
    DOIs
    Publication statusPublished - Nov 2011

    Publication series

    NameElectronic Proceedings in Theoretical Computer Science (EPTCS)
    PublisherOpen Publishing Association
    Volume74
    ISSN (Print)2075-2180

    Keywords

    • METIS-285116
    • EWI-21484
    • IR-79662

    Cite this

    Rensink, A., & Zambon, E. (2011). Solving the TTC 2011 Compiler Optimization Case with GROOVE. In P. van Gorp, S. Mazanek, & L. Rose (Eds.), Proceedings of the Fifth Transformation Tool Contest (TTC 2011) (pp. 126-130). (Electronic Proceedings in Theoretical Computer Science (EPTCS); Vol. 74). Open Publishing Association. https://doi.org/10.4204/EPTCS.74.11