Tyrolean termination tool: Techniques and features
Information and Computation
Practical use of polynomials over the reals in proofs of termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Termination by Bounded Increase
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Search Techniques for Rational Polynomial Orders
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automated Implicit Computational Complexity Analysis (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Complexity, Graphs, and the Dependency Pair Method
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Automatic Proofs of Termination With Elementary Interpretations
Electronic Notes in Theoretical Computer Science (ENTCS)
Improved Matrix Interpretation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A3PAT, an approach for certified automated termination proofs
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Polytool: proving termination automatically based on polynomial interpretations
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Cdiprover3: a tool for proving derivational complexities of term rewriting systems
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
From matrix interpretations over the rationals to matrix interpretations over the naturals
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming
Certification of safe polynomial memory bounds
FM'11 Proceedings of the 17th international conference on Formal methods
Polynomial interpretations as a basis for termination analysis of logic programs
ICLP'05 Proceedings of the 21st international conference on Logic Programming
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints
Journal of Automated Reasoning
Monotonicity criteria for polynomial interpretations over the naturals
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
| Hi-index | 0.00 |
Annotating a letter by a number, one can record information about its history during a rewrite derivation. In each rewrite step, numbers in the reduct are updated depending on the redex numbering. A string rewriting system is called match-bounded ...