*banner
 

Domain Evolution in Visual Languages Using Graph Transformations
J. Sprinkle, A. Agrawal, T. Levendovsky, F. Shi, G. Karsai

Citation
J. Sprinkle, A. Agrawal, T. Levendovsky, F. Shi, G. Karsai. "Domain Evolution in Visual Languages Using Graph Transformations". In OOPSLA, 2nd ACM OOPSLA Workshop on Domain-Specific Languages, November, 2002.

Abstract
Domain-specific visual programming is a convenient way to hide complexity from the pro-grammer. The careful thought and design that precede the development of any domain-specific visual language restrict the programmer from illegal formalisms, and allow for the rapid determination of the validity of the “program”. Usually, the domain-specific visual language is designed and produced using a metamodel of some sort. However, changes in the metamodel can lead to disastrous results when attempting to process domain-models built according to the original specifications. This paper presents a visual language for trans-forming domain-models that can express the mapping between the meta-models of the “in-put” (i.e. the “old” language) and the “output” (i.e. the “new” language), and uses graph-rewriting techniques to transform the “old” domain-models into the appropriate “new” form.

Electronic downloads

Citation formats  
  • HTML
    J. Sprinkle, A. Agrawal, T. Levendovsky, F. Shi, G. Karsai.
    <a
    href="http://chess.eecs.berkeley.edu/pubs/747.html"
    >Domain Evolution in Visual Languages Using Graph
    Transformations</a>, In OOPSLA, 2nd ACM OOPSLA
    Workshop on Domain-Specific Languages, November, 2002.
  • Plain text
    J. Sprinkle, A. Agrawal, T. Levendovsky, F. Shi, G. Karsai.
    "Domain Evolution in Visual Languages Using Graph
    Transformations". In OOPSLA, 2nd ACM OOPSLA Workshop on
    Domain-Specific Languages, November, 2002.
  • BibTeX
    @inproceedings{SprinkleAgrawalLevendovskyShiKarsai02_DomainEvolutionInVisualLanguagesUsingGraphTransformations,
        author = {J. Sprinkle and A. Agrawal and T. Levendovsky and
                  F. Shi and G. Karsai},
        title = {Domain Evolution in Visual Languages Using Graph
                  Transformations},
        booktitle = {In OOPSLA, 2nd ACM OOPSLA Workshop on
                  Domain-Specific Languages},
        month = {November},
        year = {2002},
        abstract = {Domain-specific visual programming is a convenient
                  way to hide complexity from the pro-grammer. The
                  careful thought and design that precede the
                  development of any domain-specific visual language
                  restrict the programmer from illegal formalisms,
                  and allow for the rapid determination of the
                  validity of the âprogramâ. Usually, the
                  domain-specific visual language is designed and
                  produced using a metamodel of some sort. However,
                  changes in the metamodel can lead to disastrous
                  results when attempting to process domain-models
                  built according to the original specifications.
                  This paper presents a visual language for
                  trans-forming domain-models that can express the
                  mapping between the meta-models of the
                  âin-putâ (i.e. the âoldâ language) and the
                  âoutputâ (i.e. the ânewâ language), and
                  uses graph-rewriting techniques to transform the
                  âoldâ domain-models into the appropriate
                  ânewâ form.},
        URL = {http://chess.eecs.berkeley.edu/pubs/747.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