Name
Abstract | ||
|---|---|---|
In graph transformation, a conflict describes a situation where two alternative transformations cannot be arbitrarily serialized. When enriching graphs with attributes, existing conflict detection techniques typically report a conflict whenever at least one of two transformations manipulates a shared attribute. In this paper, we propose an improved, less conservative condition for static conflict detection of graph transformation with attributes by explicitly taking the semantics of the attribute operations into account. The proposed technique is based on symbolic graphs, which extend the traditional notion of graphs by logic formulas used for attribute handling. The approach is proven complete, i.e., any potential conflict is guaranteed to be detected. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.4204/EPTCS.181.7 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Field | DocType | Issue |
Graph,Shared attribute,Theoretical computer science,Graph rewriting,Semantics,Mathematics | Journal | 181 |
ISSN | Citations | PageRank |
2075-2180 | 2 | 0.37 |
References | Authors | |
9 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Géza Kulcsár | 1 | 18 | 4.07 |
| Frederik Deckwerth | 2 | 42 | 3.70 |
| Malte Lochau | 3 | 2 | 0.37 |
| Gergely Varró | 4 | 403 | 36.67 |
| Andy Schürr | 5 | 2195 | 230.25 |