Solving the TTC 2011 Compiler Optimization Case with QVTR-XSLT
Dan Li (University of Macau), Xiaoshan Li (University of Macau),, Volker Stolz (University of Oslo, UNU-IIST)
TL;DR
This paper demonstrates how the QVTR-XSLT tool can effectively solve a compiler optimization case study by leveraging graphical transformation notation and execution capabilities.
Contribution
It introduces the application of QVTR-XSLT for solving a specific compiler optimization problem in the TTC 2011 contest.
Findings
Successful application of QVTR-XSLT to the case study
Effective use of graphical notation for transformations
Demonstrated practical utility of QVTR-XSLT in compiler optimization
Abstract
In this short paper we present our solution for the Compiler Optimization case study of the Transformation Tool Contest (TTC) 2011 using the QVTR-XSLT tool. The tool supports editing and execution of the graphical notation of QVT Relations language
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.