Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Theoretical Computer Science - Special issue on theories of types and proofs
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Transforming Context-Sensitive Rewrite Systems
RtA '99 Proceedings of the 10th 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
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
On modularity in infinitary term rewriting
Information and Computation
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Tyrolean termination tool: Techniques and features
Information and Computation
Rewriting-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Some classes of term rewriting systems inferable from positive data
Theoretical Computer Science
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination of narrowing revisited
Theoretical Computer Science
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
On modularity in infinitary term rewriting
Information and Computation
Size-change termination for term rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Detecting non-termination of term rewriting systems using an unfolding operator
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Termination of rewriting with right-flat rules
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Proving Termination by Dependency Pairs and Inductive Theorem Proving
Journal of Automated Reasoning
Recursive path orderings can also be incremental
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Generalized innermost rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Processes, Terms and Cycles
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Modularity in term rewriting revisited
Theoretical Computer Science
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Simplification Orderings: History Of Results
Fundamenta Informaticae
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.90 |