Derivational complexity and context-sensitive Rewriting
From MaRDI portal
Recommendations
Cites work
- A note on simplification orderings
- Algorithms with polynomial interpretation termination proof
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Applications and extensions of context-sensitive rewriting
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- Automated Complexity Analysis Based on the Dependency Pair Method
- 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
- Classes of Predictably Computable Functions
- Complexity analysis of term rewriting based on matrix and context dependent interpretations
- Context-sensitive rewriting strategies
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 1318515 (Why is no real title available?)
- scientific article; zbMATH DE number 1342224 (Why is no real title available?)
- scientific article; zbMATH DE number 1348481 (Why is no real title available?)
- scientific article; zbMATH DE number 1142319 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 2090080 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Matrix interpretations for proving termination of term rewriting
- Mechanically proving termination using polynomial interpretations
- Mechanizing and improving dependency pairs
- mu-term: Verify Termination Properties Automatically (System Description)
- Parameterized strategies specification in Maude
- Polynomially bounded matrix interpretations
- Polynomials over the reals in proofs of termination : from theory to practice
- Programming and symbolic computation in Maude
- Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
- Revisiting matrix interpretations for proving termination of term rewriting
- Signature extensions preserve termination. An alternative proof via dependency pairs
- Synthesis of sup-interpretations: a survey
- Term Rewriting and All That
- Termination of context-sensitive rewriting
- Termination of term rewriting using dependency pairs
- Termination of term rewriting: Interpretation and type elimination
- Termination proofs and the length of derivations
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
- The derivational complexity induced by the dependency pair method
Cited in
(5)- On ``inherently context-sensitive languages -- an application of complexity cores
- scientific article; zbMATH DE number 3878384 (Why is no real title available?)
- scientific article; zbMATH DE number 4041318 (Why is no real title available?)
- scientific article; zbMATH DE number 1234886 (Why is no real title available?)
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
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)
