Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Relaxing monotonicity for innermost termination
Information Processing Letters
On proving C ε-termination of rewriting by size-change termination
Information Processing Letters
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
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
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Dependency Pairs for Rewriting with Non-free Constructors
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving Termination Using Recursive Path Orders and SAT Solving
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
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
Certifying a Termination Criterion Based on Graphs, without Graphs
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
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
Relaxing monotonicity for innermost termination
Information Processing Letters
On proving C E-termination of rewriting by size-change termination
Information Processing Letters
Size-change termination for term rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Monotonic AC-compatible semantic path orderings
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of narrowing in left-linear constructor systems
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Context-sensitive dependency pairs
Information and Computation
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
SAT solving for argument filterings
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Goal-directed and relative dependency pairs for proving the termination of narrowing
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Termination of context-sensitive rewriting with built-in numbers and collection data structures
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
Paramodulation with Non-Monotonic Orderings and Simplification
Journal of Automated Reasoning
Unifying the Knuth-Bendix, recursive path and polynomial orders
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |