This report presents a solution to the Hello World case study using GROOVE. We provide and explain the grammar that we used to solve the case study. Every requested question of the case study was solved by a single rule application.
{"title":"Saying Hello World with GROOVE - A Solution to the TTC 2011 Instructive Case","authors":"A. H. Ghamarian, M. Mol, A. Rensink, E. Zambon","doi":"10.4204/EPTCS.74.19","DOIUrl":"https://doi.org/10.4204/EPTCS.74.19","url":null,"abstract":"This report presents a solution to the Hello World case study using GROOVE. We provide and explain the grammar that we used to solve the case study. Every requested question of the case study was solved by a single rule application.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121806881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This case comprises several primitive tasks that can be solved straight away with most transformation tools. The aim is to cover the most important kinds of primitive operations on models, i.e. create, read, update and delete (CRUD). To this end, tasks such as a constant transformation, a model-to-text transformation, a very basic migration transformation or diverse simple queries or in-place operations on graphs have to be solved. The motivation for this case is that the results expectedly will be very instructive for beginners. Also, it is really hard to compare transformation languages along complex cases, because the complexity of the respective case might hide the basic language concepts and constructs.
{"title":"HelloWorld! An Instructive Case for the Transformation Tool Contest","authors":"Steffen Mazanek","doi":"10.4204/EPTCS.74.4","DOIUrl":"https://doi.org/10.4204/EPTCS.74.4","url":null,"abstract":"This case comprises several primitive tasks that can be solved straight away with most transformation tools. The aim is to cover the most important kinds of primitive operations on models, i.e. create, read, update and delete (CRUD). To this end, tasks such as a constant transformation, a model-to-text transformation, a very basic migration transformation or diverse simple queries or in-place operations on graphs have to be solved. \u0000The motivation for this case is that the results expectedly will be very instructive for beginners. Also, it is really hard to compare transformation languages along complex cases, because the complexity of the respective case might hide the basic language concepts and constructs.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126639331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
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.
{"title":"Solving the TTC 2011 Compiler Optimization Case with GROOVE","authors":"A. Rensink, E. Zambon","doi":"10.4204/EPTCS.74.11","DOIUrl":"https://doi.org/10.4204/EPTCS.74.11","url":null,"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.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132357671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper gives an overview of the Edapt solution to the reengineering case of the Transformation Tool Contest 2011.
本文概述了Edapt解决方案对2011年转换工具大赛的再工程案例。
{"title":"Solving the TTC 2011 Reengineering Case with Edapt","authors":"Markus Herrmannsdoerfer","doi":"10.4204/EPTCS.74.14","DOIUrl":"https://doi.org/10.4204/EPTCS.74.14","url":null,"abstract":"This paper gives an overview of the Edapt solution to the reengineering case of the Transformation Tool Contest 2011.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133720664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
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.
{"title":"Compiler Optimization: A Case for the Transformation Tool Contest","authors":"Sebastian Buchwald, Edgar Jakumeit","doi":"10.4204/EPTCS.74.2","DOIUrl":"https://doi.org/10.4204/EPTCS.74.2","url":null,"abstract":"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.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122982985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Sostaks, E. Kalniņa, A. Kalnins, E. Celms, Janis Iraids
The Reengineering Case of the Transformation Tool Contest 2011 deals with automatic extraction of state machine from Java source code. The transformation task involves complex, non-local matching of model elements. This paper contains the solution of the task using model transformation language MOLA. The MOLA solution uses higher-order transformations (HOT-s) to generate a part of the required MOLA program. The described HOT approach allows creating reusable, complex model transformation libraries for generic tasks without modifying an implementation of a model transformation language. Thus model transformation users who are not the developers of the language can achieve the desired functionality more easily.
{"title":"Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations","authors":"A. Sostaks, E. Kalniņa, A. Kalnins, E. Celms, Janis Iraids","doi":"10.4204/EPTCS.74.15","DOIUrl":"https://doi.org/10.4204/EPTCS.74.15","url":null,"abstract":"The Reengineering Case of the Transformation Tool Contest 2011 deals with automatic extraction of state machine from Java source code. The transformation task involves complex, non-local matching of model elements. This paper contains the solution of the task using model transformation language MOLA. The MOLA solution uses higher-order transformations (HOT-s) to generate a part of the required MOLA program. The described HOT approach allows creating reusable, complex model transformation libraries for generic tasks without modifying an implementation of a model transformation language. Thus model transformation users who are not the developers of the language can achieve the desired functionality more easily.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117315035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
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
{"title":"Solving the TTC 2011 Compiler Optimization Case with QVTR-XSLT","authors":"Dan Li, Xiaoshan Li, V. Stolz","doi":"10.4204/EPTCS.74.8","DOIUrl":"https://doi.org/10.4204/EPTCS.74.8","url":null,"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","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127489154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The authors' "metatools" are a collection of tools for generic programming. This includes generating Java sources from mathematically well-founded specifications, as well as the creation of strictly typed document object models for XML encoded texts. In this context, almost every computer-internal structure is treated as a "model", and every computation is a kind of model transformation. This concept differs significantly from "classical model transformation" executed by specialized tools and languages. Therefore it seemed promising to the organizers of the TTC 2011, as well as to the authors, to apply metatools to one of the challenges, namely to the "compiler optimization task". This is a report on the resulting experiences.
{"title":"Solving the TTC 2011 Compiler Optimization Task with metatools","authors":"M. Lepper, B. T. Widemann","doi":"10.4204/EPTCS.74.9","DOIUrl":"https://doi.org/10.4204/EPTCS.74.9","url":null,"abstract":"The authors' \"metatools\" are a collection of tools for generic programming. This includes generating Java sources from mathematically well-founded specifications, as well as the creation of strictly typed document object models for XML encoded texts. In this context, almost every computer-internal structure is treated as a \"model\", and every computation is a kind of model transformation. \u0000This concept differs significantly from \"classical model transformation\" executed by specialized tools and languages. Therefore it seemed promising to the organizers of the TTC 2011, as well as to the authors, to apply metatools to one of the challenges, namely to the \"compiler optimization task\". This is a report on the resulting experiences.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116679909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we apply the UML-RSDS notation and tools to the "Hello World" case studies and explain the underlying development process for this model transformation approach.
{"title":"Saying Hello World with UML-RSDS - A Solution to the 2011 Instructive Case","authors":"K. Lano, Shekoufeh Kolahdouz Rahimi","doi":"10.4204/EPTCS.74.26","DOIUrl":"https://doi.org/10.4204/EPTCS.74.26","url":null,"abstract":"In this paper we apply the UML-RSDS notation and tools to the \"Hello World\" case studies and explain the underlying development process for this model transformation approach.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125436560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The current paper presents a solution of the Program Understanding: A Reengineering Case for the Transformation Tool Contest using the VIATRA2 model transformation tool.
本文利用VIATRA2模型转换工具，提出了“程序理解:转换工具竞赛的再工程案例”的解决方案。
{"title":"Solving the TTC 2011 Reengineering Case with VIATRA2","authors":"Ábel Hegedüs, Z. Ujhelyi, Gábor Bergmann","doi":"10.4204/EPTCS.74.13","DOIUrl":"https://doi.org/10.4204/EPTCS.74.13","url":null,"abstract":"The current paper presents a solution of the Program Understanding: A Reengineering Case for the Transformation Tool Contest using the VIATRA2 model transformation tool.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134334644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：