This paper discusses the GReTL solution of the TTC 2011 Compiler Optimization case. The submitted solution covers both the constant folding task and the instruction selection task. The verifier for checking the validity of the graph is also implemented, and some additional test graphs are provided as requested by the extension.
{"title":"Solving the TTC 2011 Compiler Optimization Case with GReTL","authors":"Tassilo Horn","doi":"10.4204/EPTCS.74.10","DOIUrl":"https://doi.org/10.4204/EPTCS.74.10","url":null,"abstract":"This paper discusses the GReTL solution of the TTC 2011 Compiler Optimization case. The submitted solution covers both the constant folding task and the instruction selection task. The verifier for checking the validity of the graph is also implemented, and some additional test graphs are provided as requested by the extension.","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":"128027520","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}
We introduce the graph transformation tool GrGen.NET (www.grgen.net) by solving the Hello World Case of the Transformation Tool Contest 2011 which consists of a collection of small transformation tasks; for each task a section is given explaining our implementation.
{"title":"Saying Hello World with GrGen.NET - A Solution to the TTC 2011 Instructive Case","authors":"Sebastian Buchwald, Edgar Jakumeit","doi":"10.4204/EPTCS.74.23","DOIUrl":"https://doi.org/10.4204/EPTCS.74.23","url":null,"abstract":"We introduce the graph transformation tool GrGen.NET (www.grgen.net) by solving the Hello World Case of the Transformation Tool Contest 2011 which consists of a collection of small transformation tasks; for each task a section is given explaining our implementation.","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":"116135039","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}
Louis M. Rose, A. García-Domínguez, James R. Williams, D. Kolovos, R. Paige, F. Polack
Epsilon is an extensible platform of integrated and task-specific languages for model management. With solutions to the 2011 TTC Hello World case, this paper demonstrates some of the key features of the Epsilon Object Language (an extension and reworking of OCL), which is at the core of Epsilon. In addition, the paper introduces several of the task-specific languages provided by Epsilon including the Epsilon Generation Language (for model-to-text transformation), the Epsilon Validation Language (for model validation) and Epsilon Flock (for model migration).
{"title":"Saying Hello World with Epsilon - A Solution to the 2011 Instructive Case","authors":"Louis M. Rose, A. García-Domínguez, James R. Williams, D. Kolovos, R. Paige, F. Polack","doi":"10.4204/EPTCS.74.27","DOIUrl":"https://doi.org/10.4204/EPTCS.74.27","url":null,"abstract":"Epsilon is an extensible platform of integrated and task-specific languages for model management. With solutions to the 2011 TTC Hello World case, this paper demonstrates some of the key features of the Epsilon Object Language (an extension and reworking of OCL), which is at the core of Epsilon. In addition, the paper introduces several of the task-specific languages provided by Epsilon including the Epsilon Generation Language (for model-to-text transformation), the Epsilon Validation Language (for model validation) and Epsilon Flock (for model migration).","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":"127081116","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}
{"title":"Solving the TTC 2011 Model Migration Case with UML-RSDS","authors":"K. Lano, Shekoufeh Kolahdouz Rahimi","doi":"10.4204/EPTCS.74.6","DOIUrl":"https://doi.org/10.4204/EPTCS.74.6","url":null,"abstract":"In this paper we apply the UML-RSDS notation and tools to the GMF model migration case study and explain how to use the UML-RSDS tools.","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":"114277767","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 Software Reengineering, one of the central artifacts is the source code of the legacy system in question. In fact, in most cases it is the only definitive artifact, because over the time the code has diverged from the original architecture and design documents. The first task of any reengineering project is to gather an understanding of the system's architecture. Therefore, a common approach is to use parsers to translate the source code into a model conforming to the abstract syntax of the programming language the system is implemented in which can then be subject to querying. Despite querying, transformations can be used to generate more abstract views on the system's architecture. This transformation case deals with the creation of a state machine model out of a Java syntax graph. It is derived from a task that originates from a real reengineering project.
{"title":"Program Understanding: A Reengineering Case for the Transformation Tool Contest","authors":"Tassilo Horn","doi":"10.4204/EPTCS.74.3","DOIUrl":"https://doi.org/10.4204/EPTCS.74.3","url":null,"abstract":"In Software Reengineering, one of the central artifacts is the source code of the legacy system in question. In fact, in most cases it is the only definitive artifact, because over the time the code has diverged from the original architecture and design documents. The first task of any reengineering project is to gather an understanding of the system's architecture. Therefore, a common approach is to use parsers to translate the source code into a model conforming to the abstract syntax of the programming language the system is implemented in which can then be subject to querying. Despite querying, transformations can be used to generate more abstract views on the system's architecture. This transformation case deals with the creation of a state machine model out of a Java syntax graph. It is derived from a task that originates from a real reengineering project.","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":"122366540","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 challenge of the Compiler Optimization Case is to perform local optimizations and instruction selection on the graph-based intermediate representation of a compiler. The case is designed to compare participating tools regarding their performance. We tackle this task employing the general purpose graph rewrite system GrGen.NET (www.grgen.net).
{"title":"Solving the TTC 2011 Compiler Optimization Case with GrGen.NET","authors":"Sebastian Buchwald, Edgar Jakumeit","doi":"10.4204/EPTCS.74.7","DOIUrl":"https://doi.org/10.4204/EPTCS.74.7","url":null,"abstract":"The challenge of the Compiler Optimization Case is to perform local optimizations and instruction selection on the graph-based intermediate representation of a compiler. The case is designed to compare participating tools regarding their performance. We tackle this task employing the general purpose graph rewrite system GrGen.NET (www.grgen.net).","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":"115912323","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 presents the Henshin solution to the Model Transformations for Program Understanding case study as part of the Transformation Tool Contest 2011.
{"title":"Solving the TTC 2011 Reengineering Case with Henshin","authors":"Stefan Jurack, Johannes Tietje","doi":"10.4204/EPTCS.74.17","DOIUrl":"https://doi.org/10.4204/EPTCS.74.17","url":null,"abstract":"This paper presents the Henshin solution to the Model Transformations for Program Understanding case study as part 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":"131180633","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 discusses the GReTL reference solution of the TTC 2011 Reengineering case. Given a Java syntax graph, a simple state machine model has to be extracted. The submitted solution covers both the core task and the two extension tasks.
{"title":"Solving the TTC 2011 Reengineering Case with GReTL","authors":"Tassilo Horn","doi":"10.4204/EPTCS.74.12","DOIUrl":"https://doi.org/10.4204/EPTCS.74.12","url":null,"abstract":"This paper discusses the GReTL reference solution of the TTC 2011 Reengineering case. Given a Java syntax graph, a simple state machine model has to be extracted. The submitted solution covers both the core task and the two extension tasks.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591550","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 GMF model migration case of the Transformation Tool Contest 2011.
本文概述了2011年转换工具大赛GMF模型迁移案例的Edapt解决方案。
{"title":"Solving the TTC 2011 Model Migration Case with Edapt","authors":"Markus Herrmannsdoerfer","doi":"10.4204/EPTCS.74.5","DOIUrl":"https://doi.org/10.4204/EPTCS.74.5","url":null,"abstract":"This paper gives an overview of the Edapt solution to the GMF model migration case of the Transformation Tool Contest 2011.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127129399","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 Hello World 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. The case study consists of a set of simple transformation tasks which covers the basic functions required for a transformation language, such as creating, reading/querying, updating and deleting of model elements. We design a transformation for each of the tasks.
{"title":"Saying HelloWorld with QVTR-XSLT - A Solution to the TTC 2011 Instructive Case","authors":"Dan Li, Xiaoshan Li, V. Stolz","doi":"10.4204/EPTCS.74.20","DOIUrl":"https://doi.org/10.4204/EPTCS.74.20","url":null,"abstract":"In this short paper we present our solution for the Hello World 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. The case study consists of a set of simple transformation tasks which covers the basic functions required for a transformation language, such as creating, reading/querying, updating and deleting of model elements. We design a transformation for each of the tasks.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569344","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
扫码关注我们
求助内容：
应助结果提醒方式：