Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
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
Hierarchical termination revisited
Information Processing Letters
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
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Scheme-based synthesis of inductive theories
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Scheme-based theorem discovery and concept invention
Expert Systems with Applications: An International Journal
Processes, Terms and Cycles
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Hi-index | 0.00 |