Search Results

(Find other images)
ImageContained in Bundle
GROOVE solution for Compiler Optimization
Description: PDF Authors: Arend Rensink and Eduardo Zambon.

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.

TTC11
TTC11-EMFTVM
Description: Live Tranformation Tool Contest 2011 - EMFTVM Solution
TTC11
TTC11-EMFTVM-Helloworld
Description: Transformation Tool Contest 2011 - EMFTVM Solution for the Hello World case. NOTE: the "TTC2011" Eclipse project needs to be cleaned first: select "Project -> Clean..." from the main menu, and clean all projects.
TTC11
PETE solution to the TTC11 Hello World case
Description: PETE solution to the TTC11 Hello World case. Author: Bernhard Schätz
TTC11
VIATRA2 solution for Hello world and Program understanding
Description:

PDF of submission 29
Authors: Ábel Hegedüs, Zoltán Ujhelyi and Gábor Bergmann

The paper presents a solution of the Hello World! An Instructive Case for TTC case study of the Transformation Tool Contest 2011, using the Viatra2 model transformation tool. The solution provides both GT-based and ASM based (basically imperative control structure) solution to the tasks of the case study.

PDF of submission 30
Authors: Ábel Hegedüs, Zoltán Ujhelyi and Gábor Bergmann

The current paper presents a solution of the Model Transformations for Program Understanding: A Reengineering Challenge case study of the Transformation Tool Contest 2011, using the Viatra2 model transformation tool. The solution includes a one-click execution mode of the case study transformation either over xmi files or java code, and also provides the means to manually reproduce the transformation.

TTC11
Viatra2 solution to the TCC11 Live Contest
Description: Viatra solution to the TTC11 live contest challenge
TTC11
Basic Linux (Ubuntu 10) image for TTC11
Description: Basic Ubuntu 10 operating system image for the TTC11 bundle. The username/password combination for the Ubuntu system is ubuntu/reverse. See virtualboximages.com for more information about this image.

Credits: Contributed by Tassilo Horn (installation of JDK, etc.)

TTC11
GReTL solutions for Program Understanding, Hello World and Compiler Optimization
Description: PDF of submission 7, PDF of submission 8, PDF of submission 79

Author: Tassilo Horn

Abstract 1: In Software Reenineering, 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. Any reengineering project's first task is to gather an understanding on what the system does, and how it does it. Therefore, a common approach is to use parsers to translate the source code of the legacy system 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 regenerate more abstract models of the system's architecture.

This transformation case deals with the creation of a state machine model out of a Java syntaxgraph model. It is derived from a task that has been coped with in a real reengineering project.

Abstract 2:This paper discusses the GReTL solution of the TTC 2011 Compiler Optimization case. The submitted solution covers both the constant folding task as well as 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.

Abstract 3: This paper discusses the GReTL reference solution of the TTC 2011 Program Understanding case. The submitted solution covers both the core task as well as the two extension tasks.

TTC11
Ubuntu_10.04_TTC11_gretl-cases_plus_live.vdi
Description: GReTL solution to the TTC11 live contest
TTC11
Henshin solution for Program Understanding and Hello World (Linux, v2)
Description: PDF of submission 17

Authors: Stefan Jurack and Johannes Tietje.

Paper title 1: Model Transformation for Program Understanding with EMF Henshin

Abstract 1: In this paper we give an overview of our approach of transforming JaMoPP based Java models into simple state machine models (case study 1 of TTC 2011). The transformation has been implemented using Henshin, an Eclipse plug-in providing visual modeling and execution of rule-based model transformations for EMF based models.

Paper title 2: Hello World! An Instructive Case for TTC 2011 with EMF Henshin

Abstract 2: In this paper we present Henshin, a tool set for rule-based EMF model transformation, along the Hello World case study of the TTC 2011. It is especially intended to show basic language concepts and constructs by means of basic operations implemented using our tool. Nevertheless, we also introduce even more sophisticated features of Henshin, e.g., control structures and parameter passing. Our transformation language is mainly presented using dedicated visual editors.

TTC11
UML-RSDS Solution for TTC11 Hello World Case and GMF Model Migration Case
Description: Authors: Kevin Lano, Shekoufeh Kolahdouz Rahimi

Paper Tittle: Hello world Case Study Transformation Specification

Abstract: In this paper we apply UML-RSDS notation and tools to the "HelloWorld" case studies and explain the underlying development process for this model transformation approach.

TTC11
XP-TUe_TTC10_uml-rsds-livecontest_TTC11_i.vdi
Description: none
TTC11
Basic Windows XP image for TTC11
Description: Basic Windows XP operating system image for the TTC11 bundle. For academic users only.
TTC11
Edapt solutions for Hello World, Program Understanding and GMF Model Migration
Description: Author: Markus Herrmannsdoerfer

Paper title: The Edapt Solution for the Hello World Case

Abstract: This paper gives an overview of the Edapt solution to the hello world case of the Transformation Tool Contest 2011.

Paper title: The Edapt Solution for the Reengineering Case

Abstract: This paper gives an overview of the Edapt solution to the reengineering case of the Transformation Tool Contest 2011.

Paper title: The Edapt Solution for the GMF Model Migration Case

Abstract: This paper gives an overview of the Edapt solution to the GMF model migration case of the Transformation Tool Contest 2011.

