Citation
D. Balasubramanian, A. Narayanan, S. Neema, F. Shi, R. Thibodeaux, G. Karsai. "A Subgraph Operator for Graph Transformation Languages". Proceedings of 6th International Workshop on Graph Transformation and Visual Modeling Techniques, Braga, Portugal, March, 2007.

Abstract
In practical applications of graph transformation techniques to model transformations one often has the need for copying, deleting, or moving entire subgraphs that match a certain graph pattern. While this can be done using elementary node and edge operations, the transformation is rather cumbersome to write. To simplify the transformation, we have recently developed a novel approach that allows selecting subgraphs from the matched portion of the host graph, applying a filter condition to the selection, and performing a delete, move, or copy operation on the filtered result in the context of a transformation rule. The approach has been implemented in the GReAT language and tested on examples that show the practical efficacy of the technique. The paper describes the technique in detail and illustrates its use on a real-life example.

Electronic downloads

• http://www.cs.le.ac.uk/events/GTVMT07/

• HTML

  D. Balasubramanian, A. Narayanan, S. Neema, F. Shi, R.
  Thibodeaux, G. Karsai. <a
  href="http://chess.eecs.berkeley.edu/pubs/275.html"
  >A Subgraph Operator for Graph Transformation
  Languages</a>, Proceedings of 6th International
  Workshop on Graph Transformation and Visual Modeling
  Techniques, Braga, Portugal, March, 2007.

• Plain text

  D. Balasubramanian, A. Narayanan, S. Neema, F. Shi, R.
  Thibodeaux, G. Karsai. "A Subgraph Operator for Graph
  Transformation Languages". Proceedings of 6th
  International Workshop on Graph Transformation and Visual
  Modeling Techniques, Braga, Portugal, March, 2007.

• BibTeX

  @inproceedings{BalasubramanianNarayananNeemaShiThibodeauxKarsai07_SubgraphOperatorForGraphTransformationLanguages,
      author = {D. Balasubramanian and A. Narayanan and S. Neema
                and F. Shi and R. Thibodeaux and G. Karsai},
      title = {A Subgraph Operator for Graph Transformation
                Languages},
      booktitle = {Proceedings of 6th International Workshop on Graph
                Transformation and Visual Modeling Techniques,
                Braga, Portugal},
      month = {March},
      year = {2007},
      abstract = {In practical applications of graph transformation
                techniques to model transformations one often has
                the need for copying, deleting, or moving entire
                subgraphs that match a certain graph pattern.
                While this can be done using elementary node and
                edge operations, the transformation is rather
                cumbersome to write. To simplify the
                transformation, we have recently developed a novel
                approach that allows selecting subgraphs from the
                matched portion of the host graph, applying a
                filter condition to the selection, and performing
                a delete, move, or copy operation on the filtered
                result in the context of a transformation rule.
                The approach has been implemented in the GReAT
                language and tested on examples that show the
                practical efficacy of the technique. The paper
                describes the technique in detail and illustrates
                its use on a real-life example.},
      URL = {http://chess.eecs.berkeley.edu/pubs/275.html}
  }
  

Posted by Christopher Brooks on 6 Jun 2007.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.