Automating inductionless induction using test sets
Journal of Symbolic Computation
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation - Special issue on automatic programming
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
An automated tool for analyzing completeness of equational specifications
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
A general framework to build contextual cover set
Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
A Methodological View of Constraint Solving
Constraints
Coloring Terms to Control Equational Reasoning
Journal of Automated Reasoning
Induction Proofs with Partial Functions
Journal of Automated Reasoning
Heuristics for completion in automatic proofs by structural induction
Nordic Journal of Computing
The Recognizability Problem for Tree Automata with Comparisons between Brothers
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Computer algebra handbook
Ground reducibility is EXPTIME-complete
Information and Computation
Sound generalizations in mathematical induction
Theoretical Computer Science
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
"Term partition" for mathematical induction
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Inductive decidability using implicit induction
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Model representation via contexts and implicit generalizations
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Dealing with non-orientable equations in rewriting induction
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Applying a theorem prover to the verification of optimistic replication algorithms
Rewriting Computation and Proof
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |