Proof by induction using test sets

Authors:
D Kapur;P Narendran;H Zhang
Affiliations:
-;-;-
Venue:
Proc. of the 8th international conference on Automated deduction
Year:
1986

Citing 0
Cited 8

Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Journal of Symbolic Computation
A strong restriction of the inductive completion procedure

Journal of Symbolic Computation
Automating inductionless induction using test sets

Journal of Symbolic Computation
Induction Proofs with Partial Functions

Journal of Automated Reasoning
Reasoning Inductively about Z Specifications via Unification

ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Computing constructor forms with non terminating rewrite programs

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)
Narrowing, abstraction and constraints for proving properties of reduction relations

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

Abstract