Termination of Nested and Mutually Recursive Algorithms
Journal of Automated Reasoning
Testing Positiveness of Polynomials
Journal of Automated Reasoning
Dependent Types for Program Termination Verification
Higher-Order and Symbolic Computation
Cancellative abelian monoids and related structures in refutational theorem proving (Part I)
Journal of Symbolic Computation
On Automating Inductive and Non-inductive Termination Methods
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Termination Proofs by Context-Dependent Interpretations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Dependency Pairs for Equational Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Equational Termination by Semantic Labelling
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Proving Associative-Communicative Termination Using RPO-Compatible Orderings
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
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
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
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
Monotonic AC-compatible semantic path orderings
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Rewrite rules for search database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
AC completion with termination tools
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Proving Termination by Dependency Pairs and Inductive Theorem Proving
Journal of Automated Reasoning
Automation of recursive path ordering for infinite labelled rewrite systems
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Reducing right-hand sides for termination
Processes, Terms and Cycles
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
On The Diversity Of Orderings On Strings
Fundamenta Informaticae
Simplification Orderings: History Of Results
Fundamenta Informaticae
| Hi-index | 0.00 |