The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 9 of 21
Back to Result List

Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs

  • Inheritance is an important and widely spread concept enabling the elegant expression of hierarchy in object-oriented software programs or models. It has been defined for graphs and graph transformations enhancing the applicability of this formal technique. Up to now, for the analysis of transformations with inheritance a flattening construction has been used, which yields all the well-known results for graph transformation but results in a large number of graphs and rules that have to be analyzed. In this paper, we introduce a new category of typed attributed graphs with inheritance. For the detection of conflicts between graph transformations on these graphs, the notion of abstract critical pairs is defined. This allows us to perform the analysis on polymorphic rules and transformations without the need for flattening, which significantly increases the efficiency of the analysis and eases the interpretation of the analysis results. The new main result is the Local Confluence Theorem for typed attributed graph transformation withInheritance is an important and widely spread concept enabling the elegant expression of hierarchy in object-oriented software programs or models. It has been defined for graphs and graph transformations enhancing the applicability of this formal technique. Up to now, for the analysis of transformations with inheritance a flattening construction has been used, which yields all the well-known results for graph transformation but results in a large number of graphs and rules that have to be analyzed. In this paper, we introduce a new category of typed attributed graphs with inheritance. For the detection of conflicts between graph transformations on these graphs, the notion of abstract critical pairs is defined. This allows us to perform the analysis on polymorphic rules and transformations without the need for flattening, which significantly increases the efficiency of the analysis and eases the interpretation of the analysis results. The new main result is the Local Confluence Theorem for typed attributed graph transformation with inheritance using abstract critical pairs. All constructions and results are demonstrated on an example for the analysis of refactorings. (C) 2012 Elsevier B.V. All rights reserved.show moreshow less

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Ulrike Golas, Leen LambersORCiDGND, Hartmut Ehrig, Fernando OrejasORCiD
DOI:https://doi.org/10.1016/j.tcs.2012.01.032
ISSN:0304-3975
Title of parent work (English):THEORETICAL COMPUTER SCIENCE
Publisher:ELSEVIER SCIENCE BV
Place of publishing:AMSTERDAM
Publication type:Article
Language:English
Year of first publication:2012
Publication year:2012
Release date:2017/03/26
Tag:Critical pair analysis; Inheritance; M-adhesive category with NACs; Typed attributed graph transformation
Volume:424
Number of pages:23
First page:46
Last Page:68
Funding institution:Deutsche Forschungsgemeinschaft
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.