TY - JOUR AU - Schneider, Sven AU - Maximova, Maria AU - Giese, Holger TI - Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic JF - JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING J2 - J LOG ALGEBR METHODS VL - 137 PY - 2024 PG - 48 SN - 2352-2208 DO - 10.1016/j.jlamp.2023.100938 UR - https://m2.mtmt.hu/api/publication/34609659 ID - 34609659 AB - Cyber-physical systems often encompass complex concurrent behavior with timing constraints and probabilistic failures on demand. The analysis whether such systems with probabilistic timed behavior adhere to a given specification is essential. The formalism of Interval Probabilistic Timed Graph Transformation Systems (IPTGTSs) is often a suitable choice to model cyber-physical systems because (a) its rule-based approach to graph transformation can capture a wide range of system's structure dynamics when the states of the system can be represented by graphs while (b) it employs interval specifications for probabilistic behavior as well as lower and upper bounds on delays of steps to support systems where precise probabilities and delays are not known or may change during the runtime of the system. Probabilistic Metric Temporal Graph Logic (PMTGL) has been introduced as a powerful specification language to express worst-case/best-case probabilistic timed requirements such as actor-based soft deadlines using (a) path properties relying on its Metric Temporal Graph Logic fragment to track individual graph elements and (b) an operator inherited from Probabilistic Timed Computation Tree Logic to express worst-case/best-case probabilistic requirements identifying worst-case/best-case resolutions of non-determinism. Bounded Model Checking (BMC) support for Probabilistic Timed Graph Transformation Systems (PTGTSs) w.r.t. properties specified using PMTGL has been already presented. However, for IPTGTSs no analysis support w.r.t. PMTGL properties has been developed for stating metric temporal properties on identified subgraphs and their structural changes over time.In this paper, we adapt the BMC approach developed for PTGTSs to the case of IPTGTSs extending modeling and analysis support to the usage of probability intervals more appropriately covering cyber-physical systems where probabilistic effects cannot be specified precisely and need to be approximated instead. In our evaluation, we apply an implementation of our BMC approach in AUTOGRAPH to a novel running example demonstrating the effect of using probability intervals instead of precise probability values. LA - English DB - MTMT ER - TY - JOUR AU - Campbell, Graham AU - Courtehoute, Brian AU - Plump, Detlef TI - Fast rule-based graph programs JF - SCIENCE OF COMPUTER PROGRAMMING J2 - SCI COMPUT PROGRAM VL - 214 PY - 2022 PG - 32 SN - 0167-6423 DO - 10.1016/j.scico.2021.102727 UR - https://m2.mtmt.hu/api/publication/33005335 ID - 33005335 AB - Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time implementations of graph algorithms in GP 2, an experimental programming language based on graph transformation rules which aims to facilitate program analysis and verification. We focus on two classes of rule-based graph programs: graph reduction programs which check some graph property, and programs using a depth-first search to test some property or perform an operation such as producing a 2-colouring or a topological sorting. Programs of the first type run in linear time without any constraints on input graphs while programs of the second type require input graphs of bounded degree to run in linear time. Essential for achieving the linear time complexity are so-called rooted rules in GP 2, which, in many situations, can be matched in constant time. For each of our programs, we prove both correctness and complexity, and also give empirical evidence for their runtime. (C) 2021 The Author(s). Published by Elsevier B.V. LA - English DB - MTMT ER - TY - JOUR AU - Danenas, Paulius AU - Skersys, Tomas TI - Exploring Natural Language Processing in Model-To-Model Transformations JF - IEEE ACCESS J2 - IEEE ACCESS VL - 10 PY - 2022 SP - 116942 EP - 116958 PG - 17 SN - 2169-3536 DO - 10.1109/ACCESS.2022.3219455 UR - https://m2.mtmt.hu/api/publication/33362096 ID - 33362096 AB - In this paper, we explore the possibility to apply natural language processing in visual model-to-model (M2M) transformations. Therefore, we present our research results on information extraction from text labels in process models modeled using Business Process Modeling Notation (BPMN) and use case models depicted in Unified Modeling Language (UML) using the most recent developments in natural language processing (NLP). Here, we focus on three relevant tasks, namely, the extraction of verb/noun phrases that would be used to form relations, parsing of conjunctive/disjunctive statements, and the detection of abbreviations and acronyms. Techniques combining state-of-the-art NLP language models with formal regular expressions grammar-based structure detection were implemented to solve relation extraction task. To achieve these goals, we benchmark the most recent state-of-the-art NLP tools (CoreNLP, Stanford Stanza, Flair, Spacy, AllenNLP, BERT, ELECTRA), as well as custom BERT-BiLSTM-CRF and ELMo-BiLSTM-CRF implementations, trained with certain data augmentations to improve performance on the most ambiguous cases; these tools are further used to extract noun and verb phrases from short text labels generally used in UML and BPMN models. Furthermore, we describe our attempts to improve these extractors by solving the abbreviation/acronym detection problem using machine learning-based detection, as well as process conjunctive and disjunctive statements, due to their relevance to performing advanced text normalization. The obtained results show that the best phrase extraction and conjunctive phrase processing performance was obtained using Stanza based implementation, yet, our trained BERT-BiLSTM-CRF outperformed it for the verb phrase detection task. While this work was inspired by our ongoing research on partial model-to-model transformations, we believe it to be applicable in other areas requiring similar text processing capabilities as well. LA - English DB - MTMT ER - TY - JOUR AU - Mkaouar, Hana AU - Blouin, Dominique AU - Borde, Etienne TI - A benchmark of incremental model transformation tools based on an industrial case study with AADL JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL PY - 2022 PG - 27 SN - 1619-1366 DO - 10.1007/s10270-022-00989-z UR - https://m2.mtmt.hu/api/publication/33003761 ID - 33003761 AB - Incremental model transformation (IMT) tools have been proposed to improve performances of model transformations by updating only the parts of a model that need to be changed when another model on which it depends has been changed. Yet, the question is how these tools are suitable for modeling large and complex systems with rich modeling languages as used in industry. In this paper, we report the results of a benchmark of the most mature IMT tools. Particularly, we benchmark MoTE, eMoflon, VIATRA and YAMTL to evaluate their usability, maintainability and runtime performances. Our benchmark is based on a model transformation of an industrial case study using the standard architecture description language AADL. We propose a reusable evaluation framework, available for tool developers and users. Besides the capability to process large models, our benchmark also assesses IMT tool performances according to the different kinds of complex structures that typically exist in models of rich languages, as well as the complexity of the transformation specifications. Our results show the promising potential of some tools to specify sophisticated specifications and transform large models with good performance, but their use still requires the help of their developers, especially to solve serious problems with their runtime performance. LA - English DB - MTMT ER - TY - JOUR AU - Schneider, Sven AU - Maximova, Maria AU - Sakizloglou, Lucas AU - Giese, Holger TI - Formal testing of timed graph transformation systems using metric temporal graph logic JF - INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER J2 - INT J SOFTW TOOLS TECHN TRANSFER VL - 23 PY - 2021 IS - 3 SP - 411 EP - 488 PG - 78 SN - 1433-2779 DO - 10.1007/s10009-020-00585-w UR - https://m2.mtmt.hu/api/publication/32387574 ID - 32387574 AB - Embedded real-time systems generate state sequences where time elapses between state changes. Ensuring that such systems adhere to a provided specification of admissible or desired behavior is essential. Formal model-based testing is often a suitable cost-effective approach. We introduce an extended version of the formalism of symbolic graphs, which encompasses types as well as attributes, for representing states of dynamic systems. Relying on this extension of symbolic graphs, we present a novel formalism of timed graph transformation systems (TGTSs) that supports the model-based development of dynamic real-time systems at an abstract level where possible state changes and delays are specified by graph transformation rules. We then introduce an extended form of the metric temporal graph logic (MTGL) with increased expressiveness to improve the applicability of MTGL for the specification of timed graph sequences generated by a TGTS. Based on the metric temporal operators of MTGL and its built-in graph binding mechanics, we express properties on the structure and attributes of graphs as well as on the occurrence of graphs over time that are related by their inner structure. We provide formal support for checking whether a single generated timed graph sequence adheres to a provided MTGL specification. Relying on this logical foundation, we develop a testing framework for TGTSs that are specified using MTGL. Lastly, we apply this testing framework to a running example by using our prototypical implementation in the tool AutoGraph. LA - English DB - MTMT ER - TY - JOUR AU - Azizi, Banafsheh AU - Zamani, Bahman AU - Kolahdouz-Rahimi, Shekoufeh TI - SEET: Symbolic Execution of ETL Transformations JF - JOURNAL OF SYSTEMS AND SOFTWARE J2 - J SYST SOFTWARE VL - 168 PY - 2020 PG - 34 SN - 0164-1212 DO - 10.1016/j.jss.2020.110675 UR - https://m2.mtmt.hu/api/publication/31451822 ID - 31451822 AB - Model transformations are known as the main pillar of model-driven approaches. A model transformation is a program, written in a transformation language, to convert a model into another model or code. Similar to any other program, model transformations need to be verified. The problem is that some transformation errors, e.g., logical errors, can only be detected via execution. Our focus in this research is on the Epsilon Transformation Language (ETL), one of the most extensively used model transformation languages. Lack of approaches to detecting logical errors in ETL transformations is a gap which needs to be addressed.In this paper, we present an approach to symbolic execution of ETL transformations and detecting logical errors. The approach uses a constraint solver to assess the satisfiability of a path condition and generates a symbolic metamodel footprint which can be used to detect errors. The approach is corroborated by a tool that is integrated with Eclipse. To evaluate the approach, the precision and recall are calculated for two well-known case studies. The scalability is evaluated via nine experiments. The usefulness and usability aspects are evaluated in a subjective manner. The results show the improvement in the field of verifying ETL transformations. (C) 2020 Elsevier Inc. All rights reserved. LA - English DB - MTMT ER - TY - JOUR AU - Goetz, Stefan AU - Tichy, Matthias AU - Groner, Raffaela TI - Claimed advantages and disadvantages of (dedicated) model transformation languages: a systematic literature review JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL PY - 2020 PG - 35 SN - 1619-1366 DO - 10.1007/s10270-020-00815-4 UR - https://m2.mtmt.hu/api/publication/31451824 ID - 31451824 AB - There exists a plethora of claims about the advantages and disadvantages of model transformation languages compared to general-purpose programming languages. With this work, we aim to create an overview over these claims in the literature and systematize evidence thereof. For this purpose, we conducted a systematic literature review by following a systematic process for searching and selecting relevant publications and extracting data. We selected a total of 58 publications, categorized claims about model transformation languages into 14 separate groups and conceived a representation to track claims and evidence through the literature. From our results, we conclude that: (i) the current literature claims many advantages of model transformation languages but also points towards certain deficits and (ii) there is insufficient evidence for claimed advantages and disadvantages and (iii) there is a lack of research interest into the verification of claims. LA - English DB - MTMT ER - TY - JOUR AU - Iung, Anibal AU - Carbonell, Joao AU - Marchezan, Luciano AU - Rodrigues, Elder AU - Bernardino, Maicon AU - Basso, Fabio Paulo AU - Medeiros, Bruno TI - Systematic mapping study on domain-specific language development tools JF - EMPIRICAL SOFTWARE ENGINEERING J2 - EMPIR SOFTW ENG VL - 25 PY - 2020 IS - 5 SP - 4205 EP - 4249 PG - 45 SN - 1382-3256 DO - 10.1007/s10664-020-09872-1 UR - https://m2.mtmt.hu/api/publication/31703114 ID - 31703114 AB - Domain-specific languages (DSL) are programming or modeling languages devoted to a given application domain. There are many tools used to support the implementation of a DSL, making hard the decision-making process for one or another. In this sense, identifying and mapping their features is relevant for decision-making by academic and industrial initiative on DSL development. Objective: The goal of this work is to identify and map the tools, Language Workbenches (LW), or frameworks that were proposed to develop DSLs discussed and referenced in publications between 2012 and 2019. Method: A Systematic Mapping Study (SMS) of the literature scoping tools for DSL development. Results: We identified 59 tools, including 9 under a commercial license and 41 with non-commercial licenses, and analyzed their features from 230 papers. Conclusion: There is a substantial amount of tools that cover a large number of features. Furthermore, we observed that usually, the developer adopts one type of notation to implement the DSL: textual or graphical. We also discuss research gaps, such as a lack of tools that allow meta-meta model transformations and that support modeling tools interoperability. LA - English DB - MTMT ER - TY - JOUR AU - Kreowski, Hans-Joerg AU - Kuske, Sabine TI - Modeling and Analyzing Graph Algorithms by Means of Graph Transformation Units JF - JOURNAL OF OBJECT TECHNOLOGY J2 - J OBJECT TECHNOL VL - 19 PY - 2020 IS - 3 PG - 14 SN - 1660-1769 DO - 10.5381/jot.2020.19.3.a9 UR - https://m2.mtmt.hu/api/publication/31703115 ID - 31703115 AB - Graph transformation units are rule-based devices to specify processes on graphs and the dynamics of information-processing systems with graphs as states. In this article, we propose graph transformation units as a framework to model graph algorithms, to prove their correctness and to analyze their complexity. A specific emphasis is laid on the improvement of the efficiency of graph algorithms by massive parallelism. LA - English DB - MTMT ER - TY - JOUR AU - Fernandez Candel, Carlos Javier AU - Garcia Molina, Jesus AU - Bermudez Ruiz, Francisco Javier AU - Hoyos Barcelo, Jose Ramon AU - Sevilla Ruiz, Diego AU - Cuesta Viera, Benito Jose TI - Developing a model-driven reengineering approach for migrating PL/SQL triggers to Java: A practical experience JF - JOURNAL OF SYSTEMS AND SOFTWARE J2 - J SYST SOFTWARE VL - 151 PY - 2019 SP - 38 EP - 64 PG - 27 SN - 0164-1212 DO - 10.1016/j.jss.2019.01.068 UR - https://m2.mtmt.hu/api/publication/31063815 ID - 31063815 AB - Model-driven software engineering (MDE) techniques are not only useful in forward engineering scenarios, but can also be successfully applied to evolve existing systems. RAD (Rapid Application Development) platforms emerged in the nineties, but the success of modern software technologies motivated that a large number of enterprises tackled the migration of their RAD applications, such as Oracle Forms. Our research group has collaborated with a software company in developing a solution to migrate PL/SQL monolithic code on Forms triggers and program units to Java code separated in several tiers.Our research focused on the model-driven reengineering process applied to develop the migration tool for the conversion of PL/SQL code to Java. Legacy code is represented in form of KDM (KnowledgeDiscovery Metamodel) models. In this paper, we propose a software process to implement a model-driven re-engineering. This process integrates a TDD-like approach to incrementally develop model transformations with three kinds of validations for the generated code. The implementation and validation of the re-engineering approach are explained in detail, as well as the evaluation of some issues related with the application of MDE. (C) 2019 Published by Elsevier Inc. LA - English DB - MTMT ER - TY - JOUR AU - Kahani, N AU - Bagherzadeh, M AU - Cordy, JR AU - Dingel, J AU - Varró, Dániel TI - Survey and classification of model transformation tools JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 18 PY - 2019 IS - 4 SP - 2361 EP - 2397 PG - 37 SN - 1619-1366 DO - 10.1007/s10270-018-0665-6 UR - https://m2.mtmt.hu/api/publication/3393434 ID - 3393434 LA - English DB - MTMT ER - TY - JOUR AU - Westfechtel, Bernhard TI - Case-based exploration of bidirectional transformations in QVT Relations JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 17 PY - 2018 IS - 3 SP - 989 EP - 1029 PG - 41 SN - 1619-1366 DO - 10.1007/s10270-016-0527-z UR - https://m2.mtmt.hu/api/publication/27600558 ID - 27600558 LA - English DB - MTMT ER - TY - JOUR AU - Bellet, T AU - Arnould, A AU - Belhaouari, H AU - Le Gall, P TI - Geometric modeling: Consistency preservation using two-layered variable substitutions JF - LECTURE NOTES IN ARTIFICIAL INTELLIGENCE J2 - LECT NOTES ARTIF INT VL - 10373 PY - 2017 SP - 36 EP - 53 PG - 18 SN - 0302-9743 DO - 10.1007/978-3-319-61470-0_3 UR - https://m2.mtmt.hu/api/publication/26800845 ID - 26800845 LA - English DB - MTMT ER - TY - JOUR AU - Fekete, Tamas AU - Mezei, Gergely ED - Silhavy, R ED - Silhavy, P ED - Prokopova, Z ED - Senkerik, R ED - Oplatkova, ZK TI - Truly Parallel Model-Matching Algorithm in OpenCL JF - ADVANCES IN INTELLIGENT SYSTEMS AND COMPUTING J2 - ADV INT SYST COMPUT VL - 575 PY - 2017 IS - Zlin SP - 116 EP - 125 PG - 10 SN - 2194-5357 DO - 10.1007/978-3-319-57141-6_13 UR - https://m2.mtmt.hu/api/publication/26753422 ID - 26753422 LA - English DB - MTMT ER - TY - JOUR AU - Khelladi, Djamel Eddine AU - Rodriguez, Horacio Hoyos AU - Kretschmer, Roland AU - Egyed, Alexander ED - Lv, J ED - Zhang, H ED - Hinchey, M ED - Liu, X TI - An Exploratory Experiment on Metamodel-Transformation Co-Evolution JF - Asia-Pacific Software Engineering Conference J2 - Asia-Pacific Software Engineering Conference VL - 2017 PY - 2017 SP - 576 EP - 581 PG - 6 SN - 1530-1362 DO - 10.1109/APSEC.2017.68 UR - https://m2.mtmt.hu/api/publication/27344144 ID - 27344144 LA - English DB - MTMT ER - TY - JOUR AU - Steffen, Bernhard TI - The physics of software tools: SWOT analysis and vision JF - INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER J2 - INT J SOFTW TOOLS TECHN TRANSFER VL - 19 PY - 2017 IS - 1 SP - 1 EP - 7 PG - 7 SN - 1433-2779 DO - 10.1007/s10009-016-0446-x UR - https://m2.mtmt.hu/api/publication/26569223 ID - 26569223 LA - English DB - MTMT ER - TY - JOUR AU - Szvetits, Michael AU - Zdun, Uwe ED - Lv, J ED - Zhang, H ED - Hinchey, M ED - Liu, X TI - Automatic Generation of Monitoring Code for Model Based Analysis of Runtime Behaviour JF - Asia-Pacific Software Engineering Conference J2 - Asia-Pacific Software Engineering Conference VL - 2017 PY - 2017 SP - 660 EP - 665 PG - 6 SN - 1530-1362 DO - 10.1109/APSEC.2017.81 UR - https://m2.mtmt.hu/api/publication/27344145 ID - 27344145 LA - English DB - MTMT ER - TY - CONF AU - Fekete, T AU - Mezei, G TI - Generic approach for pattern matching with OpenCL T2 - 24th High Performance Computing Symposium, HPC 2016, Part of the 2016 Spring Simulation Multi-Conference, SpringSim 2016 PB - Society for Modeling and Simulation International (SCS) PB - Society for Modeling and Simulation International (SCS) PY - 2016 SP - 106 EP - 113 PG - 8 UR - https://m2.mtmt.hu/api/publication/26800846 ID - 26800846 N1 - A4 LA - English DB - MTMT ER - TY - JOUR AU - Varró, Dániel AU - Bergmann, Gábor AU - Hegedüs, Ábel AU - Horváth, Á AU - Ráth, István Zoltán AU - Ujhelyi, Zoltán TI - Road to a reactive and incremental model transformation platform: three generations of the VIATRA framework JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 15 PY - 2016 IS - 3 SP - 609 EP - 629 PG - 21 SN - 1619-1366 DO - 10.1007/s10270-016-0530-4 UR - https://m2.mtmt.hu/api/publication/3092063 ID - 3092063 N1 - Megjegyzés-26230249 Megjegyzés-27167935 OA gold LA - English DB - MTMT ER - TY - JOUR AU - Erdweg, Sebastian AU - van der Storm, Tijs AU - Voelter, Markus AU - Tratt, Laurence AU - Bosman, Remi AU - Cook, William R AU - Gerritsen, Albert AU - Hulshout, Angelo AU - Kelly, Steven AU - Loh, Alex AU - Konat, Gabriel AU - Molina, Pedro J AU - Palatnik, Martin AU - Pohjonen, Risto AU - Schindler, Eugen AU - Schindler, Klemens AU - Solmi, Riccardo AU - Vergu, Vlad AU - Visser, Eelco AU - van der Vlist, Kevin AU - Wachsmuth, Guido AU - van der Woning, Jimi TI - Evaluating and comparing language workbenches Existing results and benchmarks for the future JF - COMPUTER LANGUAGES SYSTEMS & STRUCTURES J2 - COMPUT LANG SYST STR VL - 44 PY - 2015 SP - 24 EP - 47 PG - 24 SN - 1477-8424 DO - 10.1016/j.cl.2015.08.007 UR - https://m2.mtmt.hu/api/publication/25471265 ID - 25471265 LA - English DB - MTMT ER - TY - CHAP AU - Fekete, Tamás AU - Mezei, Gergely ED - Grana, M ED - Corchado, E ED - Fraile-Ardanuy, J ED - Quintian, H ED - Kakarountas, A ED - Haase, J ED - Debono, CJ TI - Creating a GPGPU-accelerated framework for pattern matching using a case study T2 - International Conference on Computer as a Tool, IEEE EUROCON 2015 PB - Institute of Electrical and Electronics Engineers (IEEE) SN - 9781479985692 PY - 2015 PG - 6 DO - 10.1109/EUROCON.2015.7313740 UR - https://m2.mtmt.hu/api/publication/2992543 ID - 2992543 LA - English DB - MTMT ER - TY - CHAP AU - Fekete, Tamás AU - Mezei, Gergely ED - Szakál, Anikó TI - Towards creating a GPGPU-accelerated framework for pattern matching T2 - SISY 2015: IEEE 13th International Symposium on Intelligent Systems and Informatics PB - IEEE CY - New York, New York SN - 1467393886 T3 - International Symposium on Intelligent Systems and Informatics PY - 2015 SP - 67 EP - 72 PG - 6 DO - 10.1109/SISY.2015.7325353 UR - https://m2.mtmt.hu/api/publication/2992545 ID - 2992545 LA - English DB - MTMT ER - TY - BOOK AU - Śmiałek, M AU - Nowakowski, W TI - From requirements to java in a snap: Model-driven requirements engineering in practice PB - Springer Netherlands PY - 2015 SN - 9783319128382 DO - 10.1007/978-3-319-12838-2 UR - https://m2.mtmt.hu/api/publication/26800849 ID - 26800849 LA - English DB - MTMT ER - TY - JOUR AU - Sunkara, VK AU - Sane, A TI - Skeblle: A new kind of diagramming tool with programmable active diagrams JF - LECTURE NOTES IN ARTIFICIAL INTELLIGENCE J2 - LECT NOTES ARTIF INT VL - 8974 PY - 2015 SP - 273 EP - 287 PG - 15 SN - 0302-9743 DO - 10.1007/978-3-662-46823-4_23 UR - https://m2.mtmt.hu/api/publication/26800848 ID - 26800848 LA - English DB - MTMT ER - TY - CHAP AU - Westfechtel, B ED - Filipe, J ED - Maciaszek, L TI - A case study for evaluating bidirectional transformations in QVT relations T2 - 10th International Conference on Evaluation of Novel Approaches to Software Engineering, ENASE 2015 PB - SciTePress SN - 9789897581007 PB - SciTePress PY - 2015 SP - 141 EP - 155 PG - 15 UR - https://m2.mtmt.hu/api/publication/26800851 ID - 26800851 N1 - A4 Institute for Systems and Technologies of Information, Control and Communication (INSTICC) LA - English DB - MTMT ER - TY - JOUR AU - Winetzhammer, Sabine AU - Westfechtel, Bernhard ED - Hammoudi, S ED - Pires, LF ED - Filipe, J ED - DasNeves, RC TI - Staged Translation of Graph Transformation Rules JF - COMMUNICATIONS IN COMPUTER AND INFORMATION SCIENCE J2 - COMMUN COMPUT INFORM SCI VL - 506 PY - 2015 IS - Lisbon SP - 134 EP - 152 PG - 19 SN - 1865-0929 DO - 10.1007/978-3-319-25156-1_9 UR - https://m2.mtmt.hu/api/publication/25471333 ID - 25471333 LA - English DB - MTMT ER - TY - JOUR AU - Van, Gorp Pieter AU - Rose, Louis TI - Guest editors' introduction to the first issue on Experimental Software Engineering in the Cloud (ESEiC) JF - SCIENCE OF COMPUTER PROGRAMMING J2 - SCI COMPUT PROGRAM VL - 85 PY - 2014 SP - 1 EP - 4 PG - 4 SN - 0167-6423 DO - 10.1016/j.scico.2013.12.007 UR - https://m2.mtmt.hu/api/publication/24902776 ID - 24902776 LA - English DB - MTMT ER -