GCM 2020

Eleventh International Workshop on Graph Computation Models

24 June 2020, as Online-Workshop

Previously Part of STAF 2020

GCM 2020 Online Program

  • GCM 2020 will be held as an online workshop on June 24, 2020 using Zoom as a video-conferencing platform.

  • Details on attending the online-workshop will be made available after registration.

  • All times are MEST times

  • Note that all paper sessions, the opening, and the closing take place in Zoom meeting 911 4949 1486, whereas all breaks take place in Zoom meeting 940 4966 5357.

  • See our "How to attend" for information how to attend the workshop and the sessions.

Wednesday, 24 June 2020

09:00-10:30 Opening & Session 1 (Graphs and Models, chaired by Leen Lambers)

(Zoom meeting 911 4949 1486)

      • Nils Weidmann, Anthony Anjorin and James Cheney. VICToRy: Visual Interactive Consistency Management in Tolerant Rule-based Systems

      • Christian Sandmann. Graph repair and its application to meta-modelling

      • Okan Özkan. Modeling Adverse Conditions in the Framework of Graph Transformation Systems

10:30-11:00 Break

(Zoom meeting 940 4966 5357)

11:00-12:30 Session 2 (Algebraic and Categorical Approaches, chaired by Fernando Orejas)

(Zoom meeting 911 4949 1486)

      • Dominique Duval, Rachid Echahed and Frédéric Prost. An Algebraic Graph Transformation Approach for RDF and SPARQL

      • Hans-Jörg Kreowski and Aaron Lye. Graph Surfing in Reaction Systems from a Categorical Perspective

      • Andrea Corradini, Maryam Ghaffari Saadat and Reiko Heckel. Encoding NACs in Graph Grammars using Complementation

12:30-14:30 Break

(Zoom meeting 940 4966 5357)

14:30-16:00 Session 3 (Grammars and Rule Composition, chaired by Detlef Plump)

(Zoom meeting 911 4949 1486)

      • Tikhon Pshenitsyn. Weak Greibach normal form for hyperedge replacement grammars

      • Nicolas Behr, Maryam Ghaffari Saadat and Reiko Heckel. Efficient Computation of Graph Overlaps for Rule Composition: Theory and Z3 Prototyping

      • Russ Harmer and Eugenia Oshurko. Reversibility and composition of rewriting in hierarchies

16:00-16:30 Break

(Zoom meeting 940 4966 5357)

16:30-17:50 Session 4 (Graph Programs, chaired by Rachid Echahed)

(Zoom meeting 911 4949 1486)

      • Brian Courtehoute and Detlef Plump. A Fast Graph Program for Computing Minimum Spanning Trees

      • Gia S. Wulandari and Detlef Plump. Verifying Graph Programs with First-Order Logic

      • Graham Campbell, Jack Romö and Detlef Plump. The Improved GP 2 Compiler

17:50-18:00 Closing

(Zoom meeting 911 4949 1486)