Strong Joinability Analysis for Graph Transformation Systems in CHR

Authors:
Frank Raiser;Thom Frühwirth
Affiliations:
Institute for Software Engineering and Compiler Construction Ulm University;Institute for Software Engineering and Compiler Construction Ulm University
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 7
Cited 1

Confluence and Semantics of Constraint Simplification Rules

Constraints
Operational Equivalence of CHR Programs and Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Constraint Handling Rules

Constraint Handling Rules
Observable confluence for constraint handling rules

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Graph transformation systems in CHR

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Confluence of graph transformation revisited

Processes, Terms and Cycles

Analysing graph transformation systems through constraint handling rules

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of confluence is prevalent in graph transformation systems (GTS) as well as constraint handling rules (CHR). This work presents a generalized embedding of GTS in CHR that allows to consider strong derivations in confluence analyses. Confluence of a terminating CHR program is decidable, whereas confluence of a terminating GTS is undecidable. We show that observable confluence in CHR coincides with a sufficient criterion for confluence of the embedded GTS. For this purpose the automatic confluence check for CHR can be reused.