References

  1. Cecilia Albert & Lisa Brownsword (2002): Evolutionary process for integrating COTS-based systems (EPIC): An overview. Available at https://doi.org/10.21236/ada408653.
  2. Thorsten Arendt, Enrico Biermann, Stefan Jurack, Christian Krause & Gabriele Taentzer (2010): Henshin: Advanced Concepts and tools for In-Place EMF Model Transformation. In: Model Driven Engineering Languages and Systems, 13th International Conference, MoDELS 2010, Oslo, Norway. Proceedings, LNCS 6394. Springer, pp. 121–135. Available at https://doi.org/10.1007/978-3-642-16145-2_9.
  3. Niaz Arijo, Reiko Heckel, Mirco Tribastone & Stephen Gilmore (2011): Modular performance modelling for mobile applications (abstracts only). SIGMETRICS Performance Evaluation Review 39(3), pp. 18. Available at https://doi.org/10.1145/2160803.2160839.
  4. Uwe Aßmann (2000): Graph Rewrite Systems for Program Optimization. ACM Trans. Program. Lang. Syst. 22(4), pp. 583–637. Available at https://doi.org/10.1145/363911.363914.
  5. Franz Baader (2003): Description Logic Terminology. In: Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi & Peter F. Patel-Schneider: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, pp. 485–495. Available at https://doi.org/10.1017/9781139025355.009.
  6. Paolo Baldan, Andrea Corradini & Barbara König (2001): A Static Analysis Technique for Graph Transformation Systems. In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, Lecture Notes in Computer Science 2154. Springer, pp. 381–395. Available at https://doi.org/10.1007/3-540-44685-0_26.
  7. Luciano Baresi & Paola Spoletini (2006): On the Use of Alloy to Analyze Graph Transformation Systems. In: Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro & Grzegorz Rozenberg: Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings, Lecture Notes in Computer Science 4178. Springer, pp. 306–320. Available at https://doi.org/10.1007/11841883_22.
  8. Peter Baumgartner, Alexander Fuchs & Cesare Tinelli (2006): Implementing the Model Evolution Calculus. International Journal on Artificial Intelligence Tools 15(1), pp. 21–52. Available at https://doi.org/10.1142/S0218213006002552.
  9. Basil Becker, Dirk Beyer, Holger Giese, Florian Klein & Daniela Schilling (2006): Symbolic invariant verification for systems with dynamic structural adaptation. In: Leon J. Osterweil, H. Dieter Rombach & Mary Lou Soffa: 28th International Conference on Software Engineering (ICSE 2006), Shanghai, China, May 20-28, 2006. ACM, pp. 72–81. Available at https://doi.org/10.1145/1134285.1134297.
  10. Dirk Beyer, Andreas Noack & Claus Lewerentz (2005): Efficient Relational Calculation for Software Analysis. IEEE Trans. Software Eng. 31(2), pp. 137–149. Available at https://doi.org/10.1109/TSE.2005.23.
  11. Artur Boronat, Reiko Heckel & José Meseguer (2009): Rewriting Logic Semantics and Verification of Model Transformations. In: Marsha Chechik & Martin Wirsing: Fundamental Approaches to Software Engineering, 12th International Conference, FASE 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, Lecture Notes in Computer Science 5503. Springer, pp. 18–33. Available at https://doi.org/10.1007/978-3-642-00593-0_2.
  12. Paolo Bottoni, Kathrin Hoffmann, Francesco Parisi-Presicce & Gabriele Taentzer (2005): High-level replacement units and their termination properties. J. Vis. Lang. Comput. 16(6), pp. 485–507. Available at https://doi.org/10.1016/j.jvlc.2005.07.001.
  13. Paolo Bottoni, Gabriele Taentzer & Andy Schürr (2000): Efficient Parsing of Visual Languages Based on Critical Pair Analysis and Contextual Layered Graph Transformation. In: 2000 IEEE International Symposium on Visual Languages, VL 2000, Seattle, Washington, USA, September 10-13, 2000, Proceedings.. IEEE Computer Society, pp. 59–60. Available at https://doi.org/10.1109/VL.2000.874351.
  14. Jon Haël Brenas, Rachid Echahed & Martin Strecker (2018): Verifying Graph Transformation Systems with Description Logics. In: Leen Lambers & Jens H. Weber: Graph Transformation - 11th International Conference, ICGT 2018, Held as Part of STAF 2018, Toulouse, France, June 25-26, 2018, Proceedings, Lecture Notes in Computer Science 10887. Springer, pp. 155–170. Available at https://doi.org/10.1007/978-3-319-92991-0_10.
  15. Jon Haël Brenas, Martin Strecker, Rachid Echahed & Arash Shaban-Nejad (2018): Applied Graph Transformation and Verification With Use Cases in Malaria Surveillance. IEEE Access 6, pp. 64728–64741. Available at https://doi.org/10.1109/ACCESS.2018.2878311.
  16. Harrie Jan Sander Bruggink (2015): Grez user manual. Available at http://www.ti.inf.uni-due.de/research/tools/grez/.
  17. Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer & Carolyn L. Talcott (2007): All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic. Lecture Notes in Computer Science 4350. Springer. Available at https://doi.org/10.1007/978-3-540-71999-1.
  18. Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte & Arend Rensink (2019): Rewriting Abstract Structures: Materialization Explained Categorically. In: International Conference on Foundations of Software Science and Computation Structures. Springer, pp. 169–188. Available at https://doi.org/10.1007/978-3-030-17127-8_10.
  19. Andrea Corradini, Barbara König & Dennis Nolte (2017): Specifying Graph Languages with Type Graphs. In: Juan de Lara & Detlef Plump: Graph Transformation - 10th International Conference, ICGT 2017, Held as Part of STAF 2017, Marburg, Germany, July 18-19, 2017, Proceedings, Lecture Notes in Computer Science 10373. Springer, pp. 73–89. Available at https://doi.org/10.1007/978-3-319-61470-0_5.
  20. Andrea Corradini, Barbara König & Dennis Nolte (2019): Specifying graph languages with type graphs. Journal of Logical and Algebraic Methods in Programming 104, pp. 176–200. Available at https://doi.org/10.1016/j.jlamp.2019.01.005.
  21. Leonardo De Moura & Nikolaj Bjørner (2008): Z3: An efficient SMT solver. In: International conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, pp. 337–340. Available at https://doi.org/10.1007/978-3-540-78800-3_24.
  22. Hartmut Ehrig, Karsten Ehrig, Annegret Habel & Karl-Heinz Pennemann (2004): Constraints and Application Conditions: From Graphs to High-Level Structures. In: Graph Transformations, Second International Conference, ICGT 2004, Rome, Italy, September 28 - October 2, 2004, Proceedings, LNCS 3256. Springer, pp. 287–303. Available at https://doi.org/10.1007/978-3-540-30203-2_21.
  23. Hartmut Ehrig, Karsten Ehrig, Ulrike Prange & Gabriele Taentzer (2006): Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer. Available at https://doi.org/10.1007/3-540-31188-2.
  24. Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas & Ulrike Golas (2010): Local Confluence for Rules with Nested Application Conditions. In: Graph Transformations - 5th International Conference, ICGT 2010, Enschede, The Netherlands, September 27 - - October 2, 2010. Proceedings, LNCS 6372. Springer, pp. 330–345. Available at https://doi.org/10.1007/978-3-642-15928-2_22.
  25. Aboubakr Achraf El Ghazi & Mana Taghdiri (2011): Relational reasoning via SMT solving. In: International Symposium on Formal Methods. Springer, pp. 133–148. Available at https://doi.org/10.1007/978-3-642-21437-0_12.
  26. Marcus Ermler, Hans-Jörg Kreowski, Sabine Kuske & Caroline von Totth (2011): From graph transformation units via minisat to grgen. net. In: International Symposium on Applications of Graph Transformations with Industrial Relevance. Springer, pp. 153–168. Available at https://doi.org/10.1007/978-3-642-34176-2_14.
  27. Amir Hossein Ghamarian, Maarten de Mol, Arend Rensink, Eduardo Zambon & Maria Zimakova (2012): Modelling and analysis using GROOVE. STTT 14(1), pp. 15–40, doi:10.1007/s10009-011-0186-x.
  28. Carlos A. González, Fabian Büttner, Robert Clarisó & Jordi Cabot (2012): EMFtoCSP: a tool for the lightweight verification of EMF models. In: Stefania Gnesi, Stefan Gruner, Nico Plat & Bernhard Rumpe: Proceedings of the First International Workshop on Formal Methods in Software Engineering - Rigorous and Agile Approaches, FormSERA 2012, Zurich, Switzerland, June 2, 2012. IEEE, pp. 44–50. Available at https://doi.org/10.1109/FormSERA.2012.6229788.
  29. Annegret Habel & Karl-Heinz Pennemann (2009): Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science 19(2), pp. 245–296. Available at http://dx.doi.org/10.1017/S0960129508007202.
  30. Reiko Heckel (2005): Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks. In: Theoretical Aspects of Computing - ICTAC 2005, Second International Colloquium, Hanoi, Vietnam, October 17-21, 2005, Proceedings, pp. 53–69. Available at https://doi.org/10.1007/11560647_4.
  31. Reiko Heckel, Jochen Malte Küster & Gabriele Taentzer (2002): Confluence of Typed Attributed Graph Transformation Systems. In: Graph Transformation, First International Conference, ICGT 2002, Barcelona, Spain, October 7-12, 2002, Proceedings, Lecture Notes in Computer Science 2505. Springer, pp. 161–176. Available at https://doi.org/10.1007/3-540-45832-8_14.
  32. Reiko Heckel & Annika Wagner (1995): Ensuring consistency of conditional graph rewriting - a constructive approach. Electr. Notes Theor. Comput. Sci. 2, pp. 118–126. Available at http://dx.doi.org/10.1016/S1571-0661(05)80188-4.
  33. Gerard J. Holzmann (1997): The Model Checker SPIN. IEEE Trans. Software Eng. 23(5), pp. 279–295. Available at https://doi.org/10.1109/32.588521.
  34. Tobias Isenberg, Dominik Steenken & Heike Wehrheim (2013): Bounded Model Checking of Graph Transformation Systems via SMT Solving. In: Dirk Beyer & Michele Boreale: Formal Techniques for Distributed Systems - Joint IFIP WG 6.1 International Conference, FMOODS/FORTE 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013. Proceedings, Lecture Notes in Computer Science 7892. Springer, pp. 178–192. Available at https://doi.org/10.1007/978-3-642-38592-6_13.
  35. Daniel Jackson (2006): Software Abstractions - Logic, Language, and Analysis. MIT Press. Available at http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=10928.
  36. Barbara König & Javier Esparza (2010): Verification of Graph Transformation Systems with Context-Free Specifications. In: Hartmut Ehrig, Arend Rensink, Grzegorz Rozenberg & Andy Schürr: Graph Transformations - 5th International Conference, ICGT 2010, Enschede, The Netherlands, September 27 - - October 2, 2010. Proceedings, Lecture Notes in Computer Science 6372. Springer, pp. 107–122. Available at https://doi.org/10.1007/978-3-642-15928-2_8.
  37. Barbara König & Vitali Kozioura (2008): Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems. Electr. Notes Theor. Comput. Sci. 211, pp. 201–210. Available at https://doi.org/10.1016/j.entcs.2008.04.042.
  38. Hans-Jörg Kreowski, Sabine Kuske & Robert Wille (2010): Graph transformation units guided by a SAT solver. In: International Conference on Graph Transformation. Springer, pp. 27–42. Available at https://doi.org/10.1007/978-3-642-15928-2_3.
  39. Mirco Kuhlmann, Lars Hamann & Martin Gogolla (2011): Extensive Validation of OCL Models by Integrating SAT Solving into USE. In: Judith Bishop & Antonio Vallecillo: Objects, Models, Components, Patterns - 49th International Conference, TOOLS 2011, Zurich, Switzerland, June 28-30, 2011. Proceedings, Lecture Notes in Computer Science 6705. Springer, pp. 290–306. Available at https://doi.org/10.1007/978-3-642-21952-8_21.
  40. Leen Lambers, Kristopher Born, Fernando Orejas, Daniel Strüber & Gabriele Taentzer (2018): Initial Conflicts and Dependencies: Critical Pairs Revisited. In: Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig, Lecture Notes in Computer Science 10800. Springer, pp. 105–123. Available at https://doi.org/10.1007/978-3-319-75396-6_6.
  41. Leen Lambers, Daniel Strüber, Gabriele Taentzer, Kristopher Born & Jevgenij Huebert (2018): Multi-Granular Conflict and Dependency Analysis in Software Engineering based on Graph Transformation. Available at https://doi.org/10.1145/3180155.3180258. Accepted for publication in proceedings of Int. Conf. on Software Engineering 2018.
  42. Jacqueline McQuillan & James Power (2008): A metamodel for the measurement of object-oriented systems: An analysis using Alloy. In: 2008 1st International Conference on Software Testing, Verification, and Validation. IEEE, pp. 288–297. Available at https://doi.org/10.1109/icst.2008.58.
  43. Said Meghzili, Allaoua Chaoui, Martin Strecker & Elhillali Kerkouche (2019): Verification of Model Transformations Using Isabelle/HOL and Scala. Information Systems Frontiers 21(1), pp. 45–65. Available at https://doi.org/10.1007/s10796-018-9860-9.
  44. Mark Minas (1997): Diagram Editing with Hypergraph Parser Support. In: Proceedings of the 1997 IEEE Symposium on Visual Languages, VL '97. IEEE Computer Society, Washington, DC, USA, pp. 226–, doi:10.1109/VL.1997.626587. Available at http://dl.acm.org/citation.cfm?id=832278.834445.
  45. Nebras Nassar, Jens Kosiol, Thorsten Arendt & Gabriele Taentzer (2018): OCL2AC: automatic translation of OCL constraints to graph constraints and application conditions for transformation rules. In: International Conference on Graph Transformation. Springer, pp. 171–177. Available at https://doi.org/10.1007/978-3-319-92991-0_11.
  46. Nebras Nassar, Jens Kosiol, Thorsten Arendt & Gabriele Taentzer (2019): Constructing Optimized Validity-Preserving Application Conditions for Graph Transformation Rules. In: International Conference on Graph Transformation. Springer, pp. 177–194. Available at https://doi.org/10.1007/978-3-030-23611-3_11.
  47. Tobias Nipkow, Lawrence C. Paulson & Markus Wenzel (2002): Isabelle/HOL - A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science 2283. Springer. Available at https://doi.org/10.1007/3-540-45949-9.
  48. Dennis Nolte (2019): Analysis and Abstraction of Graph Transformation Systems via Type Graphs.. University of Duisburg-Essen.
  49. Dennis Nolte (2019): DrAGoM Manual. Available at https://www.uni-due.de/theoinf/research/tools_dragom.php.
  50. Karl-Heinz Pennemann (2008): Resolution-Like Theorem Proving for High-Level Conditions. In: Hartmut Ehrig, Reiko Heckel, Grzegorz Rozenberg & Gabriele Taentzer: Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings, Lecture Notes in Computer Science 5214. Springer, pp. 289–304. Available at https://doi.org/10.1007/978-3-540-87405-8_20.
  51. Karl-Heinz Pennemann (2009): Development of correct graph transformation systems. University of Oldenburg, Germany. Available at https://doi.org/10.1007/978-3-540-87405-8_48.
  52. Detlef Plump (1994): Critical Pairs in Term Graph Rewriting. In: Mathematical Foundations of Computer Science, LNCS 841, pp. 556–566. Available at https://doi.org/10.1007/3-540-58338-6_102.
  53. Detlef Plump (1998): Termination of Graph Rewriting is Undecidable. Fundam. Inform. 33(2), pp. 201–209. Available at https://doi.org/10.3233/fi-1998-33204.
  54. Detlef Plump (1999): Term Graph Rewriting. In: Handbook of Graph Grammars and Computing by Graph Transformation 2: Applications, Languages and Tools. World Scientific, pp. 3–61, doi:10.1142/9789812815149_0001.
  55. Detlef Plump (2018): Modular Termination of Graph Transformation. In: Reiko Heckel & Gabriele Taentzer: Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig, Lecture Notes in Computer Science 10800. Springer, pp. 231–244. Available at https://doi.org/10.1007/978-3-319-75396-6_13.
  56. Christopher M. Poskitt & Detlef Plump (2012): Hoare-Style Verification of Graph Programs. Fundam. Inform. 118(1-2), pp. 135–175. Available at https://doi.org/10.3233/FI-2012-708.
  57. Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel & Gabriele Taentzer (2018): Translating essential OCL invariants to nested graph constraints for generating instances of meta-models. Science of Computer Programming 152, pp. 38–62. Available at https://doi.org/10.1016/j.scico.2017.08.006.
  58. J. Rekers & Andy Schürr (1997): Defining and Parsing Visual Languages with Layered Graph Grammars. J. Vis. Lang. Comput. 8(1), pp. 27–55. Available at https://doi.org/10.1006/jvlc.1996.0027.
  59. Arend Rensink, Ákos Schmidt & Dániel Varró (2004): Model Checking Graph Transformations: A Comparison of Two Approaches. In: Graph Transformations, Second International Conference, ICGT 2004, Rome, Italy, September 28 - October 2, 2004, Proceedings, Lecture Notes in Computer Science 3256. Springer, pp. 226–241. Available at https://doi.org/10.1007/978-3-540-30203-2_17.
  60. Alexandre Riazanov & Andrei Voronkov (2002): The design and implementation of VAMPIRE. AI Commun. 15(2-3), pp. 91–110. Available at http://content.iospress.com/articles/ai-communications/aic259.
  61. Michael Rudolf (1998): Utilizing constraint satisfaction techniques for efficient graph pattern matching. In: International Workshop on Theory and Application of Graph Transformations. Springer, pp. 238–251. Available at https://doi.org/10.1007/978-3-540-46464-8_17.
  62. Ákos Schmidt & Dániel Varró (2003): CheckVML: A Tool for Model Checking Visual Modeling Languages. In: UML 2003 - The Unified Modeling Language, Modeling Languages and Applications, 6th International Conference, San Francisco, CA, USA, October 20-24, 2003, Proceedings, Lecture Notes in Computer Science 2863. Springer, pp. 92–95. Available at https://doi.org/10.1007/978-3-540-45221-8_8.
  63. Sven Schneider, Leen Lambers & Fernando Orejas (2017): Symbolic Model Generation for Graph Properties. In: Marieke Huisman & Julia Rubin: Fundamental Approaches to Software Engineering - 20th International Conference, FASE 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Lecture Notes in Computer Science 10202. Springer, pp. 226–243. Available at https://doi.org/10.1007/978-3-662-54494-5_13.
  64. Oszkár Semeráth, Aren A Babikian, Sebastian Pilarski & Dániel Varró (2019): Viatra solver: a framework for the automated generation of consistent domain-specific models. In: Proceedings of the 41st International Conference on Software Engineering: Companion Proceedings. IEEE Press, pp. 43–46. Available at https://doi.org/10.1109/icse-companion.2019.00034.
  65. Oszkár Semeráth, András Szabolcs Nagy & Dániel Varró (2018): A graph solver for the automated generation of consistent domain-specific models. In: Michel Chaudron, Ivica Crnkovic, Marsha Chechik & Mark Harman: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, May 27 - June 03, 2018. ACM, pp. 969–980. Available at https://doi.org/10.1145/3180155.3180186.
  66. Oszkár Semeráth, András Vörös & Dániel Varró (2016): Iterative and Incremental Model Generation by Logic Solvers. In: Perdita Stevens & Andrzej Wasowski: Fundamental Approaches to Software Engineering - 19th International Conference, FASE 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, Lecture Notes in Computer Science 9633. Springer, pp. 87–103. Available at https://doi.org/10.1007/978-3-662-49665-7_6.
  67. Sagar Sen, Benoit Baudry & Jean-Marie Mottu (2008): On combining multi-formalism knowledge to select models for model transformation testing. In: 2008 1st International Conference on Software Testing, Verification, and Validation. IEEE, pp. 328–337. Available at https://doi.org/10.1109/icst.2008.62.
  68. Dominik Steenken (2015): Verification of infinite-state graph transformation systems via abstraction.. University of Paderborn.
  69. Dominik Steenken, Heike Wehrheim & Daniel Wonisch (2011): Sound and complete abstract graph transformation. In: Brazilian Symposium on Formal Methods. Springer, pp. 92–107. Available at https://doi.org/10.1007/978-3-642-25032-3_7.
  70. Martin Strecker (2018): Interactive and automated proofs for graph transformations. Mathematical Structures in Computer Science 28(8), pp. 1333–1362. Available at https://doi.org/10.1017/S096012951800021X.
  71. Dániel Varró, Oszkár Semeráth, Gábor Szárnyas & Ákos Horváth (2018): Towards the automated generation of consistent, diverse, scalable and realistic graph models. In: Graph Transformation, Specifications, and Nets. Springer, pp. 285–312. Available at https://doi.org/10.1007/978-3-319-75396-6_16.
  72. Dániel Varró, Szilvia Varró-Gyapay, Hartmut Ehrig, Ulrike Prange & Gabriele Taentzer (2006): Termination Analysis of Model Transformations by Petri Nets. In: Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings, LNCS 4178. Springer, pp. 260–274. Available at https://doi.org/10.1007/11841883_19.
  73. Hao Wu, Rosemary Monahan & James F Power (2012): Metamodel instance generation: A systematic literature review. arXiv preprint arXiv:1211.6322.
  74. Hao Wu, Rosemary Monahan & James F Power (2013): Exploiting attributed type graphs to generate metamodel instances using an SMT solver. In: 2013 International Symposium on Theoretical Aspects of Software Engineering. IEEE, pp. 175–182. Available at https://doi.org/10.1109/tase.2013.31.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org