Proving Termination of Context-Sensitive Rewriting with MU-TERM

Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem with several applications in the fields of term rewriting and programming languages. Several methods have been developed for proving termination of CSR. The new version of MU-TERM which we present here implements all currently known techniques. Furthermore, we show how to combine them to furnish MU-TERM with an expert which is able to automatically perform the termination proofs. Finally, we provide a first experimental evaluation of the tool.

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Beatriz Alarcón, Raúl Gutiérrez, José Iborra, Salvador Lucas
• Keywords: ENTCS 2007, Interesting Problem, Reductions, Several Methods