Solving the TTC 2011 Compiler Optimization Case with GROOVE

Details Solving the TTC 2011 Compiler Optimization Case with GROOVE Solving the TTC 2011 Compiler Optimization Case with GROOVE

2011-11-21

arxiv.org/abs/1111.4746v1

EPTCS 74, 2011, pp. 126-130

Computer Science

Software Engineering

In Proceedings TTC 2011, arXiv:1111.4407

Scientific paper

10.4204/EPTCS.74.11

This report presents a partial solution to the Compiler Optimization 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.

Affiliated with

Also associated with

No associations

Rating

Solving the TTC 2011 Compiler Optimization Case with GROOVE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the TTC 2011 Compiler Optimization Case with GROOVE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the TTC 2011 Compiler Optimization Case with GROOVE will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-375996