Constraints in computational logics
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
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
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
On proving C ε-termination of rewriting by size-change termination
Information Processing Letters
Predictive Labeling with Dependency Pairs Using SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
On proving C E-termination of rewriting by size-change termination
Information Processing Letters
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Harnessing first order termination provers using higher order dependency pairs
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Modularity in term rewriting revisited
Theoretical Computer Science
From diagrammatic confluence to modularity
Theoretical Computer Science
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
| Hi-index | 5.23 |