arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.1497cs.LOcs.PL
收藏

用约束处理规则分析图变换系统

Analyzing Graph Transformation Systems through Constraint Handling Rules

Frank Raiser, Thom Frühwirth

摘要:

图转换系统和约束处理规则是基于规则的非确定性状态转换系统。GTS以其强大的融合和程序等价性分析而闻名,为此,我们在这项工作中提供了将其应用于GTS的基础。我们给出了一个健全的和完整的嵌入GTS的可移植性,研究了一个嵌入的GTS的融合,并提供了一个程序等价性分析GTS通过嵌入。结果证实了适用的CHR为基础的程序分析嵌入在CHR的其他形式主义。

英文摘要:

Graph 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