\{The 5th Conference has been reviewed [ 2797163 ].\} \par Contents: Antónia\ Lopes\ and José\ Luiz\ Fiadeiro, A graph-based design framework for services (1--19); Davide\ Di Ruscio, Ludovico\ Iovino\ and Alfonso\ Pierantonio, Evolutionary togetherness: how to manage coupled evolution in metamodeling ecosystems (20--37); Rolf\ Drechsler, Melanie\ Diepenbeck, Daniel\ Große, Ulrich\ Kühne, Hoang\ M.\ Le, Julia\ Seiter, Mathias\ Soeken\ and Robert\ Wille, Completeness-driven development (38--50); Fabio\ Gadducci, Alberto\ Lluch Lafuente [Alberto\ Lluch-Lafuente]\ and Andrea\ Vandin, Exploiting over- and under-approximations for infinite-state counterpart models (51--65) 3040182 ; Arend\ Rensink\ and Eduardo\ Zambon, Pattern-based graph abstraction (66--80) 3040183 ; Barbara\ König\ and Jan\ Stückrath, Well-structured graph transformation systems with negative application conditions (81--95) 3040184 ; Reiko\ Heckel, Hartmut\ Ehrig, Ulrike\ Golas\ and Frank\ Hermann, Parallelism and concurrency of stochastic graph transformations (96--110) 3040185 ; Michael\ Löwe, Refined graph rewriting in span-categories: a framework for algebraic graph transformation (111--125) 3040186 ; Fernando\ Orejas, Artur\ Boronat\ and Nikos\ Mylonakis, Borrowed contexts for attributed graphs (126--140) 3040187 ; Ulrike\ Golas, Leen\ Lambers, Hartmut\ Ehrig\ and Holger\ Giese, Toward bridging the gap between formal foundations and current practice for triple graph grammars: flexible relations between source and target elements (141--155) 3040188 . \par Dominique\ Duval, Rachid\ Echahed\ and Frédéric\ Prost, Graph transformation with focus on incident edges (156--171) 3040189 ; Takahito\ Aoto\ and Jeroen\ Ketema, Rational term rewriting revisited: decidability and confluence (172--186) 3040190 ; Ulrike\ Golas, A general attribution concept for models in $\scr M$-adhesive transformation systems (187--202) 3040191 ; Reiko\ Heckel, DPO transformation with open maps (203--217) 3040192 ; Annegret\ Habel\ and Detlef\ Plump, $\scr M$,$\scr N$-adhesive transformation systems (218--233) 3040193 ; Amir\ Hossein\ Ghamarian\ and Arend\ Rensink, Generalised compositionality in graph transformation (234--248) 3040194 ; Holger\ Giese\ and Leen\ Lambers, Towards automatic verification of behavior preservation for model transformation via invariant checking (249--263) 3040195 ; Christoph\ Blume, H.\ J. Sander Bruggink, Dominik\ Engelke\ and Barbara\ König, Efficient symbolic implementation of graph automata with applications to invariant checking (264--278) 3040196 ; Tamim\ Ahmed\ Khan, Olga\ Runge\ and Reiko\ Heckel, Testing against visual contracts: model-based coverage (279--293); Traian\ Florin\ Şerbănuţă\ and Grigore\ Roşu, A truly concurrent semantics for the $\Bbb K$ framework based on graph transformations (294--310). \par Christian\ Krause\ and Holger\ Giese, Probabilistic graph transformation systems (311--325); Gabriele\ Taentzer, Florian\ Mantz\ and Yngve\ Lamo, Co-transformation of graphs and type graphs with application to model co-evolution (326--340); Bernhard\ Westfechtel\ and Manfred\ Nagl, Graph transformations for evolving domain knowledge (341--355); Anthony\ Anjorin, Andy\ Schürr\ and Gabriele\ Taentzer, Construction of integrity preserving triple graph grammars (356--370); Gábor\ Bergmann, Dóra\ Horváth\ and Ákos Horváth, Applying incremental graph transformation to existing models in relational databases (371--385); Gábor\ Bergmann, István\ Ráth, Tamás\ Szabó, Paolo\ Torrini\ and Dániel\ Varró, Incremental pattern matching for the efficient computation of transitive closure (386--400); Marius\ Lauder, Anthony\ Anjorin, Gergely\ Varró\ and Andy\ Schürr, Efficient model synchronization with precedence triple graph grammars (401--415); Yongzhi\ Ong, Multi-scale rule-based graph transformation using the programming language XL (417--419); Christopher\ M.\ Poskitt, Verification of graph programs (420--422); Andrea\ Vandin, Specification and verification of modal properties for structured systems (423--425).