(Enter summary)
Abstract: Shapely nested graph transformation is the computational model for DiaPlan, a language for programming with graphs that represent diagrams. It supports nested structuring of graphs, structural graph types (shapes), and graph variables. In this paper, we extend the model by two concepts that are essential for programming: abstraction allows compound transformations to be named and parameterized, and control allows the order of rule application to be specified. These concepts combine neatly with... (Update)
Cited by: More
Unknown - Copying Subgraphs Within
(Correct)
Active bibliography (related documents): More All
1.7: Constructing Shapely Nested Graph Transformations - Drewes, Hoffmann, Minas
(Correct)
1.0: Transformation of Shaped Nested Graphs and Diagrams - Hoffmann, Minas (2001)
(Correct)
0.6: Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002)
(Correct)
Similar documents based on text: More All
0.5: Shapely Hierarchical Graph Transformation - Hoffmann (2001)
(Correct)
0.3: Specifying and Implementing Visual Process Modeling Languages .. - Minas, Hoffmann (2001)
(Correct)
0.3: From Graph Transformation to Rule-based Programming with Diagrams - Hoffmann (2000)
(Correct)
BibTeX entry: (Update)
Berthold Hoffmann. Abstraction and Control for Shapely Nested Graph Transformation. Fundamenta Informaticae, 58(1):39--65, 2003. http://citeseer.ist.psu.edu/hoffmann03abstraction.html More
@misc{ hoffmann03abstraction,
author = "B. Hoffmann",
title = "Abstraction and Control for Shapely Nested Graph Transformation",
text = "Berthold Hoffmann. Abstraction and Control for Shapely Nested Graph Transformation.
Fundamenta Informaticae, 58(1):39--65, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/hoffmann03abstraction.html" }
Citations (may not include all citations):
474
Term rewriting systems
- Klop - 1992
200
Solving shape-analysis problems in languages with destructiv..
- Sagiv, Reps et al. - 1998
148
Handbook of Graph Grammars and Computing by Graph Transforma.. (context) - Rozenberg - 1997
47
Hyperedge replacement graph grammars (context) - Drewes, Habel et al.
32
Hierarchical graph transformation
- Drewes, Ho et al. - 2002
19
The Agg approach: Language and environment (context) - Ermel, Rudolf et al.
17
Science of Computer Programming (context) - Fradet, Le and et al. - 1998
15
Concepts and realization of a diagram editor generator based..
- Minas - 2002
13
Graph transformation units and modules
- Kreowski, Kuske
12
The Progres approach: Language and environment
- Sch, Winter et al.
10
Graph transformation as a conceptual and formal framework fo.. (context) - Engels, Heckel - 2000
10
The algebraic speci cation of abstract data types (context) - Guttag, Horning - 1978
9
Handbook of Graph Grammars and Computing by Graph Transforma.. (context) - Engels, Ehrig et al. - 1999
7
Number 643 in Lecture Notes in Computer Science (context) - Habel, Grammars - 1992
7
Graph uni cation and matching (context) - Plump, Habel - 1996
6
An Abstract Model of Hierarchical Graphs and Hierarchical Gr.. (context) - Busatto - 2002
6
From graph transformation to rule-based programming with dia.. (context) - Ho - 2000
4
Shapely hierarchical graph transformation (context) - Ho - 2001
3
Towards rule-based visual programming of generic visual syst.. (context) - Ho, Minas - 2000
3
Constructing shapely nested graph transformations
- Drewes, Ho et al. - 2002
2
Computing by Graph Rewriting (context) - Plump - 1999
1
A Structuring Pronciple for Graph Transformation Systems (context) - Kuske - 2000
Documents on the same site (http://www.informatik.uni-bremen.de/~hof/research/publications/): More
Reiko's Simple Modules for GRACE - Heckel, Hoffmann, Kuske (1997)
(Correct)
Graph Transformation for Specification and Programming - Andries, Engels, Habel.. (1996)
(Correct)
Memoïzation for Term (Hypergraph) Rewriting (Extended.. - Hoffmann
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC