*banner
 

Reusable Idioms and Patterns in Graph Transformation Languages
A. Agrawal, Z.. Narayanan, F. Shi, A. Vizhanyo, G. Karsai

Citation
A. Agrawal, Z.. Narayanan, F. Shi, A. Vizhanyo, G. Karsai. "Reusable Idioms and Patterns in Graph Transformation Languages". International Conference on Graph Transformations, Electronic Notes in Theoretical Computer Science (ENTCS), March, 2005.

Abstract
Software engineering tools based on Graph Transformation techniques are becoming available, but their practical applicability is somewhat reduced by the lack of good idioms and design patterns related to these techniques. Idioms and design patterns provide prototypical solutions for recurring design problems in software engineering, but their use can be easily extended into the graph transformation systems. In this paper we briefly present a simple graph transformations language: GREAT, and show how typical design problems that arise in the context of model transformations can be solved using its constructs.

Electronic downloads

Citation formats  
  • HTML
    A. Agrawal, Z.. Narayanan, F. Shi, A. Vizhanyo, G. Karsai.
    <a
    href="http://chess.eecs.berkeley.edu/pubs/753.html"
    >Reusable Idioms and Patterns in Graph Transformation
    Languages</a>, International Conference on Graph
    Transformations, Electronic Notes in Theoretical Computer
    Science (ENTCS), March, 2005.
  • Plain text
    A. Agrawal, Z.. Narayanan, F. Shi, A. Vizhanyo, G. Karsai.
    "Reusable Idioms and Patterns in Graph Transformation
    Languages". International Conference on Graph
    Transformations, Electronic Notes in Theoretical Computer
    Science (ENTCS), March, 2005.
  • BibTeX
    @inproceedings{AgrawalNarayananShiVizhanyoKarsai05_ReusableIdiomsPatternsInGraphTransformationLanguages,
        author = {A. Agrawal and Z.. Narayanan and F. Shi and A.
                  Vizhanyo and G. Karsai},
        title = {Reusable Idioms and Patterns in Graph
                  Transformation Languages},
        booktitle = {International Conference on Graph Transformations,
                  Electronic Notes in Theoretical Computer Science
                  (ENTCS)},
        month = {March},
        year = {2005},
        abstract = {Software engineering tools based on Graph
                  Transformation techniques are becoming available,
                  but their practical applicability is somewhat
                  reduced by the lack of good idioms and design
                  patterns related to these techniques. Idioms and
                  design patterns provide prototypical solutions for
                  recurring design problems in software engineering,
                  but their use can be easily extended into the
                  graph transformation systems. In this paper we
                  briefly present a simple graph transformations
                  language: GREAT, and show how typical design
                  problems that arise in the context of model
                  transformations can be solved using its constructs.},
        URL = {http://chess.eecs.berkeley.edu/pubs/753.html}
    }
    

Posted by Christopher Brooks on 4 Nov 2010.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess