14th International Workshop on Graph Computation Models
Graphs are common mathematical structures which are visual and intuitive. They constitute a natural and seamless way for system modeling in science, engineering and beyond, including computer science, life sciences, business processes, etc. Graph computation models constitute a class of very high-level models where graphs are first-class citizens. They generalize classical computation models based on strings or trees, such as Chomsky grammars or term rewrite systems. Their mathematical foundation, in addition to their visual nature, facilitates specification, validation and analysis of complex systems. A variety of computation models have been developed using graphs and rule-based graph transformation. These models include features of programming languages and systems, paradigms for software development, concurrent calculi, local computations and distributed algorithms, and biological and chemical computations.
The International Workshop on Graph Computation Models aims at bringing together researchers interested in all aspects of computation models based on graphs and graph transformation. It promotes the cross-fertilizing exchange of ideas and experiences among young and senior researchers from different communities who are interested in the foundations, applications, and implementations of graph computation models and related areas.
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), and in Nantes, France (GCM 2022).
Tue 18 JulDisplayed time zone: London change
09:15 - 10:30 | GCM Session 1GCM at Willow Chair(s): Jens Kosiol Universität Kassel, Detlef Plump University of York Remote Participants: Zoom Link, YouTube Livestream | ||
09:15 15mDay opening | GCM Opening GCM Jens Kosiol Universität Kassel | ||
09:30 30mTalk | Model-Driven Rapid Prototyping for Control Algorithms with the GIPS Framework (System Description) GCM P: Maximilian Kratz Technical University of Darmstadt, Real-Time Systems Lab, Sebastian Ehmes Technical University of Darmstadt, Real-Time Systems Lab, Philipp Menzel Technical University of Darmstadt, Andy Schürr TU Darmstadt, Germany Media Attached File Attached | ||
10:00 30mTalk | Pedagogy of Teaching Pointers in the C Programming Language using Graph Transformation GCM File Attached |
10:30 - 11:00 | |||
10:30 30mCoffee break | Coffee Break Social |
11:00 - 12:30 | STAF Keynote / TAP Session 1Keynotes / TAP Research Papers / ECMFA Technical Track / ICGT Research Papers at Oak Chair(s): Cristina Seceleanu Mälardalen University Remote Participants: Zoom Link, YouTube Livestream | ||
11:00 15mDay opening | TAP Conference Opening TAP Research Papers | ||
11:15 75mKeynote | Symbolic, Statistical and Randomized Engines in UPPAAL Keynotes Kim Larsen Aalborg University |
12:30 - 13:30 | |||
12:30 60mLunch | Lunch Social |
13:30 - 15:00 | GCM Session 2GCM at Willow Chair(s): Andrea Corradini Remote Participants: Zoom Link, YouTube Livestream | ||
13:30 30mTalk | Hypergraph Rewriting and Higher-Arity Algebra GCM P: Carlos Zapata-Carratala Wolfram Institute / Society for Multidisciplinary and Fundamental Research | ||
14:00 30mTalk | Graph Edit Distance for Interaction Net Rewrite Rules GCM P: Ian Mackie University of Sussex, Shinya Sato Ibaraki University, Marc Thatcher University of Sussex | ||
14:30 30mTalk | Dynamic Tracing: a graphical language for rewriting protocols GCM |
15:00 - 15:30 | |||
15:00 30mCoffee break | Coffee Break Social |
15:30 - 17:00 | GCM Session 3GCM at Willow Chair(s): Jens Kosiol Universität Kassel Remote Participants: Zoom Link, YouTube Livestream | ||
15:30 7mTalk | A high-level functional programming language for interaction nets GCM | ||
15:38 7mTalk | Finite Automata for Efficient Graph Recognition GCM Frank Drewes Umeå universitet, Berthold Hoffmann Universität Bremen, P: Mark Minas Universität der Bundeswehr München | ||
15:45 7mTalk | Towards Efficient Boltzmann Sampling with Graph Generative Models and Constraints GCM | ||
15:53 7mTalk | Random Graph Generation in Context-Free Graph Languages GCM | ||
16:00 60mOther | Open Discussion GCM |
18:00 - 19:00 | |||
18:00 60mSocial Event | Welcome Reception Social |
Accepted Papers
Call for Papers
GCM 2023 solicits papers on all aspects of graph computation models. This includes, but is not limited to the following topics:
Foundations
- Models of 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
- Program analysis and transformation
- Graph-based machine learning, including graph neural networks and models of rule inference
- Model-driven engineering and model transformation
- 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
Submission Types
Authors are invited to submit papers in three possible categories:
(1) Regular papers of at most 16 pages describing innovative contributions.
(2) Short papers (work in progress, system descriptions, or position papers) of 6 to 12 pages.
(3) Short announcements of 1 or 2 pages, to be presented as lightning talks of 5 minutes.
Papers in PDF format should be submitted electronically via the EasyChair system site. Submissions must use the EPTCS LaTeX style. 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. The authors of selected (regular and short) papers will be invited to submit revised versions for the post-proceedings. The latter will appear in the Electronic Proceedings in Theoretical Computer Science (EPTCS).
Final Call for Lightning Talks
At GCM ’23, we have a few slots left for lightning talks of five minutes. The lightning talks will start a workshop session dedicated to the discussion of interesting directions for future research for the community.
For lightning talks, we solicit the submission of extended abstracts of maximally 2 pages (excluding references). Submissions must use the EPTCS LaTeX style and be submitted electronically in PDF via the EasyChair system site. The extended abstracts might inform about performed or ongoing research or sketch interesting new ideas. They will undergo a lightweight review and mainly be assessed for their potential to stir discussion on future research of the community. If an extended abstract extensively draws on already published work, a copy of that work is to be attached to the submission. We will consider convincing lightning talks that do not recapitulate published work for invitation to submit a full paper to the post-proceedings of GCM. These post-proceedings are to be published online by Electronic Proceedings in Theoretical Computer Science (EPTCS).
The possibility to submit extended abstracts will finally close down on 30 June. Until then, submissions are reviewed on a first-come, first-served basis till slots are filled.