Evolving Graphs With Semantic Neutral Drift | 0 | 0.34 | 2021 |
Confluence Up To Garbage In Graph Transformation | 0 | 0.34 | 2021 |
Horizontal gene transfer for recombining graphs | 0 | 0.34 | 2020 |
Evolving graphs with horizontal gene transfer | 1 | 0.35 | 2019 |
Linear-Time Graph Algorithms in GP 2. | 0 | 0.34 | 2019 |
Preface to the special issue on the 10th International Conference on Graph Transformation. | 0 | 0.34 | 2019 |
Modular Termination of Graph Transformation. | 0 | 0.34 | 2018 |
Evolving Graphs by Graph Programming. | 1 | 0.35 | 2018 |
Verifying a Copying Garbage Collector in GP 2. | 0 | 0.34 | 2018 |
Checking Graph Programs for Confluence. | 0 | 0.34 | 2017 |
From imperative to rule-based graph programs. | 2 | 0.51 | 2017 |
A Unification Algorithm for GP 2 (Long Version). | 0 | 0.34 | 2017 |
Towards Critical Pair Analysis for the Graph Programming Language GP 2. | 0 | 0.34 | 2016 |
Reasoning About Graph Programs | 0 | 0.34 | 2016 |
Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem. | 0 | 0.34 | 2016 |
Compiling Graph Programs To C | 4 | 0.45 | 2016 |
A Reference Interpreter For The Graph Programming Language Gp 2 | 5 | 0.56 | 2015 |
A Unification Algorithm for GP 2. | 0 | 0.34 | 2014 |
Verifying Monadic Second-Order Properties of Graph Programs. | 11 | 0.56 | 2014 |
Verifying Total Correctness of Graph Programs. | 7 | 0.44 | 2013 |
Rooted Graph Programs. | 1 | 0.34 | 2012 |
$\mathcal M, \mathcal N$ -Adhesive Transformation Systems. | 0 | 0.34 | 2012 |
Hoare-Style Verification of Graph Programs | 21 | 0.88 | 2012 |
Minimizing Finite Automata with Graph Programs | 0 | 0.34 | 2011 |
The Design Of Gp 2 | 5 | 0.44 | 2011 |
A hoare calculus for graph programs | 7 | 0.53 | 2010 |
Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday | 0 | 0.34 | 2010 |
Checking Graph-Transformation Systems for Confluence | 5 | 0.43 | 2010 |
The Semantics Of Graph Programs | 3 | 0.57 | 2009 |
The Graph Programming Language GP | 30 | 1.39 | 2009 |
The GP Programming System | 1 | 0.42 | 2008 |
The York Abstract Machine | 5 | 0.91 | 2008 |
From Hyperedge Replacement to Separation Logic and Back | 4 | 0.39 | 2008 |
Theory and applications of term graph rewriting: introduction | 0 | 0.34 | 2007 |
Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools | 19 | 1.35 | 2007 |
Extending C for Checking Shape Safety | 3 | 0.46 | 2006 |
Confluence of graph transformation revisited | 31 | 1.32 | 2005 |
Checking the Shape Safety of Pointer Manipulations | 11 | 0.78 | 2003 |
Diagrams for meaning preservation | 6 | 0.51 | 2003 |
Specifying Pointer Structures by Graph Reduction | 21 | 1.20 | 2003 |
TERMGRAPH 2002 - Workshop Survey | 0 | 0.34 | 2002 |
Double-pushout graph transformation revisited | 40 | 2.40 | 2001 |
Solving Equations by Graph Transformation. | 1 | 0.34 | 2001 |
Essentials of Term Graph Rewriting | 15 | 0.81 | 2001 |
Computational Completeness of Programming Languages Based on Graph Transformation | 28 | 1.75 | 2001 |
Hierarchical graph transformation | 39 | 2.08 | 2000 |
Bisimilarity in term graph rewriting | 10 | 0.79 | 2000 |
Graph transformation for specification and programming | 71 | 10.10 | 1999 |
Termination of graph rewriting is undecidable | 45 | 3.02 | 1998 |
Double-Pushout Approach with Injective Matching | 3 | 0.51 | 1998 |