Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Termination of Rewriting With Strategy Annotations
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
A3PAT, an approach for certified automated termination proofs
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Recursive path orderings can also be incremental
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Processes, Terms and Cycles
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Modularity in term rewriting revisited
Theoretical Computer Science
Hi-index | 0.00 |