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).
Call for Papers
GCM 2023 solicits papers on all aspects of graph computation models. This includes, but is not limited to the following topics:
- Models of graph transformation
- Analysis and verification of graph transformation systems
- Parallel, concurrent, and distributed graph transformation
- Term graph rewriting
- Formal graph languages
- 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
- Graph-based security models
- Workflow and business processes
- Social network analysis
- Bioinformatics and computational chemistry
- Quantum computing
- Case studies
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 likely appear in the Electronic Proceedings in Theoretical Computer Science (EPTCS) (confirmation pending).