Automating confluence check of term rewriting systems

Junichi Yoshida, Takahito Aoto, Yoshihito Toyama

研究成果: Article査読

3 被引用数 (Scopus)

抄録

We propose an automated confluence checker for term rewriting systems (TRSs) that combines several criteria for proving the confluence property of TRSs. For a TRS to which none of confluence criteria directly applies, our checker automatically decomposes it into small components using direct sum decomposition and commutative decomposition, and applies the confluence criteria to each component so that the confluence of the whole system is checked by combining these results. For the best of our knowledge, an automated confluence checker based on such an approach has been unknown. We have implemented our checker, and have successfully applied our checker to automatically check the confluence of a complex TRS, to which none of known confluence criteria applies directly. We also construct a collection of sample TRSs mainly extracted from papers on confluence of TRSs and perform an experiment to this collection.

本文言語English
ページ(範囲)76-92
ページ数17
ジャーナルComputer Software
26
2
出版ステータスPublished - 2009
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「Automating confluence check of term rewriting systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル