| Publication type: |
Article in Proceedings |
| Author: |
Minas, Mark, Hoffmann, Berthold |
| Editor: |
Echahed, Rachid, Habel, Annegret, Mosbah, Mohamed |
| Title: |
Generating Instance Graphs from Class Diagrams with Adaptive Star Grammars |
| Book / Collection title: |
International Workshop on Graph Computation Models (GCM 10) |
| Volume: |
39 |
| Page(s): |
20 pages |
| Series: |
Electr. Comm. of the EASST |
| Year published: |
2011 |
| Publisher: |
European Association of Software and System Science, Potsdam, Germany |
| Abstract: |
In model-driven software engineering, class diagrams are used to define the structure of object-oriented software and valid object configurations, i.e., what objects may occur in a program and how they are related. Essentially, object configurations are graphs, so that class diagrams define a graph language. Class diagrams are declarative, i.e., it is quite easy to check whether a graph is an instance of a class diagram. Graph grammars, on the other hand, define a graph language by derivation and are thus well suited for constructing instance graphs. % This paper describes how a class diagrams can be translated into a graph grammar that defines the same graph language as the original class diagram. Such a graph grammar may then be used for, e.g., automatically generating valid object configurations as test cases. In contrast to earlier attempts, the presented approach allows to translate class diagrams with arbitrary multiplicities, unique and not-unique associations, composition associations, and class generalization. This is made possible by using adaptive star grammars, a special kind of graph grammars. |
| PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/icd.pdf |
| Keywords: |
program models graph grammars class diagrams |
| Status: |
Reviewed |
| Last updated: |
21. 09. 2011 |
|
 |
