Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Language Prototyping: An Algebraic Specification Approach: Vol. V
Language Prototyping: An Algebraic Specification Approach: Vol. V
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Hierarchical termination revisited
Information Processing Letters
Context-sensitive rewriting strategies
Information and Computation
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Termination of Context-Sensitive Rewriting by Rewriting
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Termination of Context-Sensitive Rewriting
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Recursive Path Orderings Can Be Context-Sensitive
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Advanced Topics in Term Rewriting
Advanced Topics in Term Rewriting
Operational termination of conditional term rewriting systems
Information Processing Letters
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Science of Computer Programming
Transformation for Refining Unraveled Conditional Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Improving the Context-sensitive Dependency Graph
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of just/fair computations in term rewriting
Information and Computation
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Computational Logical Frameworks and Generic Program Analysis Technologies
Verified Software: Theories, Tools, Experiments
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Operational Termination of Membership Equational Programs: the Order-Sorted Way
Electronic Notes in Theoretical Computer Science (ENTCS)
Web Services and Interoperability for the Maude Termination Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational termination of conditional term rewriting systems
Information Processing Letters
The maude formal tool environment
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On the completeness of context-sensitive order-sorted specifications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
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
Termination of fair computations in term rewriting
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Partial inversion of constructor term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example, ASF+SDF, OBJ, CafeOBJ, Maude, and equational subsets of ELAN and CASL. Proving termination of equational programs having such expressive features is important but nontrivial, because some of those features may not be supported by standard termination methods and tools, such as muterm, CiME, AProVE, TTT, Termptation, etc. Yet, use of the features may be essential to ensure termination. We present a sequence of theory transformations that can be used to bridge the gap between expressive equational programs and termination tools, prove the correctness of such transformations, and discuss a prototype tool performing the transformations on Maude equational programs and sending the resulting transformed theories to some of the aforementioned tools.