Author:
RAISER FRANK,FRÜHWIRTH THOM
Abstract
AbstractGraph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS and provide a program equivalence analysis for GTS via the embedding. The results confirm the suitability of CHR-based program analyses for other formalisms embedded in CHR.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference45 articles.
1. Van Weert P. 2008. JCHR. URL: http://www.cs.kuleuven.be/~petervw/JCHR.
2. Principal Type Inference for GHC-Style Multi-parameter Type Classes
3. As time goes by: Constraint Handling Rules
4. Strong joinability analysis for graph transformation systems in CHR;Raiser;Electronic Notes in Theoretical Computer Science – Proceedings of the Fifth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2009),2009
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献