| |||||||||||||
TTC 2013 : Transformation Tools Contest | |||||||||||||
Link: http://planet-sl.org/ttc2013 | |||||||||||||
| |||||||||||||
Call For Papers | |||||||||||||
=== Call for Solutions: Transformation Tool Contest (TTC) 2013 ===
TTC Homepage: http://planet-research20.org/ttc2013/ Part of STAF 2013, Budapest, Hungary: http://stafconferences.info/ == New Dates for TTC: 19th and 20th June == Please note that to afford greater opportunities for attending both TTC and ICMT (http://www.model-transformation.org), the TTC organisers have opted to hold TTC 2013 on the 19th and 20th June rather than on the 18th and 19th June as previously advertised. == Summary == The 2013 Transformation Tool Contest (TTC) seeks your solutions to three challenging transformation problems, involving flow graphs, class diagram restructuring and constructing state charts from Petri nets. The deadline for solution descriptions is 25 March 2013, immediately followed by a round of open, peer reviewing. As in previous editions, solution descriptions will be published in a post-proceedings volume, and potentially lead to continued collaboration for producing a per-case journal article. == About TTC == The aim of this event is to compare the expressiveness, the usability and the performance of graph and model transformation tools along a number of selected case studies. A deeper understanding of the relative merits of different tool features will help to further improve graph and model transformation tools and to indicate open problems. This contest is the sixth of its kind (after an AGTiVE 2007 session, as GraBaTs 2008 and 2009 workshops, and as the TTC 2010 and 2011 workshops). For the fourth time, the contest is co-located with the international conference on model transformation (ICMT). Teams from the major international research groups in the development and use of model transformation tools are expected to participate in the TTC again. == TTC Procedure == = [Past] Phase 1: Case proposal submission = In order to facilitate the comparison of transformation tools, we have selected three challenging case studies: * the TTC 2013 Flowgraphs case (submitted by Tassilo Horn), * the TTC 2013 Class Diagram Restructuring case (submitted by Kevin Lano and Shekoufeh Kolahdouz Rahimi), * the TTC 2013 Petri-Nets to Statecharts case (submitted by Pieter Van Gorp and Louis Rose). Important: The case descriptions are currently being refined based on the feedback of our program committee. The core challenges will remain the same though. Revised/extended versions will be made available via the contest website latest by 25 February (or sooner via the contest forum). The contest forum will also enable interaction between the case submitters and the solution developers.Participants who have not yet solved the TTC 2011 Hello World case by Mazanek yet are also welcome to additionally tackle that case. Unlike for the 2011 edition, solving this "fourth" case is not a requirement for submitting solutions to the main cases. However, we encourage participants to solve the Hello World case as it would enable other contest participants as well as readers of follow-up articles to get an overview of all TTC related transformation approaches using a single coherent running example. = [Present] Phase 2: Case solution submission = All those who like to participate in the contest are now asked to choose one or more case studies, take their favorite transformation tool and submit their solutions. A submission should consist of a paper and the actual solution. The paper should include a description of the chosen case study variant (if any) and a presentation of the chosen solution, including a discussion of design decisions. Examples can be explored at the website of TTC 2011. Solutions should be submitted via Easychair by 25 March 2013. Before the same deadline, each case study solution (tool, project files, docs) should be made available for review and demonstration via SHARE. For submissions via Easychair, sign-up and instructions to SHARE, please visit: * Easychair submission page: http://www.easychair.org/conferences?conf=ttc2013 * SHARE sign-up: http://is.tm.tue.nl/staff/pvgorp/share/?page=Signup&bundlename=TTC13 * SHARE wiki: http://fmt.cs.utwente.nl/redmine/wiki/grabats/SHARE The major novelty of TTC 2011 was that the solution reviewing before the workshop was not done by the program committee anymore but rather by peers, i.e. the other solution submitters. All solution submitters had to review three other solutions to the case that they had addressed. Due to the success of that format, TTC 2013 adopts the same approach: solution reviews are not anonymous, some of the reviewers even play the role of solution opponents during the workshop in Budapest. The purpose of the peer reviewing is that the participants get as much insight into the competitors’ solutions as possible and also to raise potential problems. If the peer reviewing process reveals major problems in a solution or if a submission does not fulfill the basic requirements of a solution, it may get rejected early already. However, partial solutions have the chance of getting accepted, if they cover the core or an interesting aspect of the problem. = [Future] Phase 3: Workshop and live contest = Besides the presentations of the submitted solutions, the workshop will comprise a live contest. For more details (such as reference solutions for the case studies, testcases, online forum discussions, and refinements to the original case descriptions), please consult the TTC website. == Publication procedure == For TTC 2013 there will be three more or less formal publication opportunities: 1. The informal pre-proceedings will appear on the TTC website. They contain the descriptions of the accepted cases and all the solution papers. 2. After the workshop there will be more formal workshop proceedings. Solution submitters have to consider and address the opponents' statements. The resulting solution papers will be reviewed by the TTC program committee. A selection of revised solution papers together with the case descriptions will be published in the workshop proceedings which are currently planned to appear in EPTCS (similar to the proceedings of the 2011 edition). 3. Finally, we aim at one journal publication per case. Those articles will introduce the case and compare the solutions from a high-level perspective. Also the results of the evaluation sheets filled in during the workshop will be considered. These articles will be compiled and edited by the case submitters together with the workshop organizers. == Important dates == * Solution submission deadline: 25 March 2013 * Open peer review deadline: 8 April 2013 * Notification of acceptance: 29 April 2013 * Workshop with live contest: 19-20 June 2013 == Organizing Committee == * Christian Krause (Hasso-Plattner-Institute, Germany) * Louis Rose (University of York, United Kingdom) * Pieter Van Gorp (Eindhoven University of Technology, The Netherlands) == Steering Committee == * Richard Paige (University of York, United Kingdom) * Arend Rensink (University of Twente, The Netherlands) * Bernhard Schätz (Technical University Munich, Germany) * Albert Zündorf (University of Kassel, Germany) == Program Committee == * Harrie Jan Sander Bruggink (University of Duisburg-Essen, Germany) * Christian Krause (Hasso-Plattner-Institute, Germany) * Ralf Lämmel (University of Koblenz-Landau, Germany) * Sonja Maier (Bundeswehr University Munich, Germany) * Bart Meyers (University of Antwerp, Belgium) * Anantha Narayanan (Vanderbilt University, Nashville, Tennessee) * Richard Paige (University of York, United Kingdom) * Arend Rensink (University of Twente, The Netherlands) * Louis Rose (University of York, United Kingdom) * Bernhard Schätz (Technische Universität München, Germany) * Gabriele Taentzer (University of Marburg, Germany) * Pieter Van Gorp (Eindhoven University of Technolgoy, The Netherlands) * Gergely Várro (Technische Universität Darmstadt, Germany) * Jurgen Vinju (Universiteit van Amsterdam, The Netherlands) * Bernhard Westfechtel (University of Bayreuth, Germany) * Albert Zündorf (University of Kassel, Germany) |
|