Strong Joinability Analysis for Graph Transformation Systems in CHR

DOI10.1016/j.entcs.2009.10.019zbMath1291.68221OpenAlexW2159901860MaRDI QIDQ5170283

Thom Frühwirth, Frank Raiser

Publication date: 23 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.10.019

zbMATH Keywords

confluencegraph transformation systemsconstraint handling rules

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (1)

Strong Joinability Analysis for Graph Transformation Systems in CHR

Cites Work

• Unnamed Item
• Confluence and semantics of constraint simplification rules
• Fundamentals of algebraic graph transformation
• Observable Confluence for Constraint Handling Rules
• Graph Transformation Systems in CHR
• Constraint Handling Rules
• Strong Joinability Analysis for Graph Transformation Systems in CHR
• Termination Analysis of CHR Revisited
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Strong Joinability Analysis for Graph Transformation Systems in CHR