Efficient Graph Rewriting and Its Implementation

1995
ISBN: 978-3-540-60055-8
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 922, 266 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 435 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Dörr, Heiko

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Kybernetik, Systemtheorie, Komplexe Systeme
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik Mathematik Mathematik Interdisziplinär Systemtheorie
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

Graph rewriting systems — The basic concepts.- UBS-Graph rewriting systems — matching subgraphs in constant time.- Programmed attributed graph rewrite systems — An advanced modelling formalism.- The abstract machine for graph rewriting — supporting a fast implementation.- A graphical implementation of functional languages — a case study in UBS-graph rewriting systems.- Conclusions.