Efficient Graph Rewriting and Its Implementation

1. Front Matter

   PDF

2. Introduction

   Pages 1-8

3. Graph rewriting systems — The basic concepts

   Pages 9-33

4. UBS-Graph rewriting systems — matching subgraphs in constant time

   Pages 35-89

5. Programmed attributed graph rewrite systems — An advanced modelling formalism

   Pages 91-121

6. The abstract machine for graph rewriting — supporting a fast implementation

   Pages 123-162

7. A graphical implementation of functional languages — a case study in UBS-graph rewriting systems

   Pages 163-215

8. Conclusions

   Pages 217-221

9. Back Matter

   PDF

This book presents two major research results on the fast implementation of graph rewriting systems (GRS). First, it explores the class of so-called UBS-GRS, where the complexity of a rewriting step is linear instead of NP, showing for example that visual programming is possible by UBS graph rewriting. Second, an abstract machine for graph rewriting is defined providing an instruction set sufficient for the execution of GRS.
The basic definitions of GRS in the algorithmic approach are introduced and extended by attribution and control structures to comprise a formalism for an operational specification. The translation of a functional programming language to graph rewriting shows the capabilities of UBS-GRS.

• Attribut
• Efficient Implementation
• Effiziente Implementierung
• Functional Programming
• Funktionales Programmieren
• Graph Rewriting Systems
• Graphersetzungssysteme
• UBS Property
• UBS-Eigenschaft
• Visual Programming
• Visuelles Programmieren
• algorithms
• complexity

Policies and ethics