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 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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Alarcón, B., Gutiérrez, R., Lucas, S., & Navarro-Marset, R. (2011). Proving termination properties with mu-term. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6486 LNCS, pp. 201–208). https://doi.org/10.1007/978-3-642-17796-5_12
Mendeley helps you to discover research relevant for your work.