Improved Conflict Detection for Graph Transformation with Attributes

April 10, 2015 Β· Declared Dead Β· πŸ› GaM

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors GΓ©za KulcsΓ‘r, Frederik Deckwerth, Malte Lochau, Gergely VarrΓ³, Andy SchΓΌrr arXiv ID 1504.02614 Category cs.SE: Software Engineering Cross-listed cs.LO Citations 13 Venue GaM Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Software Engineering

Died the same way β€” πŸ‘» Ghosted