Skip to main content
SpringerLink
Log in

Efficient Graph Rewriting and Its Implementation

  • Book
  • © 1995

Overview

Editors:
  1. Heiko Dörr
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 922)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Download chapter 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

    Download chapter PDF
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation