Derivational complexity and context-sensitive Rewriting
From MaRDI portal
Publication:2069872
DOI10.1007/S10817-021-09603-1OpenAlexW3193667803MaRDI QIDQ2069872FDOQ2069872
Authors: Salvador Lucas 
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
Recommendations
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Termination of term rewriting: Interpretation and type elimination
- Termination of term rewriting using dependency pairs
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Algorithms with polynomial interpretation termination proof
- Complexity analysis of term rewriting based on matrix and context dependent interpretations
- Automated Complexity Analysis Based on the Dependency Pair Method
- Termination proofs and the length of derivations
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- The derivational complexity induced by the dependency pair method
- Term Rewriting and All That
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signature extensions preserve termination. An alternative proof via dependency pairs
- Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
- Polynomially bounded matrix interpretations
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- Termination of context-sensitive rewriting
- Polynomials over the reals in proofs of termination : from theory to practice
- Mechanically proving termination using polynomial interpretations
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Context-sensitive rewriting strategies
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- A note on simplification orderings
- Title not available (Why is that?)
- Classes of Predictably Computable Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications and extensions of context-sensitive rewriting
- Title not available (Why is that?)
- Synthesis of sup-interpretations: a survey
- Revisiting matrix interpretations for proving termination of term rewriting
- Parameterized strategies specification in Maude
- Programming and symbolic computation in Maude
- mu-term: Verify Termination Properties Automatically (System Description)
Cited In (5)
Uses Software
This page was built for publication: Derivational complexity and context-sensitive Rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069872)
