Derivational complexity and context-sensitive Rewriting
From MaRDI portal
Publication:2069872
DOI10.1007/s10817-021-09603-1OpenAlexW3193667803MaRDI QIDQ2069872
Publication date: 21 January 2022
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-021-09603-1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- Mechanically proving termination using polynomial interpretations
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- A note on simplification orderings
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Termination of term rewriting: Interpretation and type elimination
- Automated reasoning. 9th international joint conference, IJCAR 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 14--17, 2018. Proceedings
- Context-sensitive rewriting strategies
- Synthesis of sup-interpretations: a survey
- Termination of term rewriting using dependency pairs
- Applications and extensions of context-sensitive rewriting
- Parameterized strategies specification in Maude
- Programming and symbolic computation in Maude
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Algorithms with polynomial interpretation termination proof
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
- Classes of Predictably Computable Functions
- Automated Complexity Analysis Based on the Dependency Pair Method
- Signature Extensions Preserve Termination
- Termination of context-sensitive rewriting
- Term Rewriting and All That
- Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
- mu-term: Verify Termination Properties Automatically (System Description)
- Termination proofs and the length of derivations
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- Polynomials over the reals in proofs of termination : from theory to practice
- Revisiting Matrix Interpretations for Proving Termination of Term Rewriting
- POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS
- The Derivational Complexity Induced by the Dependency Pair Method
This page was built for publication: Derivational complexity and context-sensitive Rewriting
