Proving and disproving confluence of context-sensitive rewriting

Citations Over Time

Abstract

Context-sensitive rewriting is a restriction of term rewriting where reductions are allowed on specific arguments of function symbols only, and then in particular positions of terms. Confluence is an abstract property of reduction relations guaranteeing that two diverging reduction sequences can always be joined into a common reduct. In this paper we investigate confluence of context-sensitive rewriting and present some novel results. In particular, a characterization of local confluence of context-sensitive rewriting as the joinability of an extended class of critical pairs which we introduce here. We also show that the treatment of joinability of critical pairs using theorem proving and solving feasibility problems is useful to automatically prove and disprove confluence of context-sensitive rewriting. Our techniques have been implemented in a new tool, CONFident. We show by means of benchmarks the impact of the new techniques discussed in the paper.

Related Papers

• → Development closed critical pairs(1996)18 cited
• → Checking Overlaps of Nominal Rewriting Rules(2016)9 cited
• → Nominal Confluence Tool(2016)5 cited
• → Proving and disproving confluence of context-sensitive rewriting(2022)3 cited
• → Completion of Globally Finite Term Rewriting Systems for Inductive Proofs(1986)6 cited