Automating confluence check of term rewriting systems

Junichi Yoshida, Takahito Aoto, Yoshihito Toyama

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)76-92
Number of pages17
JournalComputer Software
Volume26
Issue number2
Publication statusPublished - 2009 Jul 29

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Automating confluence check of term rewriting systems'. Together they form a unique fingerprint.

Cite this