Computability
Science of Computer Programming
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Dactl: An Experimental Graph Rewriting Language
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
A Graph Rewriting Programming Language for Graph Drawing
VL '98 Proceedings of the IEEE Symposium on Visual Languages
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
A Sight-seeing Tour of the Computational Landscape of Graph Transformation
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Graph Multiset Transformation as a Framework for Massively Parallel Computation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Development of Correct Graph Transformation Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
The Graph Programming Language GP
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Natural Computing: an international journal
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Hoare-Style Verification of Graph Programs
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
A visual token-based formalization of BPMN 2.0 based on in-place transformations
Information and Software Technology
Graph and model transformation tools for model migration
Software and Systems Modeling (SoSyM)
| Hi-index | 0.01 |
We identify a set of programming constructs ensuring that a programming language based on graph transformation is computationally complete. These constructs are (1) nondeterministic application of a set of graph transformation rules, (2) sequential composition and (3) iteration. This language is minimal in that omitting either sequential composition or iteration results in a computationally incomplete language. By computational completeness we refer to the ability to compute every computable partial function on labelled graphs. Our completeness proof is based on graph transformation programs which encode arbitrary graphs as strings, simulate Turing machines on these strings, and decode the resulting strings back into graphs.