Proving Termination Properties with mu-term [chapter]

Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset
2011 Lecture Notes in Computer Science  
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost rewriting, termination of order-sorted rewriting, termination of context-sensitive rewriting, termination of innermost context-sensitive rewriting and termination of rewriting modulo specific axioms. Such termination properties are essential to prove termination of programs in sophisticated rewriting-based programming
more » ... languages. Specific methods have been developed and implemented in mu-term in order to efficiently deal with most of them. In this paper, we report on these new features of the tool.
doi:10.1007/978-3-642-17796-5_12 fatcat:5333qvps3bfgnlfywktz2wqch4