Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of Rewriting With Strategy Annotations
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Termination of Order-sorted Rewriting
Proceedings of the Third International Conference on Algebraic and Logic Programming
Recursive Path Orderings Can Be Context-Sensitive
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
VMTL---A Modular Termination Laboratory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Innermost termination of context-sensitive rewriting
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Context-sensitive dependency pairs
Information and Computation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Proving termination in the context-sensitive dependency pair framework
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A dependency pair framework for A∨C-termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
AC completion with termination tools
CADE'11 Proceedings of the 23rd international conference on Automated deduction
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints
Journal of Automated Reasoning
| Hi-index | 0.00 |
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.