Context-exploiting shapes for diagram transformation

Authors:
Frank Drewes;Berthold Hoffmann;Mark Minas
Affiliations:
Institutionen för Datavetenskap, Umeå Universitet, S-90187 Umeå;Technologiezentrum Informatik, Universität Bremen, D-28334 Bremen;Fachbereich Informatik, Universität der Bundeswehr, D-85577 Neubiberg
Venue:
Machine Graphics & Vision International Journal - Special issue on diagrammatics & Design
Year:
2003

Citing 15
Cited 5

Term rewriting systems

Handbook of logic in computer science (vol. 2)
Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Hyperedge replacement graph grammars

Handbook of graph grammars and computing by graph transformation
Structured Gamma

Science of Computer Programming
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools

Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Application of graph transformation to visual languages

Handbook of graph grammars and computing by graph transformation
The PROGRES approach: language and environment

Handbook of graph grammars and computing by graph transformation
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
Concepts and realization of a diagram editor generator based on hypergraph transformation

Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
Hierarchical graph transformation

Journal of Computer and System Sciences
The Category of Typed Graph Grammars and its Adjunctions with Categories

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
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
Abstraction and Control for Shapely Nested Graph Transformation

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Shapely Hierarchical Graph Transformation

HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Diagram Editing with Hypergraph Parser Support

VL '97 Proceedings of the 1997 IEEE Symposium on Visual Languages (VL '97)

Abstraction and control for shapely nested graph transformation

Fundamenta Informaticae - Special issue on the first international conference on graph transformation (ICGT 2002)
Rule-Based Programming with Diaplan

Electronic Notes in Theoretical Computer Science (ENTCS)
Cloning and Expanding Graph Transformation Rules for Refactoring

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstraction and Control for Shapely Nested Graph Transformation

Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
Contextual hyperedge replacement

AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance

Quantified Score

Hi-index	0.00

Visualization

Abstract

DIAPLAN is a language for programming with graphs representing diagrams that is currently being developed. The computational model of the language - nested graph transformation -- supports nested structuring of graphs and graph variables, but is still intuitive. This paper discusses structural typing of nested graphs and nested graph transformation systems by shape rules. We extend the context-free shape rules proposed in earlier work to context-exploiting shape rules with which many relevant graph structures can be specified. The conformance of a nested graph to the shape rules is decidable. If a transformation system conforms to shape rules as well, it can be shown to preserve shape conformance of the graphs it is applied to. This sets up a static type discipline for nested graph transformation.