Programme
Our programme for the GCM'22 workshop can be found below. The workshop will run in hybrid mode. Webex links are provided for online participants, but note that you must have a (physical or remote) STAF registration to use them. Coffee breaks and lunch will be provided by the STAF organisers.
Note that the co-located ECMFA'22 keynote will take place the same day from 09:00–10:30 and is covered by your workshop registration.
Session 1 (11:00 – 12:30): Foundations
Chair: Daniel Strüber ▪ Room: BC (Webex)
- Sebastian Ehmes, Maximilian Kratz and Andy Schürr
Graph-Based Specification and Automated Construction of ILP Problems [slides] - Brian Courtehoute and Detlef Plump
Time and Space Measures for a Complete Graph Computation Model [slides] - Jens Weber
A Foundation for Functional Graph Programs - The Graph Transformation Control Algebra (GTA) [slides]
Session 2 (14:00 – 15:30): Applications
Chair: Nicolas Behr ▪ Room: BC (Webex)
- Mitchell Albers, Carlos Diego Damasceno and Daniel Strüber
A Lightweight Approach for Model Checking Variability-Based Graph Transformations [slides] - Detlef Plump and Robert Söldner
Towards Mechanised Proofs in Double-Pushout Graph Transformation - Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye and Aljoscha Windhorst
A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems [slides]
Session 3 (16:00 – 17:30): Keynote & Community Event
Chair: Reiko Heckel ▪ Room: BC (Webex)
- GCM'22 Keynote: Elizabeth Dinella
Graph Representations in Traditional and Neural Program Analysis [slides] - Panel Discussion: Learning Graph Transformation Rules [slides-Heckel] [slides-Strüber]