The use of graphs and graph-like structures as a formalism for specification and modelling is widespread in all areas of computer science as well as in many fields of computational research and engineering. Relevant examples include software architectures, pointer structures, state space and control/data flow graphs, UML and other domain-specific models, network layouts, topologies of cyber-physical environments, quantum computing and molecular structures. Often, these graphs undergo dynamic change, ranging from reconfiguration and evolution to various kinds of behaviour, all of which may be captured by rule-based graph manipulation. Thus, graphs and graph transformation form a fundamental universal modelling paradigm that serves as a means for formal reasoning and analysis, ranging from the verification of certain properties of interest to the discovery of fundamentally new insights.
The International Conference on Graph Transformation aims at fostering exchange and collaboration of researchers from different backgrounds working with graphs and graph transformation, either in contributing to their theoretical foundations or by applying established formalisms to classical or novel areas. The conference not only serves as a well-established scientific publication outlet, but also as a platform to boost inter- and intra-disciplinary research and to leeway for new ideas.
The 15th International Conference on Graph Transformation (ICGT 2022) will be held in Nantes, France, as part of STAF 2022 (Software Technologies: Applications and Foundations). The conference takes place under the auspices of EATCS and IFIP WG 1.3.
Note: All times are end-of-day Anywhere on Earth.
STAF 2022 will take place at the Cité des Congrès de Nantes which is conveniently located in the city center. All conferences and workshops will take place in Room 150 in the lower foyer (cf. detailed floor plan).
In the program below, presenters are marked in bold.
|09:00-10:30||Session 1: ICGT Keynote & Opening||(Chair: Daniel Strüber)|
|09:15-10:15||Graph Theory in Coq : Axiomatizing Isomorphism of Treewidth-Two Graphs (Invited Talk) (abstract)||Christian Doczkal|
|11:00-12:30||Session 2: New Concepts||(Chair: TBA)|
|11:00||Graph Rewriting Components (abstract)||Reiko Heckel, Andrea Corradini and Fabio Gadducci|
|11:30||Probabilistic Metric Temporal Graph Logic (abstract)||Sven Schneider, Maria Maximova and Holger Giese|
|12:00||Categories of Differentiable Polynomial Circuits for Machine Learning (abstract)||Paul Wilson and Fabio Zanasi|
|14:00-15:00||Session 3: Analysing Graph Transformation Systems||(Chair: Jens Kosiol)|
|14:00||Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power (abstract)||Frank Drewes, Berthold Hoffmann and Mark Minas|
|14:30||Decidability of Resilience for Well-structured Graph Transformation Systems (abstract)||Okan Özkan|
|15:30-17:00||Session 4: Special Interest Topic Discussion||(Chair: Nicolas Behr)|
|Collective brainstorming session on “Coq for GT” (details TBA)|
|17:30-20:00||STAF 2022 Social Events|
|17:30-18:00||Bus shuttle for Chateau de Goulaine|
|18:00-19:00||Chateau de Goulaine Visit|
|19:00-20:00||Gala Dinner at Chateau de Goulaine|
|09:00-10:30||Session 5: GT in Software Engineering||(Chair: Mark Minas)|
|09:00||Towards Development with Multi-Version Models: Detecting Merge Conflicts and Checking Well-Formedness (abstract)||Matthias Barkowsky and Holger Giese|
|09:30||Visual Smart Contracts for DAML (abstract)||Reiko Heckel, Nitia Rahmi, Zobia Erum and Albert Pul|
|10:00||A Generic Construction for Crossovers of Graph-like Structures (abstract)||Gabriele Taentzer, Stefan John and Jens Kosiol|
|11:00-12:30||Session 6: Application Domains and Tools||(Chair: Reiko Heckel)|
|11:00||Computational category theoretic rewriting (abstract)||Kristopher Brown, Evan Patterson, Tyler Hanks and James Fairbanks|
|11:30||Invariant Analysis for Multi Agent Graph Transformation Systems using k-Induction (abstract)||Sven Schneider, Maria Maximova and Holger Giese|
|12:00||Tool support for Fully-Persistent Graph Rewriting - GrapeVine (abstract)||Jens Weber|
|14:00-15:30||Session 7: Working groups|
|16:00-17:30||Session 8: Working groups|
Frank Drewes, Berthold Hoffmann and Mark Minas: Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
Gabriele Taentzer, Stefan John and Jens Kosiol: A Generic Construction for Crossovers of Graph-like Structures
Matthias Barkowsky and Holger Giese: Towards Development with Multi-Version Models: Detecting Merge Conflicts and Checking Well-Formedness
Reiko Heckel, Andrea Corradini and Fabio Gadducci: Graph Rewriting Components
Reiko Heckel, Nitia Rahmi, Zobia Erum and Albert Pul: Visual Smart Contracts for DAML
Okan Özkan: Decidability of Resilience for Well-structured Graph Transformation Systems
Kristopher Brown, Evan Patterson, Tyler Hanks and James Fairbanks: Computational category theoretic rewriting
Sven Schneider, Maria Maximova and Holger Giese: Invariant Analysis for Multi Agent Graph Transformation Systems using k-Induction
Sven Schneider, Maria Maximova and Holger Giese: Probabilistic Metric Temporal Graph Logic
Paul Wilson and Fabio Zanasi: Categories of Differentiable Polynomial Circuits for Machine Learning
Jens Weber: Tool support for Fully-Persistent Graph Rewriting - GrapeVine
In order to foster a lively exchange of perspectives on the subject of the conference, the programme committee of ICGT 2022 encourages all kinds of contributions related to graphs and graph transformation, either from a theoretical point of view or a practical one.
Topics of interest include, but are not limited to the following subjects:
A special focus of this conference will consist of new approaches to formalizing the knowledge in the research field of graph transformation theory via proof assistants such as Coq. Referring to the homepage of the GReTA-ExACT workgroup for further information, a long-term goal of this kind of approach will consist in establishing a Coq-enriched wiki for our research field akin to the nLab. This platform will serve as a sustainable mechanism for curating applied and mathematical knowledge in graph transformation research, and eventually as a research tool in its own right, notably through the provision of interactive database-supported proof construction. Another avenue of research will concern executable applied category theory (ExACT), i.e., code extraction from formalized categorical structures, with the perspective of curating a database of correct-by-construction reference prototype algorithms for various forms of graph transformation semantics and graph-like data structures. To introduce the initiative and facilitate the broad involvement of the ICGT community and collect feedback from participants regarding the scope and format of such a wiki project, a peer-reviewed brainstorming session is planned as one of the events at the conference.
Papers can be submitted via EasyChair using Springer’s LNCS format (cf. LNCS Overleaf template). For regular and tool demonstration papers, simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. The page limits are strict and include references. At least one author for each accepted paper must register before the early registration deadline and present the paper during the conference.
Papers are solicited in three categories:
Regular papers (limited to 16 pages in Springer LNCS format) describe innovative contributions and are evaluated with respect to their originality, significance, and technical soundness. We also solicit case studies describing applications of graph transformation in any application domain. Additional material intended for reviewers but not for publication in the final version may be included in a clearly marked appendix.
Tool presentation papers (limited to 8 pages in Springer LNCS format) demonstrate the main features and functionality of graph-based tools. A tool presentation paper may have an appendix with a detailed demo description (up to 4 pages), which will be reviewed but not included in the proceedings.
New ideas papers (limited to 2 pages in Springer LNCS format) report on relevant contributions to the theory or applications of graph transformation, which may have been published (or accepted for publication) in a peer-reviewed conference other than ICGT, as a book chapter or journal article since 2018. Papers in this category will be selected for presentation at the conference according to their relevance to the graph transformation community, and they will be considered for the special issues. Submissions will consist of a 2-page abstract. In case of extended abstracts of published papers, the submission must refer to the published paper and include the original paper in PDF.
Authors of the best papers at the conference will be invited to prepare and submit extended journal versions to be considered for publication in a special issue after an independent round of peer review. The special issue will be published in the Journal of Logical and Algebraic Methods in Programming (Elsevier).