TY - JOUR AU - John, Stefan AU - Kosiol, Jens AU - Lambers, Leen AU - Taentzer, Gabriele TI - A graph-based framework for model-driven optimization facilitating impact analysis of mutation operator properties JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL PY - 2023 PG - 38 SN - 1619-1366 DO - 10.1007/s10270-022-01078-x UR - https://m2.mtmt.hu/api/publication/33890784 ID - 33890784 AB - Optimization problems in software engineering typically deal with structures as they occur in the design and maintenance of software systems. In model-driven optimization (MDO), domain-specific models are used to represent these structures while evolutionary algorithms are often used to solve optimization problems. However, designing appropriate models and evolutionary algorithms to represent and evolve structures is not always straightforward. Domain experts often need deep knowledge of how to configure an evolutionary algorithm. This makes the use of model-driven meta-heuristic search difficult and expensive. We present a graph-based framework for MDO that identifies and clarifies core concepts and relies on mutation operators to specify evolutionary change. This framework is intended to help domain experts develop and study evolutionary algorithms based on domain-specific models and operators. In addition, it can help in clarifying the critical factors for conducting reproducible experiments in MDO. Based on the framework, we are able to take a first step toward identifying and studying important properties of evolutionary operators in the context of MDO. As a showcase, we investigate the impact of soundness and completeness at the level of mutation operator sets on the effectiveness and efficiency of evolutionary algorithms. LA - English DB - MTMT ER - TY - JOUR AU - Soldner, Robert AU - Plump, Detlef TI - Towards Mechanised Proofs in Double-Pushout Graph Transformation JF - ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE J2 - ELECTRON PROC THEOR COMPUT SCI PY - 2022 IS - 374 SP - 59 EP - 75 PG - 17 SN - 2075-2180 DO - 10.4204/EPTCS.374.6 UR - https://m2.mtmt.hu/api/publication/34277514 ID - 34277514 AB - We formalise the basics of the double-pushout approach to graph transformation in the proof assistant Isabelle/HOL and provide associated machine-checked proofs. Specifically, we formalise graphs, graph morphisms and rules, and a definition of direct derivations based on deletion and gluing. We then formalise graph pushouts and prove with Isabelle's help that both deletions and gluings are pushouts. We also prove that pushouts are unique up to isomorphism. The formalisation comprises around 2000 lines of source text. Our motivation is to pave the way for rigorous, machine-checked proofs in the theory of the double-pushout approach, and to lay the foundations for verifying graph transformation systems and rule-based graph programs by interactive theorem proving. LA - English DB - MTMT ER - TY - JOUR AU - Brenas, Jon Hael AU - Shaban-Nejad, Arash TI - Proving the Correctness of Knowledge Graph Update: A Scenario From Surveillance of Adverse Childhood Experiences JF - FRONTIERS IN BIG DATA J2 - FRONT BIG DATA VL - 4 PY - 2021 PG - 9 SN - 2624-909X DO - 10.3389/fdata.2021.660101 UR - https://m2.mtmt.hu/api/publication/32379486 ID - 32379486 AB - Knowledge graphs are a modern way to store information. However, the knowledge they contain is not static. Instances of various classes may be added or deleted and the semantic relationship between elements might evolve as well. When such changes take place, a knowledge graph might become inconsistent and the knowledge it conveys meaningless. In order to ensure the consistency and coherency of dynamic knowledge graphs, we propose a method to model the transformations that a knowledge graph goes through and to prove that the new transformations do not yield inconsistencies. To do so, we express the knowledge graphs as logically decorated graphs, then we describe the transformations as algorithmic graph transformations and we use a Hoare-like verification process to prove correctness. To demonstrate the proposed method in action, we use examples from Adverse Childhood Experiences (ACEs), which is a public health crisis. LA - English DB - MTMT ER - TY - JOUR AU - Tomaszek, Stefan AU - Speith, Roland AU - Schuerr, Andy TI - Virtual network embedding: ensuring correctness and optimality by construction using model transformation and integer linear programming techniques JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 20 PY - 2021 IS - 4 SP - 1299 EP - 1332 PG - 34 SN - 1619-1366 DO - 10.1007/s10270-020-00852-z UR - https://m2.mtmt.hu/api/publication/32389784 ID - 32389784 AB - Virtualization technology allows service providers to operate data centers in a cost-effective and scalable manner. The data center network (substrate network) and the applications executed in the data center (virtual networks) are often modeled as graphs. The nodes of the graphs represent (physical or virtual) servers and switches, and the edges represent communication links. Nodes and links are annotated with the provided and required resources (e.g., memory and bandwidth). The NP-hard virtual network embedding (VNE) problem deals with the embedding of a set of virtual networks to the substrate network such that (i) all (resource) constraints of the substrate network are fulfilled, and (ii) an objective is optimized (e.g., minimizing the communication costs). The existing two-step highly customizable model-driven virtual network embedding (MdVNE) approach combines model transformation (MT) and integer linear programming (ILP) techniques to solve the VNE problem based on a declarative specification. MdVNE generates element mapping candidates from an MT specification and identifies an optimal and correct embeddings using an ILP solver. In the past, developers created the MT and ILP specifications manually and needed to ensure carefully that both are compatible and respect the problem description. In this article, we present a novel construction methodology for synthesizing the MT and ILP specification from a given declarative model-based VNE problem description. This problem description consists of a metamodel for substrate and virtual networks, additional OCL constraints, and an objective function that assigns costs to a given model. This methodology ensures that the derived embeddings are correct w.r.t. the metamodel and the OCL constraints, and optimal w.r.t. the optimization goal. The novel model-based VNE specification is applicable to different network domains, environments, and constraints. Thus, the construction methodology allows to automate most of the steps to realize a correct and optimal VNE algorithm compared to a hand-crafted VNE implementation. Furthermore, the simulative evaluation confirms that using MT techniques reduces the time for solving the VNE problem considerably in comparison with a purely ILP-based approach. 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 - Kluge, R. AU - Stein, M. AU - Varró, G. AU - Schürr, A. AU - Hollick, M. AU - Mühlhäuser, M. TI - A systematic approach to constructing families of incremental topology control algorithms using graph transformation JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 18 PY - 2019 IS - 1 SP - 279 EP - 319 PG - 41 SN - 1619-1366 DO - 10.1007/s10270-017-0587-8 UR - https://m2.mtmt.hu/api/publication/30650843 ID - 30650843 N1 - Real-Time Systems Lab, TU Darmstadt, Merckstraße 25, Darmstadt, 64283, Germany Telecooperation Group, TU Darmstadt, Hochschulstraße 10, Darmstadt, 64289, Germany Secure Mobile Networking Lab, TU Darmstadt, Mornewegstr. 32, Darmstadt, 64293, Germany Cited By :4 Export Date: 25 April 2019 Correspondence Address: Kluge, R.; Real-Time Systems Lab, TU Darmstadt, Merckstraße 25, Germany; email: roland.kluge@es.tu-darmstadt.de LA - English DB - MTMT ER - TY - JOUR AU - Tigane, Samir AU - Kahloul, Laid AU - Benharzallah, Saber AU - Baarir, Souheib AU - Bourekkache, Samir TI - Reconfigurable GSPNs: A modeling formalism of evolvable discrete-event systems JF - SCIENCE OF COMPUTER PROGRAMMING J2 - SCI COMPUT PROGRAM VL - 183 PY - 2019 PG - 21 SN - 0167-6423 DO - 10.1016/j.scico.2019.102302 UR - https://m2.mtmt.hu/api/publication/31063806 ID - 31063806 AB - Nowadays, a wide range of systems are becoming structurally dynamic, variably interconnected, and highly complex. The use of classical formal approaches, such as Petri nets, in the design of such systems becomes neither convenient nor sufficient. Indeed, they cannot handle, in a natural way, the dynamic structure and the growing complexity of modern systems.Introducing reconfigurability in Petri nets, as well as generalized stochastic Petri nets increases the modeling power, but decreases the applicability of analysis techniques. In fact, several properties become undecidableIn this paper, we extend generalized stochastic Petri nets to a reconfigurable formalism, while maintaining verifiability with reduced complexity. The proposed approach identifies a set of properties that are preserved after reconfiguration. These properties are decidable with reduced time and space complexity. The use of the proposed formalism is illustrated through a running example. (C) 2019 Elsevier B.V. All rights reserved. LA - English DB - MTMT ER - TY - JOUR AU - Brenas, Jon Hael AU - Strecker, Martin AU - Echahed, Rachid AU - Shaban-Nejad, Arash TI - Applied Graph Transformation and Verification With Use Cases in Malaria Surveillance JF - IEEE ACCESS J2 - IEEE ACCESS VL - 6 PY - 2018 SP - 64728 EP - 64741 PG - 14 SN - 2169-3536 DO - 10.1109/ACCESS.2018.2878311 UR - https://m2.mtmt.hu/api/publication/30558176 ID - 30558176 AB - Malaria is one of the leading causes of death and illness in sub-Saharan Africa. In order to make timely decisions for control and elimination of malaria, researchers, and clinicians need access to integrated consistent knowledge sources. These knowledge sources often rely on dynamic and constantly changing databases and ontologies. It is crucial to manage changes and ensure that these changes do not cause inconsistencies in the integrated knowledge source. To this end, we propose the use of a formal model using graph transformations to monitor and manage the changes in a coherent way while preserving the consistency of the integrated structure through classical verification. In this paper, we use an algorithmic approach to graph transformation, instead of the more classical algebraic approach, to express the evolution of the data and ontological structures. In this model, each transformation is the result of applying rules to the graph, where the left-hand side is used to select a subgraph and the right-hand side is a sequence of elementary actions to be performed. Strategies are used to define how transformation rules should be applied. This approach enables us to define a Hoare-like calculus that can be used to verify the transformations and manage the changes. In this paper, we demonstrate the feasibility and significance of the proposed method through different use cases in malaria surveillance. LA - English DB - MTMT ER - TY - CHAP AU - Lambers, Leen AU - Strueber, Daniel AU - Taentzer, Gabriele AU - Born, Kristopher AU - Huebert, Jevgenij TI - Multi-Granular Conflict and Dependency Analysis in Software Engineering based on Graph Transformation T2 - PROCEEDINGS 2018 IEEE/ACM 40TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE) PB - IEEE CY - New York, New York PY - 2018 SP - 716 EP - 727 PG - 12 DO - 10.1145/3180155.3180258 UR - https://m2.mtmt.hu/api/publication/30558174 ID - 30558174 AB - Conflict and dependency analysis (CDA) of graph transformation has been shown to be a versatile foundation for understanding interactions in many software engineering domains, including software analysis and design, model-driven engineering, and testing. In this paper, we propose a novel static CDA technique that is multi-granular in the sense that it can detect all conflicts and dependencies on multiple granularity levels. Specifically, we provide an efficient algorithm suite for computing binary, coarse-grained, and fine-grained conflicts and dependencies: Binary granularity indicates the presence or absence of conflicts and dependencies, coarse granularity focuses on root causes for conflicts and dependencies, and fine granularity shows each conflict and dependency in full detail. Doing so, we can address specific performance and usability requirements that we identified in a literature survey of CDA usage scenarios. In an experimental evaluation, our algorithm suite computes conflicts and dependencies rapidly. Finally, we present a user study, in which the participants found our coarse-grained results more understandable than the fine-grained ones reported in a state-of-the-art tool. Our overall contribution is twofold: (i) we significantly speed up the computation of fine-grained and binary CDA results and, (ii) complement them with coarse-grained ones, which offer usability benefits for numerous use cases. LA - English DB - MTMT ER - TY - JOUR AU - Strueber, D AU - Rubin, J AU - Arendt, T AU - Chechik, M AU - Taentzer, G AU - Ploeger, J TI - Variability-based model transformation: formal foundation and application JF - FORMAL ASPECTS OF COMPUTING J2 - FORM ASP COMPUT VL - 30 PY - 2018 IS - 1 SP - 133 EP - 162 PG - 30 SN - 0934-5043 DO - 10.1007/s00165-017-0441-3 UR - https://m2.mtmt.hu/api/publication/27351350 ID - 27351350 LA - English DB - MTMT ER - TY - JOUR AU - Gabmeyer, S AU - Kaufmann, P AU - Seidl, Martina AU - Gogolla, M AU - Kappel, G TI - A feature-based classification of formal verification techniques for software models JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 2017 PY - 2017 SP - 1 EP - 26 PG - 26 SN - 1619-1366 DO - 10.1007/s10270-017-0591-z UR - https://m2.mtmt.hu/api/publication/3417124 ID - 3417124 LA - English DB - MTMT ER - TY - JOUR AU - Kluge, Roland AU - Stein, Michael AU - Varro, Gergely AU - Schuerr, Andy AU - Hollick, Matthias AU - Muehlhaeuser, Max TI - A systematic approach to constructing incremental topology control algorithms using graph transformation JF - JOURNAL OF VISUAL LANGUAGES AND COMPUTING J2 - J VISUAL LANG COMPUT VL - 38 PY - 2017 SP - 47 EP - 83 PG - 37 SN - 1045-926X DO - 10.1016/j.jvlc.2016.10.003 UR - https://m2.mtmt.hu/api/publication/26753411 ID - 26753411 LA - English DB - MTMT ER - TY - CHAP AU - Sanchez, Cuadrado Jesus AU - Guerra, Esther AU - de Lara, Juan AU - Clariso, Robert AU - Cabot, Jordi TI - Translating target to source constraints in model-to-model transformations T2 - 2017 ACM/IEEE 20TH INTERNATIONAL CONFERENCE ON MODEL DRIVEN ENGINEERING LANGUAGES AND SYSTEMS (MODELS 2017) PB - IEEE CY - New York, New York SN - 9781538634929 PB - IEEE PY - 2017 SP - 12 EP - 22 PG - 11 DO - 10.1109/MODELS.2017.12 UR - https://m2.mtmt.hu/api/publication/27319803 ID - 27319803 LA - English DB - MTMT ER - TY - JOUR AU - Strueber, Daniel AU - Born, Kristopher AU - Gill, Kanwal Daud AU - Groner, Raffaela AU - Kehrer, Timo AU - Ohrndorf, Manuel AU - Tichy, Matthias ED - Plump, D TI - Henshin: A Usability-Focused Framework for EMF Model Transformation Development JF - LECTURE NOTES IN ARTIFICIAL INTELLIGENCE J2 - LECT NOTES ARTIF INT VL - 10373 PY - 2017 IS - Marburg SP - 196 EP - 208 PG - 13 SN - 0302-9743 DO - 10.1007/978-3-319-61470-0_12 UR - https://m2.mtmt.hu/api/publication/27573158 ID - 27573158 LA - English DB - MTMT ER - TY - JOUR AU - Bottoni, Paolo AU - Fish, Andrew AU - Presicce, Francesco Parisi TI - Spider Graphs: a graph transformation system for spider diagrams JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 14 PY - 2015 IS - 4 SP - 1421 EP - 1453 PG - 33 SN - 1619-1366 DO - 10.1007/s10270-013-0381-1 UR - https://m2.mtmt.hu/api/publication/25471423 ID - 25471423 LA - English DB - MTMT ER - TY - JOUR AU - Kluge, Roland AU - Varro, Gergely AU - Schuerr, Andy TI - A Methodology for Designing Dynamic Topology Control Algorithms via Graph Transformation JF - LECTURE NOTES IN ARTIFICIAL INTELLIGENCE J2 - LECT NOTES ARTIF INT VL - 9152 PY - 2015 IS - LAquila SP - 199 EP - 213 PG - 15 SN - 0302-9743 DO - 10.1007/978-3-319-21155-8_15 UR - https://m2.mtmt.hu/api/publication/25471425 ID - 25471425 LA - English DB - MTMT ER - TY - JOUR AU - Lengyel, László AU - Charaf, Hassan TI - Open issues in model transformations for multimodal applications JF - JOURNAL ON MULTIMODAL USER INTERFACES J2 - J MULTIMODAL USER IN VL - 9 PY - 2015 IS - 4 SP - 377 EP - 385 PG - 9 SN - 1783-7677 DO - 10.1007/s12193-015-0192-5 UR - https://m2.mtmt.hu/api/publication/2926326 ID - 2926326 LA - English DB - MTMT ER - TY - JOUR AU - Lengyel, László TI - Validating Rule-based Algorithms JF - ACTA POLYTECHNICA HUNGARICA J2 - ACTA POLYTECH HUNG VL - 12 PY - 2015 IS - 4 SP - 59 EP - 75 PG - 17 SN - 1785-8860 DO - 10.12700/APH.12.4.2015.4.4 UR - https://m2.mtmt.hu/api/publication/2925179 ID - 2925179 LA - English DB - MTMT ER - TY - JOUR AU - Zhou, Yu AU - Huang, Yankai AU - Wei, Ou AU - Huang, Zhiqiu TI - Verifying specifications with associated attributes in graph transformation systems JF - FRONTIERS OF COMPUTER SCIENCE J2 - FRONT COMPUT SCI CHI VL - 9 PY - 2015 IS - 3 SP - 364 EP - 374 PG - 11 SN - 2095-2236 DO - 10.1007/s11704-015-4290-4 UR - https://m2.mtmt.hu/api/publication/24905399 ID - 24905399 LA - English DB - MTMT ER - TY - JOUR AU - Chen, Luxi AU - Huang, Linpeng AU - Li, Chen AU - Wu, Linzhu AU - Luo, Weichao ED - Chang, CK ED - Gao, Y ED - Hurson, A ED - Matskin, M ED - McMillin, B ED - Okabe, Y ED - Seceleanu, C ED - Yoshida, K TI - Design and Safety Analysis for System Architecture: A Breeze/ADL-based Approach JF - IEEE ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC) J2 - IEEE ANN INT COMPUT SOFTW APPL CONF VL - 2014 PY - 2014 SP - 261 EP - 266 PG - 6 SN - 0730-3157 DO - 10.1109/COMPSAC.2014.35 UR - https://m2.mtmt.hu/api/publication/24905342 ID - 24905342 LA - English DB - MTMT ER - TY - JOUR AU - Wenzel, S AU - Poggenpohl, D AU - Juerjens, J AU - Ochoa, M TI - Specifying model changes with UMLchange to support security verification of potential evolution JF - COMPUTER STANDARDS & INTERFACES J2 - COMPUT STAND INTER VL - 36 PY - 2014 IS - 4 SP - 776 EP - 791 PG - 16 SN - 0920-5489 DO - 10.1016/j.csi.2013.12.011 UR - https://m2.mtmt.hu/api/publication/24905341 ID - 24905341 LA - English DB - MTMT ER - TY - JOUR AU - Da, Costa S A AU - Ribeiro, L TI - Verification of graph grammars using a logical approach JF - SCIENCE OF COMPUTER PROGRAMMING J2 - SCI COMPUT PROGRAM VL - 77 PY - 2012 IS - 4 SP - 480 EP - 504 PG - 25 SN - 0167-6423 DO - 10.1016/j.scico.2010.02.006 UR - https://m2.mtmt.hu/api/publication/23929075 ID - 23929075 LA - English DB - MTMT ER - TY - CHAP AU - Galvão, Ismênia AU - Zambon, Eduardo AU - Rensink, Arend AU - Wevers, Lesley AU - Aksit, Mehmet ED - Schürr, Andy ED - Varró, Dániel ED - Varró, Gergely TI - Knowledge-based graph exploration analysis T2 - Applications of Graph Transformations with Industrial Relevance PB - Springer Netherlands CY - Berlin CY - Heidelberg SN - 9783642341762 T3 - Lecture Notes in Computer Science, ISSN 0302-9743 ; 7233. PY - 2012 SP - 105 EP - 120 PG - 16 DO - 10.1007/978-3-642-34176-2_11 UR - https://m2.mtmt.hu/api/publication/23946470 ID - 23946470 LA - English DB - MTMT ER - TY - JOUR AU - Giese, H AU - Lambers, L AU - Becker, B AU - Hildebrandt, S AU - Neumann, S AU - Vogel, T AU - Wätzoldt, S TI - Graph transformations for MDE, adaptation, and models at runtime JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 7320 PY - 2012 SP - 137 EP - 191 PG - 55 SN - 0302-9743 DO - 10.1007/978-3-642-30982-3_5 UR - https://m2.mtmt.hu/api/publication/23929074 ID - 23929074 LA - English DB - MTMT ER - TY - JOUR AU - Poskitt, C M TI - Verification of graph programs JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 7562 PY - 2012 SP - 420 EP - 422 PG - 3 SN - 0302-9743 DO - 10.1007/978-3-642-33654-6_30 UR - https://m2.mtmt.hu/api/publication/23929073 ID - 23929073 LA - English DB - MTMT ER - TY - JOUR AU - Poskitt, CM AU - Plump, D TI - Hoare-Style Verification of Graph Programs JF - FUNDAMENTA INFORMATICAE J2 - FUND INFOR VL - 118 PY - 2012 IS - 1-2 SP - 135 EP - 175 PG - 41 SN - 0169-2968 DO - 10.3233/FI-2012-708 UR - https://m2.mtmt.hu/api/publication/24002566 ID - 24002566 N1 - Funding Agency and Grant Number: Engineering and Physical Sciences Research Council Funding text: This author is grateful to be supported by a scholarship of the Engineering and Physical Sciences Research Council. LA - English DB - MTMT ER - TY - JOUR AU - Ribeiro, Leila AU - dos Santos, Osmar Marchi AU - Dotti, Fernando Luís AU - Foss, Luciana TI - Correct transformation: From object-based graph grammars to PROMELA JF - SCIENCE OF COMPUTER PROGRAMMING J2 - SCI COMPUT PROGRAM VL - 77 PY - 2012 IS - 3 SP - 214 EP - 246 PG - 33 SN - 0167-6423 DO - 10.1016/j.scico.2011.03.010 UR - https://m2.mtmt.hu/api/publication/23929916 ID - 23929916 LA - English DB - MTMT ER - TY - JOUR AU - Jürjens, J AU - Marchal, L AU - Ochoa, M AU - Schmidt, H TI - Incremental Security Verification for Evolving UMLsec models JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 6698 PY - 2011 SP - 52 EP - 68 PG - 17 SN - 0302-9743 DO - 10.1007/978-3-642-21470-7_5 UR - https://m2.mtmt.hu/api/publication/23929064 ID - 23929064 LA - English DB - MTMT ER - TY - JOUR AU - Jürjens, J AU - Ochoa, M AU - Schmidt, H AU - Marchal, L AU - Houmb, S AU - Islam, S TI - Modelling Secure Systems Evolution: Abstract and Concrete Change Specifications JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 6659 PY - 2011 SP - 504 EP - 526 PG - 23 SN - 0302-9743 DO - 10.1007/978-3-642-21455-4_15 UR - https://m2.mtmt.hu/api/publication/23929063 ID - 23929063 LA - English DB - MTMT ER - TY - JOUR AU - Rafe, V TI - Formal analysis of service-oriented architectures. Analiza formalna architektury typu service-oriented TS - Analiza formalna architektury typu service-oriented JF - PRZEGLAD ELEKTROTECHNICZNY J2 - PRZ ELEKTROTECHN VL - 87 PY - 2011 IS - 9 SP - 310 EP - 313 PG - 4 SN - 0033-2097 UR - https://m2.mtmt.hu/api/publication/23929510 ID - 23929510 N1 - Hiányzó nyelv: 'English; Polish' Megjegyzés-24127347 Hiányzó nyelv: 'English; Polish' Admin megjegyzés-24127347 tbllanguage: (Language) ('English; Polish') #nyelv Megjegyzés-23929068 Hiányzó nyelv: 'English; Polish' Admin megjegyzés-23929068 tbllanguage: (Language) ('English; Polish') #nyelv DB - MTMT ER - TY - THES AU - Bisztray, D A TI - Compositional verification of model-level refactorings based on graph transformations PY - 2010 UR - https://m2.mtmt.hu/api/publication/24127231 ID - 24127231 LA - English DB - MTMT ER - TY - THES AU - Cavalheiro, S A C TI - Relational approach of graph grammars PY - 2010 UR - https://m2.mtmt.hu/api/publication/23929056 ID - 23929056 LA - English DB - MTMT ER - TY - JOUR AU - Ehrig, H AU - Ermel, C AU - Runge, O AU - Bucchiarone, A AU - Pelliccione, P TI - Formal analysis and verification of self-healing systems JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 6013 PY - 2010 SP - 139 EP - 153 PG - 15 SN - 0302-9743 DO - 10.1007/978-3-642-12029-9_10 UR - https://m2.mtmt.hu/api/publication/23929506 ID - 23929506 N1 - Fundamental Approaches to Software Engineering LA - English DB - MTMT ER - TY - GEN AU - Ehrig, H AU - Ermel, C AU - Runge, O AU - Bucchiarone, A AU - Pelliccione, P TI - Formal analysis and verification of self-healing systems: Long version PY - 2010 UR - https://m2.mtmt.hu/api/publication/24127242 ID - 24127242 N1 - UR: http://arxiv.org/abs/1010.4423 LA - English DB - MTMT ER - TY - JOUR AU - Ermel, C TI - Visual Modelling and Analysis of Model Transformations based on Graph Transformation JF - BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE J2 - BULL EATCS VL - 2009 PY - 2010 IS - 99 SP - 135 EP - 152 PG - 18 SN - 0252-9742 UR - https://m2.mtmt.hu/api/publication/23929054 ID - 23929054 LA - English DB - MTMT ER - TY - CHAP AU - Planas, E AU - Cabot, J AU - de Nantes, I E M AU - Gómez, C AU - Guerra, E AU - de Lara, J TI - Lightweight Executability Analysis of Graph Transformation Rules T2 - IEEE Symposium on Visual Languages and Human-Centric Computing SN - 9780769542065 PY - 2010 SP - 127 EP - 130 PG - 4 DO - 10.1109/VLHCC.2010.26 UR - https://m2.mtmt.hu/api/publication/23929057 ID - 23929057 LA - English DB - MTMT ER - TY - CONF AU - Poskitt, C M AU - Plump, D TI - Hoare logic for graph programs T2 - THEORY Workshop at Verified Software: Theories, Tools and Experiments (VS-THEORY 2010) PY - 2010 UR - https://m2.mtmt.hu/api/publication/23929058 ID - 23929058 LA - English DB - MTMT ER - TY - CHAP AU - Poskitt, CM AU - Plump, D ED - Hartmut, Ehrig ED - Arend, Rensink ED - Grzegorz, Rozenberg ED - Andy, Schürr TI - A Hoare Calculus for Graph Programs T2 - Proceeding of ICGT'10 Doctoral Symposium PB - Springer Netherlands CY - Berlin SN - 3642159273 T3 - Lecture Notes in Computer Science, ISSN 0302-9743 ; 6372. PY - 2010 SP - 139 EP - 154 PG - 16 DO - 10.1007/978-3-642-15928-2_10 UR - https://m2.mtmt.hu/api/publication/24002567 ID - 24002567 LA - English DB - MTMT ER - TY - GEN AU - Steenken, D AU - Wehrheim, H AU - Wonisch, D TI - Towards a shape analysis for graph transformation systems PY - 2010 UR - https://m2.mtmt.hu/api/publication/23929055 ID - 23929055 LA - English DB - MTMT ER - TY - JOUR AU - da Costa, S A AU - Ribeiro, L TI - Formal Verification of Graph Grammars using Mathematical Induction JF - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE J2 - ELECTR NOTES COMPUT SCI VL - 240 PY - 2009 IS - C SP - 43 EP - 60 PG - 18 SN - 1571-0661 DO - 10.1016/j.entcs.2009.05.044 UR - https://m2.mtmt.hu/api/publication/23929052 ID - 23929052 N1 - Source: Scopus UR: http://www.scopus.com/inward/record.url?eid=2-s2.0-67649390845&partnerID=40&md5=e470469dc22f92ccb4bce2474ac0f5aa LA - English DB - MTMT ER - TY - CHAP AU - Mir, Al Vand MZ AU - Hajee, M TI - An approach to automatic verification of stochastic graph transformations T2 - TENCON 2009, 2009 IEEE Region 10 Conference PB - IEEE CY - Singapore SN - 9781424445462 T3 - IEEE Region 10 Conference 2009, ISSN 0886-1420 PB - IEEE PY - 2009 DO - 10.1109/TENCON.2009.5395989 UR - https://m2.mtmt.hu/api/publication/24130261 ID - 24130261 LA - English DB - MTMT ER - TY - JOUR AU - Rafe, V AU - Rahmani, AT TI - Towards automated software model checking using graph transformationsystems and Bogor JF - JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A J2 - J ZHEJIANG UNIV-SCI A VL - 10 PY - 2009 IS - 8 SP - 1093 EP - 1105 PG - 13 SN - 1673-565X DO - 10.1631/jzus.A0820415 UR - https://m2.mtmt.hu/api/publication/23929047 ID - 23929047 N1 - Megjegyzés-23929679 Source: Scopus UR: http://www.scopus.com/inward/record.url?eid=2-s2.0-68849123221&partnerID=40&md5=f4862207a6facff6cb3e74053f099575 LA - English DB - MTMT ER - TY - JOUR AU - Rafe, V AU - Rahmani, AT AU - Baresi, L AU - Spoletini, P TI - Towards automated verification of layered graph transformation specifications JF - IET SOFTWARE J2 - IET SOFTW VL - 3 PY - 2009 IS - 4 SP - 276 EP - 291 PG - 16 SN - 1751-8806 DO - 10.1049/iet-sen.2008.0059 UR - https://m2.mtmt.hu/api/publication/24135026 ID - 24135026 N1 - Megjegyzés-23929678 Source: Scopus UR: http://www.scopus.com/inward/record.url?eid=2-s2.0-68349146196&partnerID=40&md5=bc4ae56ba06e19de47c1cf45a09274d6 LA - English DB - MTMT ER - TY - JOUR AU - RAFE, Vahid AU - RAHMANI, Adel T TI - A NOVEL APPROACH TO VERIFY GRAPH SCHEMA-BASED SOFTWARE SYSTEMS JF - INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING J2 - INT J SOFTW ENG KNOW VL - 19 PY - 2009 IS - 6 SP - 857 EP - 870 PG - 14 SN - 0218-1940 DO - 10.1142/S0218194009004398 UR - https://m2.mtmt.hu/api/publication/23929907 ID - 23929907 LA - English DB - MTMT ER - TY - THES AU - V, Kozyura TI - Abstraction and Abstraction Refinement in the Verification of Graph Transformation Systems PY - 2009 SP - 140 UR - https://m2.mtmt.hu/api/publication/23929600 ID - 23929600 LA - English DB - MTMT ER - TY - JOUR AU - Baresi, L AU - Rafe, V AU - Rahmani, AT AU - Spoletini, P TI - An Efficient Solution for Model Checking Graph Transformation Systems JF - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE J2 - ELECTR NOTES COMPUT SCI VL - 213 PY - 2008 IS - 1 SP - 3 EP - 21 PG - 19 SN - 1571-0661 DO - 10.1016/j.entcs.2008.04.071 UR - https://m2.mtmt.hu/api/publication/21490652 ID - 21490652 LA - English DB - MTMT ER - TY - THES AU - Kastenberg, Harmen TI - Graph-Based Software Specification and Verification PY - 2008 UR - https://m2.mtmt.hu/api/publication/23928884 ID - 23928884 LA - English DB - MTMT ER - TY - CHAP AU - Rensink, A AU - Taentzer, G ED - Schurr, A ED - Nagl, M ED - Zundorf, A TI - AGTIVE 2007 Graph Transformation Tool Contest T2 - 3rd International Symposium on Applications of Graph Transformations with Industrial Relevance, AGTIVE 2007 PB - Springer Netherlands CY - Berlin SN - 9783540890195 T3 - Lecture Notes in Computer Science, ISSN 0302-9743 ; 5088. PY - 2008 SP - 487 EP - 492 PG - 6 DO - 10.1007/978-3-540-89020-1-33 UR - https://m2.mtmt.hu/api/publication/21489696 ID - 21489696 LA - English DB - MTMT ER - TY - CHAP AU - Rensink, A AU - Van, Gorp P ED - Ehrig, H ED - Heckel, R ED - Rozenberg, G ED - Taentzer, G TI - Graph-Based Tools: The Contest T2 - Graph Transformations PB - Springer Netherlands CY - Berlin CY - Heidelberg SN - 9783540874058 T3 - Lecture Notes in Computer Science, ISSN 0302-9743 ; 5214. PY - 2008 SP - 463 EP - 466 PG - 4 DO - 10.1007/978-3-540-87405-8_33 UR - https://m2.mtmt.hu/api/publication/23929067 ID - 23929067 LA - English DB - MTMT ER - TY - JOUR AU - Engels, G AU - Guldali, B AU - Lohmann, M TI - Towards Model-Driven Unit Testing JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 4364 PY - 2007 SP - 182 SN - 0302-9743 UR - https://m2.mtmt.hu/api/publication/23929032 ID - 23929032 LA - English DB - MTMT ER - TY - JOUR AU - Kozioura, V TI - Verification of Random Graph Transformation Systems JF - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE J2 - ELECTR NOTES COMPUT SCI VL - 175 PY - 2007 IS - 4 SPEC. ISS. SP - 63 EP - 72 PG - 10 SN - 1571-0661 DO - 10.1016/j.entcs.2007.04.017 UR - https://m2.mtmt.hu/api/publication/23929028 ID - 23929028 N1 - Source: Scopus LA - English DB - MTMT ER - TY - JOUR AU - Triebsees, T TI - Constraint-based Model Transformation: Tracing the Preservation of Semantic Properties JF - JOURNAL OF SOFTWARE J2 - JOURNAL OF SOFTWARE VL - 2 PY - 2007 IS - 3 SP - 19 EP - 29 PG - 11 SN - 1796-217X UR - https://m2.mtmt.hu/api/publication/21490168 ID - 21490168 LA - English DB - MTMT ER - TY - CONF AU - Vaeková, P AU - Moravec, P AU - Cerná, I AU - Zimmerova, B TI - Effective verification of systems with a dynamic number of components T2 - 2007 Conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering PY - 2007 SP - 3 EP - 13 PG - 11 DO - 10.1145/1292316.1292317 UR - https://m2.mtmt.hu/api/publication/23929031 ID - 23929031 LA - English DB - MTMT ER - TY - CHAP AU - Zimmerova, B AU - Varekova, P TI - Reflecting Creation and Destruction of Instances in CBSs Modelling and Verification T2 - MEMICS proceedings SN - 9788073550776 PY - 2007 SP - 257 EP - 264 PG - 8 UR - https://m2.mtmt.hu/api/publication/23929033 ID - 23929033 LA - English DB - MTMT ER - TY - CHAP AU - Adamek, J TI - Addressing Unbounded Parallelism in Verification of Software Components T2 - SNPD-SAWN ?06: Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing SN - 076952611X PY - 2006 SP - 49 EP - 56 PG - 8 DO - 10.1109/SNPD-SAWN.2006.15 UR - https://m2.mtmt.hu/api/publication/23929038 ID - 23929038 LA - English DB - MTMT ER - TY - JOUR AU - Baresi, L AU - Spoletini, P TI - On the use of alloy to analyze graph transformation systems JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 4178 PY - 2006 SP - 306 EP - 320 PG - 15 SN - 0302-9743 UR - https://m2.mtmt.hu/api/publication/23929050 ID - 23929050 LA - English DB - MTMT ER - TY - JOUR AU - Baresi, L AU - Heckel, R AU - Thöne, S AU - Varró, Dániel TI - Style-based modeling and refinement of service-oriented architectures: A graph transformation-base approach JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 5 PY - 2006 IS - 2 SP - 187 EP - 207 PG - 21 SN - 1619-1366 DO - 10.1007/s10270-006-0001-4 UR - https://m2.mtmt.hu/api/publication/2612533 ID - 2612533 AB - Service-oriented architectures (SOA) provide a flexible and dynamic platform for implementing business solutions. In this paper, we address the modeling of such architectures by refining business-oriented architectures, which abstract from technology aspects, into service-oriented ones, focusing on the ability of dynamic reconfiguration (binding to new services at run-time) typical for SOA. The refinement is based on conceptual models of the platforms involved as architectural styles, formalized by graph transformation systems. Based on a refinement relation between abstract and platform-specific styles we investigate how to realize business-specific scenarios on the SOA platform by automatically deriving refined, SOA-specific reconfiguration scenarios. ? Springer-Verlag 2006. LA - English DB - MTMT ER - TY - CONF AU - Bauer, J AU - Wilhelm, R TI - Analysis of Dynamic Communicating Systems by Hierarchical Abstraction T2 - Software Verification: Infinite-State Model Checking and Static Program Analysis PY - 2006 UR - https://m2.mtmt.hu/api/publication/23929037 ID - 23929037 N1 - Dagstuhl Seminar 06081 LA - English DB - MTMT ER - TY - JOUR AU - Dotti, F L AU - Ribeiro, L AU - Santos, O M AU - Pasini, F TI - Verifying Object-based Graph Grammars JF - SOFTWARE AND SYSTEMS MODELING J2 - SOFTW SYST MODEL VL - 5 PY - 2006 IS - 3 SP - 289 EP - 311 PG - 23 SN - 1619-1366 DO - 10.1007/s10270-006-0014-z UR - https://m2.mtmt.hu/api/publication/23929877 ID - 23929877 LA - English DB - MTMT ER - TY - JOUR AU - Habel, A AU - Pennemann, KH AU - Rensink, A TI - Weakest preconditions for high-level programs JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 4178 PY - 2006 SP - 445 EP - 460 PG - 16 SN - 0302-9743 UR - https://m2.mtmt.hu/api/publication/23929310 ID - 23929310 N1 - Ez a hivatkozás téves -> törlendő LA - English DB - MTMT ER - TY - CHAP AU - Kaffille, Sven AU - Wirtz, Guido ED - Mohammadian, Masoud TI - Modeling the Static Aspects of Trust for Open MAS T2 - Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation (CIMCA 2006) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - Piscataway (NJ) SN - 9780769527314 PY - 2006 SP - 186 DO - 10.1109/CIMCA.2006.150 UR - https://m2.mtmt.hu/api/publication/24127246 ID - 24127246 LA - English DB - MTMT ER - TY - GEN AU - Klein, F AU - Giese, H TI - Integrated Visual Specification of Structural and Temporal Properties PY - 2006 UR - https://m2.mtmt.hu/api/publication/23929036 ID - 23929036 LA - English DB - MTMT ER - TY - JOUR AU - Konig, B AU - Kozioura, V TI - Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 3920 PY - 2006 SP - 197 SN - 0302-9743 UR - https://m2.mtmt.hu/api/publication/23929034 ID - 23929034 LA - English DB - MTMT ER - TY - JOUR AU - Mens, T AU - Van, Gorp P AU - Varró, Dániel AU - Karsai, G TI - Applying a model transformation taxonomy to graph transformation technology JF - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE J2 - ELECTR NOTES COMPUT SCI VL - 152 PY - 2006 IS - 1-2 SP - 143 EP - 159 PG - 17 SN - 1571-0661 DO - 10.1016/j.entcs.2005.10.022 UR - https://m2.mtmt.hu/api/publication/2612531 ID - 2612531 N1 - Cited By :35 Export Date: 20 May 2022 Correspondence Address: Mens, T.; Software Engineering Lab., , Mons, Belgium; email: tom.mens@umh.ac.be AB - A taxonomy of model transformations was introduced in [T. Mens, P.V. Gorp, A taxonomy of model transformation, in: Proc. Int'l Workshop on Graph and Model Transformation (GraMoT 2005), Electronic Notes in Computer Science (2005)]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best suited to carry out a particular model transformation activity. In this paper we apply the taxonomy to the technique of graph transformation, and we exemplify it by referring to four representative graph transformation tools. As a byproduct of our analysis, we discuss how well each of the considered tools carry out the activity of model transformation. ? 2006 Elsevier B.V. All rights reserved. LA - English DB - MTMT ER - TY - JOUR AU - Rensink, A AU - Distefano, D TI - Abstract Graph Transformation JF - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE J2 - ELECTR NOTES COMPUT SCI VL - 157 PY - 2006 IS - 1 SP - 39 EP - 59 PG - 21 SN - 1571-0661 DO - 10.1016/j.entcs.2006.01.022 UR - https://m2.mtmt.hu/api/publication/23929035 ID - 23929035 LA - English DB - MTMT ER - TY - THES AU - Schilling, D TI - Kompositionale Softwareverifikation mechatronischer Systeme PY - 2006 UR - https://m2.mtmt.hu/api/publication/23929040 ID - 23929040 LA - German DB - MTMT ER - TY - JOUR AU - Dotti, FL AU - Mendizabal, OM AU - dos, Santos OM TI - Verifying fault-tolerant distributed systems using Object-Based GraphGrammars JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LECT NOTES COMPUT SC VL - 3747 PY - 2005 SP - 80 EP - 100 PG - 21 SN - 0302-9743 DO - 10.1007/11572329_9 UR - https://m2.mtmt.hu/api/publication/23929051 ID - 23929051 LA - English DB - MTMT ER - TY - JOUR AU - König, Barbara AU - Kozioura, Vitali TI - Augur - A Tool for the Analysis of Graph Transformation Systems JF - BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE J2 - BULL EATCS VL - 87 PY - 2005 SP - 126 EP - 137 PG - 12 SN - 0252-9742 UR - https://m2.mtmt.hu/api/publication/21490598 ID - 21490598 LA - English DB - MTMT ER - TY - JOUR AU - Rensink, Arend TI - Time and Space Issues in the Generation of Graph Transition Systems JF - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE J2 - ELECTR NOTES COMPUT SCI VL - 127 PY - 2005 IS - 1 SP - 127 EP - 139 PG - 13 SN - 1571-0661 DO - 10.1016/j.entcs.2004.12.036 UR - https://m2.mtmt.hu/api/publication/23929878 ID - 23929878 LA - English DB - MTMT ER - TY - THES AU - Thöne, S TI - Dynamic Software Architectures PY - 2005 UR - https://m2.mtmt.hu/api/publication/23928976 ID - 23928976 LA - English DB - MTMT ER - TY - CONF AU - Tichy, M AU - Giese, H TI - Extending Fault Tolerance Patterns by Visual Degradation Rules T2 - Workshop on Visual Modeling for Software Intensive Systems (VMSIS) at the the IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05) PY - 2005 SP - 67 EP - 74 PG - 8 UR - https://m2.mtmt.hu/api/publication/23929042 ID - 23929042 LA - English DB - MTMT ER - TY - CONF AU - Mens, T AU - Van, Gorp P TI - A Taxonomy of Model Transformation and its Application to Graph Transformation T2 - Proceedings of the International Workshop on Graph and Model Transformation PY - 2004 SP - 7 EP - 23 PG - 17 UR - https://m2.mtmt.hu/api/publication/23929045 ID - 23929045 LA - English DB - MTMT ER -