Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 2003

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Context-exploiting shapes for diagram transformation

Drewes F., Hoffmann B., Minas M.

Machine Graphics and Vision

2003

Vol. 12, No. 1

117-132

DIA PLAN is a language for programming with graphs representing diagram that is currently being developed. The computational model of the language - nested graph transformation - suports 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 contexy-exploiting shape rules with which many relevant graph structures can be specifed. The conformance of a nested graph to the shape rules is decidable. If a trabsformation 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.

Abstraction and Control for Shapely Nested Graph Transformation

Hoffmann B.

Fundamenta Informaticae

2003

Vol. 58, nr 1

39--65

Shapely nested graph transformation is the computational model for DIAPLAN, a language for programming with graphs representing diagrams that is currently being developed. The model supports nested structuring of graphs, structural graph types (shapes), and rules with graph variables. We extend this model by two concepts that are essential for programming: abstraction allows compound transformations to be named and parameterized; control allows the order of rule application to be specified. These concepts refine the computational model with respect to structuring and efficiency needs of a programming language while preserving its rule-based and graph-ical nature.