| Art der Veröffentlichung: |
Artikel in Konferenzband |
| Autor: |
Hoffmann, Berthold |
| Herausgeber: |
Manipulation of Graphs, Algebras, Pictures |
| Titel: |
Conditional Adaptive Star Grammars |
| Buch / Sammlungs-Titel: |
Manipulation of Graphs, Algebras and Pictures |
| Seite(n): |
171 – 189 |
| Erscheinungsjahr: |
2009 |
| Abstract / Kurzbeschreibung: |
The precise specification of software models is a major concern in
model-driven design of object-oriented software.
In this paper, we investigate how program graphs, a language-independent
model of object-oriented programs, can be specified precisely, with a focus
on static structure rather than behavior.
Graph grammars are a natural candidate for specifying the structure of a class
of graphs.
However, neither star grammars---which are equivalent to the well-known
hyperedge replacement grammars---nor the recently proposed adaptive star
grammars allow all relevant properties of program graphs to be specified.
So we extend adaptive star rules by positive and negative
application conditions, and show that the resulting conditional
adaptive star grammars are powerful enough to generate program graphs.
|
| PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/casg.pdf |
| Status: |
Reviewed |
| Letzte Aktualisierung: |
25. 02. 2010 |
|
 |
