Transformation of shaped nested graphs and diagrams
Hoffmann B, Minas M (2001)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 2001
Journal
Publisher: Elsevier BV
Edited Volumes: Electronic Notes in Theoretical Computer Science
Series: Electronic Notes in Theoretical Computer Science
City/Town: Amsterdam
Book Volume: 59
Pages Range: 305-319
Conference Proceedings Title: Proc. 2nd International Workshop on Rule-based Programming
Event location: Florenze, Italy
URI: http://www2.informatik.uni-erlangen.de/publication/download/RULE2001.pdf
DOI: 10.1016/S1571-0661(04)00294-4
Abstract
This paper describes a new computational model for rule-based programming with graphs and diagrams. Using existing nesting concepts for graphs, this model defines an intuitive way of nested graph transformation that is based on variable matching. Shape rules are introduced for specifying structural consistency conditions on nested graphs. Shape rules set up a decidable type discipline for a refined model of shapely nested graph transformation. Since the refined model is compatible with the diagram editor DIA GEN, it can be extended by customizable diagram interfaces so that it specifies rule-based diagram transformation. ©2001 Publisahed by Elsevier Elsevier Science B.V.
How to cite
APA:
Hoffmann, B., & Minas, M. (2001). Transformation of shaped nested graphs and diagrams. In van den Brand, M. ; Verma, R. (Eds.), Proc. 2nd International Workshop on Rule-based Programming (pp. 305-319). Florenze, Italy, IT: Amsterdam: Elsevier BV.
MLA:
Hoffmann, Berthold, and Mark Minas. "Transformation of shaped nested graphs and diagrams." Proceedings of the RULE 2001, affil. with "Principles, Logics, and Implementations of High-Level Programming Language" PLI 2001, Florenze, Italy Ed. van den Brand, M. ; Verma, R., Amsterdam: Elsevier BV, 2001. 305-319.
BibTeX: Download