Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
show main publications
Formal Integration of Inheritance with Typed Attributed Graph Transformation for Efficient VL Definition and Model Manipulation
@INPROCEEDINGS{EEPT05a,
title = {{Formal Integration of Inheritance with Typed Attributed Graph Transformation for Efficient VL Definition and Model Manipulation}},
author = {{Hartmut} {Ehrig} and {Karsten} {Ehrig} and {Ulrike} {Prange} and {Gabriele} {Taentzer}},
booktitle = {Proc. IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)},
abstract = {Several approaches exist to define a visual language (VL). Among those the meta-modeling approach used to define the Unified Modeling Language (UML), and the graph transformation approach are very popular. Especially the combination of both, using meta-modeling to define the syntax of a VL and graph transformation for specifying model transformations has been considered conceptually and explored in a number of applications. A formal integration of both approaches has just been started by integrating classical algebraic graph grammars with a node type inheritance concept. In this paper, the integration of inheritance is extending to attributed graph transformation. More precisely, we define attributed type graphs with inheritance leading to a formal integration of inheritance with typed attributed graph transformation.},
year = {2005},
url = {http://tfs.cs.tu-berlin.de/publikationen/Papers05/EEPT05a.pdf},
address = {Dallas, IEEE Computer Society, Texas, USA},
keywords = {graph transformation, inheritance, typed attributed graphs},
month = {September},
partner = {ULEICES},
status = {public},
task = {T7.1},
}
|
