@article{MTMT:34609659, title = {Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic}, url = {https://m2.mtmt.hu/api/publication/34609659}, author = {Schneider, Sven and Maximova, Maria and Giese, Holger}, doi = {10.1016/j.jlamp.2023.100938}, journal-iso = {J LOG ALGEBR METHODS}, journal = {JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING}, volume = {137}, unique-id = {34609659}, issn = {2352-2208}, abstract = {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.}, keywords = {quantitative analysis; qualitative analysis; Cyber-physical systems; Bounded Model Checking; probabilistic timed systems}, year = {2024}, eissn = {2352-2216} } @article{MTMT:33005335, title = {Fast rule-based graph programs}, url = {https://m2.mtmt.hu/api/publication/33005335}, author = {Campbell, Graham and Courtehoute, Brian and Plump, Detlef}, doi = {10.1016/j.scico.2021.102727}, journal-iso = {SCI COMPUT PROGRAM}, journal = {SCIENCE OF COMPUTER PROGRAMMING}, volume = {214}, unique-id = {33005335}, issn = {0167-6423}, abstract = {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.}, keywords = {Graph transformation; Linear-time algorithms; Depth-first search; Graph reduction; Rooted graph programs}, year = {2022}, eissn = {1872-7964} } @article{MTMT:33362096, title = {Exploring Natural Language Processing in Model-To-Model Transformations}, url = {https://m2.mtmt.hu/api/publication/33362096}, author = {Danenas, Paulius and Skersys, Tomas}, doi = {10.1109/ACCESS.2022.3219455}, journal-iso = {IEEE ACCESS}, journal = {IEEE ACCESS}, volume = {10}, unique-id = {33362096}, issn = {2169-3536}, abstract = {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.}, keywords = {data mining; Information analysis; Terminology; Unified Modeling Language; natural language processing; natural language processing; Information Extraction; Solid modeling; Context modeling; Relation extraction; process models; Model-to-Model Transformation; acronym detection; use-case models}, year = {2022}, eissn = {2169-3536}, pages = {116942-116958}, orcid-numbers = {Danenas, Paulius/0000-0002-2054-0624} } @article{MTMT:33003761, title = {A benchmark of incremental model transformation tools based on an industrial case study with AADL}, url = {https://m2.mtmt.hu/api/publication/33003761}, author = {Mkaouar, Hana and Blouin, Dominique and Borde, Etienne}, doi = {10.1007/s10270-022-00989-z}, journal-iso = {SOFTW SYST MODEL}, journal = {SOFTWARE AND SYSTEMS MODELING}, unique-id = {33003761}, issn = {1619-1366}, abstract = {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.}, keywords = {BENCHMARK; AADL; MoTe; Incremental model transformations; eMoflon; VIATRA; YAMTL}, year = {2022}, eissn = {1619-1374} } @article{MTMT:32387574, title = {Formal testing of timed graph transformation systems using metric temporal graph logic}, url = {https://m2.mtmt.hu/api/publication/32387574}, author = {Schneider, Sven and Maximova, Maria and Sakizloglou, Lucas and Giese, Holger}, doi = {10.1007/s10009-020-00585-w}, journal-iso = {INT J SOFTW TOOLS TECHN TRANSFER}, journal = {INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER}, volume = {23}, unique-id = {32387574}, issn = {1433-2779}, abstract = {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.}, keywords = {Formal testing; Typed attributed symbolic graphs; Timed graph transformation; Graph conditions; Metric temporal graph logic}, year = {2021}, eissn = {1433-2787}, pages = {411-488}, orcid-numbers = {Giese, Holger/0000-0002-4723-730X} } @article{MTMT:31451822, title = {SEET: Symbolic Execution of ETL Transformations}, url = {https://m2.mtmt.hu/api/publication/31451822}, author = {Azizi, Banafsheh and Zamani, Bahman and Kolahdouz-Rahimi, Shekoufeh}, doi = {10.1016/j.jss.2020.110675}, journal-iso = {J SYST SOFTWARE}, journal = {JOURNAL OF SYSTEMS AND SOFTWARE}, volume = {168}, unique-id = {31451822}, issn = {0164-1212}, abstract = {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.}, keywords = {Symbolic execution; Model-Driven Engineering (MDE); Epsilon Transformation Language (ETL); Verification of model transformations; Metamodel footprint}, year = {2020}, eissn = {1873-1228} } @article{MTMT:31451824, title = {Claimed advantages and disadvantages of (dedicated) model transformation languages: a systematic literature review}, url = {https://m2.mtmt.hu/api/publication/31451824}, author = {Goetz, Stefan and Tichy, Matthias and Groner, Raffaela}, doi = {10.1007/s10270-020-00815-4}, journal-iso = {SOFTW SYST MODEL}, journal = {SOFTWARE AND SYSTEMS MODELING}, unique-id = {31451824}, issn = {1619-1366}, abstract = {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.}, keywords = {model transformation; DSL; advantages; disadvantages; Model transformation language; MDSE}, year = {2020}, eissn = {1619-1374} } @article{MTMT:31703114, title = {Systematic mapping study on domain-specific language development tools}, url = {https://m2.mtmt.hu/api/publication/31703114}, author = {Iung, Anibal and Carbonell, Joao and Marchezan, Luciano and Rodrigues, Elder and Bernardino, Maicon and Basso, Fabio Paulo and Medeiros, Bruno}, doi = {10.1007/s10664-020-09872-1}, journal-iso = {EMPIR SOFTW ENG}, journal = {EMPIRICAL SOFTWARE ENGINEERING}, volume = {25}, unique-id = {31703114}, issn = {1382-3256}, abstract = {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.}, keywords = {systematic review; DSL; Systematic mapping study; Model driven engineering; domain-specific language; Language Workbench; DSL-supporting tools}, year = {2020}, eissn = {1573-7616}, pages = {4205-4249} } @article{MTMT:31703115, title = {Modeling and Analyzing Graph Algorithms by Means of Graph Transformation Units}, url = {https://m2.mtmt.hu/api/publication/31703115}, author = {Kreowski, Hans-Joerg and Kuske, Sabine}, doi = {10.5381/jot.2020.19.3.a9}, journal-iso = {J OBJECT TECHNOL}, journal = {JOURNAL OF OBJECT TECHNOLOGY}, volume = {19}, unique-id = {31703115}, issn = {1660-1769}, abstract = {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.}, keywords = {Graph algorithms; graph transformation units; massive parallelism}, year = {2020} } @article{MTMT:31063815, title = {Developing a model-driven reengineering approach for migrating PL/SQL triggers to Java: A practical experience}, url = {https://m2.mtmt.hu/api/publication/31063815}, author = {Fernandez Candel, Carlos Javier and Garcia Molina, Jesus and Bermudez Ruiz, Francisco Javier and Hoyos Barcelo, Jose Ramon and Sevilla Ruiz, Diego and Cuesta Viera, Benito Jose}, doi = {10.1016/j.jss.2019.01.068}, journal-iso = {J SYST SOFTWARE}, journal = {JOURNAL OF SYSTEMS AND SOFTWARE}, volume = {151}, unique-id = {31063815}, issn = {0164-1212}, abstract = {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.}, keywords = {Reengineering; Model-driven development; KDM; Software modernization; Oracle forms; Model-driven software modernization}, year = {2019}, eissn = {1873-1228}, pages = {38-64}, orcid-numbers = {Fernandez Candel, Carlos Javier/0000-0002-3835-9428; Bermudez Ruiz, Francisco Javier/0000-0003-1250-2318} } @article{MTMT:3393434, title = {Survey and classification of model transformation tools}, url = {https://m2.mtmt.hu/api/publication/3393434}, author = {Kahani, N and Bagherzadeh, M and Cordy, JR and Dingel, J and Varró, Dániel}, doi = {10.1007/s10270-018-0665-6}, journal-iso = {SOFTW SYST MODEL}, journal = {SOFTWARE AND SYSTEMS MODELING}, volume = {18}, unique-id = {3393434}, issn = {1619-1366}, year = {2019}, eissn = {1619-1374}, pages = {2361-2397}, orcid-numbers = {Varró, Dániel/0000-0002-8790-252X} } @article{MTMT:27600558, title = {Case-based exploration of bidirectional transformations in QVT Relations}, url = {https://m2.mtmt.hu/api/publication/27600558}, author = {Westfechtel, Bernhard}, doi = {10.1007/s10270-016-0527-z}, journal-iso = {SOFTW SYST MODEL}, journal = {SOFTWARE AND SYSTEMS MODELING}, volume = {17}, unique-id = {27600558}, issn = {1619-1366}, year = {2018}, eissn = {1619-1374}, pages = {989-1029} } @article{MTMT:26800845, title = {Geometric modeling: Consistency preservation using two-layered variable substitutions}, url = {https://m2.mtmt.hu/api/publication/26800845}, author = {Bellet, T and Arnould, A and Belhaouari, H and Le Gall, P}, doi = {10.1007/978-3-319-61470-0_3}, journal-iso = {LECT NOTES ARTIF INT}, journal = {LECTURE NOTES IN ARTIFICIAL INTELLIGENCE}, volume = {10373}, unique-id = {26800845}, issn = {0302-9743}, year = {2017}, pages = {36-53} } @article{MTMT:26753422, title = {Truly Parallel Model-Matching Algorithm in OpenCL}, url = {https://m2.mtmt.hu/api/publication/26753422}, author = {Fekete, Tamas and Mezei, Gergely}, doi = {10.1007/978-3-319-57141-6_13}, editor = {Silhavy, R and Silhavy, P and Prokopova, Z and Senkerik, R and Oplatkova, ZK}, journal-iso = {ADV INT SYST COMPUT}, journal = {ADVANCES IN INTELLIGENT SYSTEMS AND COMPUTING}, volume = {575}, unique-id = {26753422}, issn = {2194-5357}, year = {2017}, eissn = {2194-5365}, pages = {116-125} } @article{MTMT:27344144, title = {An Exploratory Experiment on Metamodel-Transformation Co-Evolution}, url = {https://m2.mtmt.hu/api/publication/27344144}, author = {Khelladi, Djamel Eddine and Rodriguez, Horacio Hoyos and Kretschmer, Roland and Egyed, Alexander}, doi = {10.1109/APSEC.2017.68}, editor = {Lv, J and Zhang, H and Hinchey, M and Liu, X}, journal-iso = {Asia-Pacific Software Engineering Conference}, journal = {Asia-Pacific Software Engineering Conference}, volume = {2017}, unique-id = {27344144}, issn = {1530-1362}, year = {2017}, pages = {576-581} } @article{MTMT:26569223, title = {The physics of software tools: SWOT analysis and vision}, url = {https://m2.mtmt.hu/api/publication/26569223}, author = {Steffen, Bernhard}, doi = {10.1007/s10009-016-0446-x}, journal-iso = {INT J SOFTW TOOLS TECHN TRANSFER}, journal = {INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER}, volume = {19}, unique-id = {26569223}, issn = {1433-2779}, year = {2017}, eissn = {1433-2787}, pages = {1-7} } @article{MTMT:27344145, title = {Automatic Generation of Monitoring Code for Model Based Analysis of Runtime Behaviour}, url = {https://m2.mtmt.hu/api/publication/27344145}, author = {Szvetits, Michael and Zdun, Uwe}, doi = {10.1109/APSEC.2017.81}, editor = {Lv, J and Zhang, H and Hinchey, M and Liu, X}, journal-iso = {Asia-Pacific Software Engineering Conference}, journal = {Asia-Pacific Software Engineering Conference}, volume = {2017}, unique-id = {27344145}, issn = {1530-1362}, year = {2017}, pages = {660-665} } @CONFERENCE{MTMT:26800846, title = {Generic approach for pattern matching with OpenCL}, url = {https://m2.mtmt.hu/api/publication/26800846}, author = {Fekete, T and Mezei, G}, booktitle = {24th High Performance Computing Symposium, HPC 2016, Part of the 2016 Spring Simulation Multi-Conference, SpringSim 2016}, publisher = {SCS}, unique-id = {26800846}, year = {2016}, pages = {106-113} } @article{MTMT:3092063, title = {Road to a reactive and incremental model transformation platform: three generations of the VIATRA framework}, url = {https://m2.mtmt.hu/api/publication/3092063}, author = {Varró, Dániel and Bergmann, Gábor and Hegedüs, Ábel and Horváth, Á and Ráth, István Zoltán and Ujhelyi, Zoltán}, doi = {10.1007/s10270-016-0530-4}, journal-iso = {SOFTW SYST MODEL}, journal = {SOFTWARE AND SYSTEMS MODELING}, volume = {15}, unique-id = {3092063}, issn = {1619-1366}, year = {2016}, eissn = {1619-1374}, pages = {609-629}, orcid-numbers = {Varró, Dániel/0000-0002-8790-252X; Bergmann, Gábor/0000-0002-2556-2582; Hegedüs, Ábel/0000-0002-8940-4348; Ujhelyi, Zoltán/0000-0002-2091-6441} } @article{MTMT:25471265, title = {Evaluating and comparing language workbenches Existing results and benchmarks for the future}, url = {https://m2.mtmt.hu/api/publication/25471265}, author = {Erdweg, Sebastian and van der Storm, Tijs and Voelter, Markus and Tratt, Laurence and Bosman, Remi and Cook, William R and Gerritsen, Albert and Hulshout, Angelo and Kelly, Steven and Loh, Alex and Konat, Gabriel and Molina, Pedro J and Palatnik, Martin and Pohjonen, Risto and Schindler, Eugen and Schindler, Klemens and Solmi, Riccardo and Vergu, Vlad and Visser, Eelco and van der Vlist, Kevin and Wachsmuth, Guido and van der Woning, Jimi}, doi = {10.1016/j.cl.2015.08.007}, journal-iso = {COMPUT LANG SYST STR}, journal = {COMPUTER LANGUAGES SYSTEMS & STRUCTURES}, volume = {44}, unique-id = {25471265}, issn = {1477-8424}, year = {2015}, eissn = {1873-6866}, pages = {24-47} } @inproceedings{MTMT:2992543, title = {Creating a GPGPU-accelerated framework for pattern matching using a case study}, url = {https://m2.mtmt.hu/api/publication/2992543}, author = {Fekete, Tamás and Mezei, Gergely}, booktitle = {International Conference on Computer as a Tool, IEEE EUROCON 2015}, doi = {10.1109/EUROCON.2015.7313740}, unique-id = {2992543}, year = {2015} } @inproceedings{MTMT:2992545, title = {Towards creating a GPGPU-accelerated framework for pattern matching}, url = {https://m2.mtmt.hu/api/publication/2992545}, author = {Fekete, Tamás and Mezei, Gergely}, booktitle = {SISY 2015: IEEE 13th International Symposium on Intelligent Systems and Informatics}, doi = {10.1109/SISY.2015.7325353}, unique-id = {2992545}, year = {2015}, pages = {67-72} } @book{MTMT:26800849, title = {From requirements to java in a snap: Model-driven requirements engineering in practice}, url = {https://m2.mtmt.hu/api/publication/26800849}, isbn = {9783319128382}, author = {Śmiałek, M and Nowakowski, W}, doi = {10.1007/978-3-319-12838-2}, publisher = {Springer Netherlands}, unique-id = {26800849}, year = {2015} } @article{MTMT:26800848, title = {Skeblle: A new kind of diagramming tool with programmable active diagrams}, url = {https://m2.mtmt.hu/api/publication/26800848}, author = {Sunkara, VK and Sane, A}, doi = {10.1007/978-3-662-46823-4_23}, journal-iso = {LECT NOTES ARTIF INT}, journal = {LECTURE NOTES IN ARTIFICIAL INTELLIGENCE}, volume = {8974}, unique-id = {26800848}, issn = {0302-9743}, year = {2015}, pages = {273-287} } @inproceedings{MTMT:26800851, title = {A case study for evaluating bidirectional transformations in QVT relations}, url = {https://m2.mtmt.hu/api/publication/26800851}, author = {Westfechtel, B}, booktitle = {10th International Conference on Evaluation of Novel Approaches to Software Engineering, ENASE 2015}, publisher = {SciTePress Science and Technology Publications, Lda}, unique-id = {26800851}, year = {2015}, pages = {141-155} } @article{MTMT:25471333, title = {Staged Translation of Graph Transformation Rules}, url = {https://m2.mtmt.hu/api/publication/25471333}, author = {Winetzhammer, Sabine and Westfechtel, Bernhard}, doi = {10.1007/978-3-319-25156-1_9}, editor = {Hammoudi, S and Pires, LF and Filipe, J and DasNeves, RC}, journal-iso = {COMMUN COMPUT INFORM SCI}, journal = {COMMUNICATIONS IN COMPUTER AND INFORMATION SCIENCE}, volume = {506}, unique-id = {25471333}, issn = {1865-0929}, year = {2015}, eissn = {1865-0937}, pages = {134-152} } @article{MTMT:24902776, title = {Guest editors' introduction to the first issue on Experimental Software Engineering in the Cloud (ESEiC)}, url = {https://m2.mtmt.hu/api/publication/24902776}, author = {Van, Gorp Pieter and Rose, Louis}, doi = {10.1016/j.scico.2013.12.007}, journal-iso = {SCI COMPUT PROGRAM}, journal = {SCIENCE OF COMPUTER PROGRAMMING}, volume = {85}, unique-id = {24902776}, issn = {0167-6423}, year = {2014}, eissn = {1872-7964}, pages = {1-4} }