TTC11
Hello World and Model Migration with Epsilon!
Description:

The Epsilon solution to the Hello World case.

Epsilon is an integrated and extensible platform of languages for model management, that is interoperable with EMF, MDR and XML models. This image demonstrates several of the Epsilon languages including EOL (the core language), EGL (for model-to-text transformation), EVL (for model validation), Flock (for model migration).

Further details can be found in the accompanying solution description.

TTC11
GrGen.NET solution for Program Understanding, original version
Description: PDF of submission 15

Authors: Edgar Jakumeit and Sebastian Buchwald.

Paper Title: A GrGen.NET solution of the Reengineering Case for the Transformation Tool Contest 2011

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.

TTC11
GrGen.NET solution for Hello World, Compiler Optimization, Program Understanding
Description: This share image contains GrGen.NET solutions for the Hello World, Compiler Optimization and Program Understanding challenges.

GrGen.NET: transformation of structures made easy.

The Graph Rewrite Generator offers declarative languages for graph modeling, pattern matching, and rewriting, as well as rule control; brought to life by a compiler emitting highly efficient assemblies and a rapid prototyping environment offering graphical and step-wise debugging.

PDF of submission 15

Authors: Edgar Jakumeit and Sebastian Buchwald.

Paper Title: A GrGen.NET solution of the Reengineering Case for the Transformation Tool Contest 2011

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.

PDF of submission 31

Authors: Sebastian Buchwald and Edgar Jakumeit.

Paper Title: A GrGen.NET solution of the Hello World Case for the Transformation Tool Contest 2011

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.

PDF of submission 32

Authors: Sebastian Buchwald and Edgar Jakumeit.

Paper Title: A GrGen.NET Solution of the Compiler Case for the Transformation Tool Contest 2011

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).

TTC11
GROOVE solution for Hello World
Description: PDF of submission 13

Authors: Amir Hossein Ghamarian, Maarten De Mol, Arend Rensink and Eduardo Zambon.

Paper title: Solving the Hello World Case with GROOVE

Abstract: We provide and explain a GROOVE solution to the Hello world case study for TTC11.

TTC11
Program Understanding Challenge and Hello World Using MOLA
Description: The Program Understanding (Reengineering) Challenge 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 SHARE demo contains the solution of the task using model transformation language MOLA. The MOLA solution uses higher-order transformation (HOT) 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 which are not the developers of the language can achieve the desired functionality more easily. Description. Additionaly this SHARE Demo contains the MOLA solution to the Hello World case. Description.
TTC11
Live Contest - MOLA
Description: This is the MOLA solution to the live contest of the Transformation Tool Contest 2011
TTC11
MDELab solutions for Program Understanding and Hello World
Description: Authors: Stephan Hildebrandt, Sebastian Wätzoldt and Holger Giese.

Title 1: Executing Graph Transformations with the MDELab Story Diagram Interpreter

Abstract 1: This paper presents our solution for the case study “Model Transformations for Program Understanding” of the Transformation Tool Contest 2011. We briefly explain how we solved the case study using a domain specific language called story diagrams and highlight the advantages of our interpretation framework for story diagrams. We also mention some difficulties, which we encountered.

Title 2: MDELab Story Diagram Interpreter - Hello World Case Study Solution

Abstract 2: This paper presents our solution for the Hello World case study of the Transformation Tool Contest 2011. We briefly explain how we solved the case study using story diagrams. A more thorough explanation of story diagrams can be found in our solution of the more complex case study “Model Transformations for Program Understanding”.

TTC11
XP-TUe_TTC11_sdm-hpi_MDELab.vdi
Description: none
TTC11
QVTR-XSLT solutions to the TTC11 Hello World and Compiler Optimization case studies
Description: PDF of submission 18

Authors: Dan Li, Xiaoshan Li (Faculty of Science and Technology, University of Macau, China) and Volker Stolz (University of Oslo, Norway & UNU-IIST, Macau, China)

Title: Solving the Hello World Case with QVTR-XSLT

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 [1]. The tool supports editing and execution of the graphical notation of QVT Relations language [4]. 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. We begin by giving a brief introduction of the QVTR-XSLT tool in Section 2. Section 3 provides the solutions for the tasks of the case study. We discuss the conclusion in Section 4. Details of the transformation definitions are presented in the appendices.

PDF of submission 19.

Authors: Dan Li, Xiaoshan Li (Faculty of Science and Technology, University of Macau, China) and Volker Stolz (University of Oslo, Norway & UNU-IIST, Macau, China)

Title: Solving the Compiler Optimization Case with QVTR-XSLT

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 [1]. The tool supports editing and execution of the graphical notation of QVT Relations language [4]. The case study addresses the problem of optimizing the intermediate representation of compiled program code. This problem consists of two tasks: local optimization and instruction selection. The first task mainly concerns constant folding which evaluates operations with only constant operands, corresponding control flows are also optimized. The instruction selection task transforms the intermediate representation into a target representation of similar structure. We begin by giving a brief introduction of the QVTR-XSLT tool in Section 2. Section 3 explains the design of transformations for the case study. We discuss the experimental result and evaluation of the solution against the criteria given in the case specification in Section 4.

TTC11
SHARE Logo