Graphs are ubiquitous mathematical structures with an appealing visual and intuitive nature. They offer a natural way to model systems across science, engineering, and beyond, from computer science and biology to business process modeling. Graph computation models form a class of high-level models in which graphs are first-class citizens, generalizing classical models based on strings (e.g., Chomsky grammars) or trees (e.g., term rewriting systems).
Together with their visual character, their mathematical foundation facilitates the specification, validation, and analysis of complex systems. A wide range of computation models has been developed on top of graphs and rule-based graph transformations, capturing features of programming languages and systems, software development paradigms, concurrent calculi, local computations, and distributed algorithms, as well as biological and chemical computations.
The Graph Computation Models International Workshop (GCM), now in its 17th edition, is devoted to foundational research on, and applications of, state-of-the-art graph computation models, with a particular focus on modeling and software engineering.
Previous editions of the GCM series were held in Natal, Brazil (GCM 2006), in Leicester, UK (GCM 2008), in Enschede, The Netherlands (GCM 2010), in Bremen, Germany (GCM 2012), in York, UK (GCM 2014), in L’Aquila, Italy (GCM 2015), in Wien, Austria (GCM 2016), in Marburg, Germany (GCM 2017), in Toulouse, France (GCM 2018), in Eindhoven, The Netherlands (GCM 2019), online (GCM 2020 and GCM 2021), in Nantes, France (GCM 2022), in Leicester, UK (GCM 2023) and in Enschede, in The Netherlands (GCM 2024), and in Koblenz, Germany (GCM 2025).
Invited talks
Tue 30 JunDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
08:30 - 09:00 | |||
09:00 - 10:30 | |||
09:00 60mTalk | Purr-spectives on graphs GCM I: Jade Alglave Arm and University College London, Artem Khyzha Arm Ltd, Luc Maranget Inria, Nikos Nikoleris Arm Research, Hadrien Renaud University College London, Filippo Sestini Arm | ||
10:00 30mTalk | Towards Neuro-Symbolic Assurance for Artificial Intelligence via Graph Transformation GCM P: Lukas Sebastian Hofmann Philipps-Universität Marburg | Universidad Complutense de Madrid, Jens Kosiol Brandenburgische Technische Universität Cottbus-Senftenberg, Jose Ignacio Requeno Complutense University of Madrid, Reiko Heckel University of Leicester, Gabriele Taentzer Philipps-Universität Marburg | ||
10:30 - 11:00 | |||
10:30 30mCoffee break | Break Catering | ||
11:00 - 12:30 | |||
11:00 30mTalk | Structural Morphism for Nested Conditions GCM | ||
11:30 30mTalk | A nesting-free normal form for nested conditions in finite lattices of subgraphs GCM P: Jens Kosiol Brandenburgische Technische Universität Cottbus-Senftenberg, Steffen Zschaler King's College London Pre-print | ||
12:00 15mTalk | Preliminary Study of Interaction Nets Applicability for Sparse Linear Algebra Based Graph Analysis GCM P: Semyon Grigorev Saint-Petersburg State University, Nikolai Ponomarev Saint Petersburg State University, Efim Kubishkin Saint Petersburg State University, Danil Zaripov Saint Petersburg State University, Georgy Sichkar Saint Petersburg State University, Vladimir Zaikin Saint Petersburg State University | ||
12:30 - 13:30 | |||
12:30 60mLunch | Lunch Catering | ||
13:40 - 15:10 | |||
13:40 60mTalk | Generalization of Graph Neural Networks on latent random graphs GCM | ||
14:40 30mTalk | Parsing with Graph Grammars based on Conditional Borrowing Hyperedge Replacement GCM Frank Drewes Umeå universitet, Berthold Hoffmann Universitt Bremen, P: Mark Minas Universität der Bundeswehr München | ||
15:10 - 15:40 | |||
15:10 30mCoffee break | Break Catering | ||
15:40 - 16:40 | |||
15:40 30mTalk | Space-time deterministic graph rewriting GCM P: Marin Costes Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF, Pablo Arrighi Université Paris-Saclay, CNRS, LMF, Gilles Dowek INRIA and ENS Paris-Saclay, Luidnel Maignan LACL, Université Paris-Est Créteil | ||
16:10 15mTalk | BigraphIDE: An Integrated Development Environment for Bigraph Modeling and Evolution using Rewrite Rules GCM Manuel Krombholz TU Dresden, Dominik Grzelak Technische Universität Dresden, Uwe Aßmann TU Dresden, Germany | ||
16:25 15mTalk | Structuring the Design Space of Graph Transformation Frameworks Across Graph Families GCM Vadim Zaytsev University of Twente Pre-print | ||
Accepted Papers
Call for Papers
GCM 2026 solicits papers on all aspects of graph computation models. This includes but is not limited to the following topics:
Foundations
- Models of graph transformation
- Machine-learning techniques for graph transformation
- Analysis and verification of graph transformation systems
- Parallel, concurrent, and distributed graph transformation
- Term graph rewriting
- Formal graph languages
Applications
- Graph-based programming models and visual programming
- Model-driven engineering
- Machine-learning
- Evolutionary computation
- Software architectures, validation and evolution
- Databases
- Graph-based security models
- Workflow and business processes
- Social network analysis
- Bioinformatics and computational chemistry
- Quantum computing
- Case-studies
Submissions and Publication
Authors are invited to submit papers in three possible categories:
- Regular papers of at most 16 pages describing innovative contributions.
- Position papers, system descriptions or work in progress of 6 to 12 pages.
- Abstracts limited to 2 pages, introducing recently published papers in a peer-reviewed venue different from the ICGT conference (these will not be included in the workshop processdings).
Papers in PDF format should be submitted electronically via the EasyChair system site. All papers must follow the CEUR single-column workshop proceedings format. Simultaneous submission to other conferences with proceedings, as well as submission of material that has already been published elsewhere is not allowed for regular and short papers. The page limits include references. An optional appendix may be added if this is useful for the reviewing process. If a short announcement extensively draws on already published work, a copy of that work is to be attached to the submission.
All submissions will be reviewed by the program committee; short announcements will undergo a lightweight review and mainly be assessed for their potential to stir discussion on future research of the community. Electronic proceedings will be available at the time of the workshop.