发布求助
文献互助 智能选刊 最新文献

Transformation Tool Contest最新文献

筛选
英文 中文
An NMF solution for the Petri Nets to State Charts case study at the TTC 2013 NMF解决方案Petri网状态图在TTC 2013的案例研究
Transformation Tool Contest Pub Date : 2013-11-29 DOI: 10.4204/EPTCS.135.12
Georg Hinkel, Thomas Goldschmidt, Lucia Happe
{"title":"An NMF solution for the Petri Nets to State Charts case study at the TTC 2013","authors":"Georg Hinkel, Thomas Goldschmidt, Lucia Happe","doi":"10.4204/EPTCS.135.12","DOIUrl":"https://doi.org/10.4204/EPTCS.135.12","url":null,"abstract":"Software systems are getting more and more complex. Model-driven engineering (MDE) offers ways to handle such increased complexity by lifting development to a higher level of abstraction. A key part in MDE are transformations that transform any given model into another. These transformations are used to generate all kinds of software artifacts from models. However, there is little consensus about the transformation tools. Thus, the Transformation Tool Contest (TTC) 2013 aims to compare different transformation engines. This is achieved through three different cases that have to be tackled. One of these cases is the Petri Net to State Chart case. A solution has to transform a Petri Net to a State Chart and has to derive a hierarchical structure within the State Chart. This paper presents the solution for this case using NMF Transformations as transformation engine.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114263910","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}
引用次数: 7
Solving the Class Diagram Restructuring Transformation Case with FunnyQT 用FunnyQT解决类图重构转换案例
Transformation Tool Contest Pub Date : 2013-11-01 DOI: 10.4204/EPTCS.135.9
Tassilo Horn
{"title":"Solving the Class Diagram Restructuring Transformation Case with FunnyQT","authors":"Tassilo Horn","doi":"10.4204/EPTCS.135.9","DOIUrl":"https://doi.org/10.4204/EPTCS.135.9","url":null,"abstract":"FunnyQT is a model querying and model transformation library for the functional Lisp-dialect Clojure providing a rich and efficient querying and transformation API. \u0000This paper describes the FunnyQT solution to the TTC 2013 Class Diagram Restructuring Transformation Case. This solution and the GROOVE solution share the best overall solution award for this case.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"248 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114220096","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}
引用次数: 3
Case study: Class diagram restructuring 案例研究:类图重组
Transformation Tool Contest Pub Date : 2013-09-02 DOI: 10.4204/EPTCS.135.2
K. Lano, Shekoufeh Kolahdouz Rahimi
{"title":"Case study: Class diagram restructuring","authors":"K. Lano, Shekoufeh Kolahdouz Rahimi","doi":"10.4204/EPTCS.135.2","DOIUrl":"https://doi.org/10.4204/EPTCS.135.2","url":null,"abstract":"This case study is an update-in-placerefactoringtransformationon UML class diagrams. Its aim is toremove clones of attributes from a class diagram, and to identify new classes which abstract groupsof classes that share common data features.It is used as one of a general collection of transformations (such as the removal of redundantinheritance, or multiple inheritance) which aim to improve the quality of a specification or designlevel class diagram.The transformationis a typical example of a model refactoring,and illustrates the issues involvedin such transformations.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237714","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}
引用次数: 17
Analyzing Flowgraphs with ATL 用ATL分析流程图
Transformation Tool Contest Pub Date : 2013-06-19 DOI: 10.4204/EPTCS.135.4
Valerio Cosentino, M. Tisi, Fabian Büttner
{"title":"Analyzing Flowgraphs with ATL","authors":"Valerio Cosentino, M. Tisi, Fabian Büttner","doi":"10.4204/EPTCS.135.4","DOIUrl":"https://doi.org/10.4204/EPTCS.135.4","url":null,"abstract":"This paper presents a solution to the Flowgraphs case study for the Transformation Tool Contest 2013 (TTC 2013). Starting from Java source code, we execute a chain of model transformations to derive a simplified model of the program, its control flow graph and its data flow graph. Finally we develop a model transformation that validates the program flow by comparing it with a set of flow specifications written in a domain specific language. The proposed solution has been implemented using ATL.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"33 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126289528","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}
引用次数: 1
Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive Case 用MOLA说Hello World——TTC 2011的一个解决方案
Transformation Tool Contest Pub Date : 2011-11-20 DOI: 10.4204/EPTCS.74.21
E. Kalniņa, A. Kalnins, A. Sostaks, Janis Iraids, E. Celms
{"title":"Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive Case","authors":"E. Kalniņa, A. Kalnins, A. Sostaks, Janis Iraids, E. Celms","doi":"10.4204/EPTCS.74.21","DOIUrl":"https://doi.org/10.4204/EPTCS.74.21","url":null,"abstract":"This paper describes the solution of Hello World transformations in MOLA transformation language. Transformations implementing the task are relatively straightforward and easily inferable from the task specification. The required additional steps related to model import and export are also described.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125126127","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}
引用次数: 1
Solving the TTC 2011 Reengineering Case with GrGen.NET 用GrGen解决TTC 2011重构案例。网
Transformation Tool Contest Pub Date : 2011-11-20 DOI: 10.4204/EPTCS.74.16
Edgar Jakumeit, Sebastian Buchwald
{"title":"Solving the TTC 2011 Reengineering Case with GrGen.NET","authors":"Edgar Jakumeit, Sebastian Buchwald","doi":"10.4204/EPTCS.74.16","DOIUrl":"https://doi.org/10.4204/EPTCS.74.16","url":null,"abstract":"The challenge of the Reengineering Case is to extract a state machine model out of the abstract syntax graph of a Java program. The extracted state machine offers a reduced view on the full program graph and thus helps to understand the program regarding the question of interest. We tackle this task employing the general purpose graph rewrite system GrGen.NET (www.grgen.net).","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121961177","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}
引用次数: 1
Saying Hello World with Edapt - A Solution to the TTC 2011 Instructive Case 用Edapt说Hello World——TTC 2011的一个解决方案
Transformation Tool Contest Pub Date : 2011-11-20 DOI: 10.4204/EPTCS.74.18
Markus Herrmannsdoerfer
{"title":"Saying Hello World with Edapt - A Solution to the TTC 2011 Instructive Case","authors":"Markus Herrmannsdoerfer","doi":"10.4204/EPTCS.74.18","DOIUrl":"https://doi.org/10.4204/EPTCS.74.18","url":null,"abstract":"This paper gives an overview of the Edapt solution to the hello world case of the Transformation Tool Contest 2011.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123482513","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}
引用次数: 0
GMF: A Model Migration Case for the Transformation Tool Contest GMF:转换工具竞赛的模型迁移案例
Transformation Tool Contest Pub Date : 2011-11-20 DOI: 10.4204/EPTCS.74.1
Markus Herrmannsdoerfer
{"title":"GMF: A Model Migration Case for the Transformation Tool Contest","authors":"Markus Herrmannsdoerfer","doi":"10.4204/EPTCS.74.1","DOIUrl":"https://doi.org/10.4204/EPTCS.74.1","url":null,"abstract":"Using a real-life evolution taken from the Graphical Modeling Framework, we invite submissions to explore ways in which model transformation and migration tools can be used to migrate models in response to metamodel adaptation.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122009433","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}
引用次数: 14
Saying Hello World with Henshin - A Solution to the TTC 2011 Instructive Case 用Henshin说Hello World——TTC 2011的一个解决方案
Transformation Tool Contest Pub Date : 2011-11-20 DOI: 10.4204/EPTCS.74.22
Stefan Jurack, Johannes Tietje
{"title":"Saying Hello World with Henshin - A Solution to the TTC 2011 Instructive Case","authors":"Stefan Jurack, Johannes Tietje","doi":"10.4204/EPTCS.74.22","DOIUrl":"https://doi.org/10.4204/EPTCS.74.22","url":null,"abstract":"This paper gives an overview of the Henshin solution to the Hello World case study of the Transformation Tool Contest 2011, intended to show basic language concepts and constructs.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122057003","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}
引用次数: 3
Saying Hello World with VIATRA2 - A Solution to the TTC 2011 Instructive Case 用VIATRA2说Hello World——TTC 2011的一个解决方案
Transformation Tool Contest Pub Date : 2011-11-20 DOI: 10.4204/EPTCS.74.25
Ábel Hegedüs, Z. Ujhelyi, Gábor Bergmann
{"title":"Saying Hello World with VIATRA2 - A Solution to the TTC 2011 Instructive Case","authors":"Ábel Hegedüs, Z. Ujhelyi, Gábor Bergmann","doi":"10.4204/EPTCS.74.25","DOIUrl":"https://doi.org/10.4204/EPTCS.74.25","url":null,"abstract":"The paper presents a solution of the Hello World! An Instructive Case for the Transformation Tool Contest using the VIATRA2 model transformation tool.","PeriodicalId":266655,"journal":{"name":"Transformation Tool Contest","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116725800","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}
引用次数: 5
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信