Now showing items 1-2 of 2
Coloured rippling: An extension of a theorem proving heuristic
(John Wiley & Sons, 1994)
Rippling is a type of rewriting developed in inductive theorem proving for removing differences between terms; the induction conclusion is annotated to mark its differences from the induction hypothesis and rippling ...
Experiments in Automating Hardware Verification using Inductive Proof Planning
We present a new approach to automating the verification of hardware designs based on planning techniques. A database of methods is developed that combines tactics, which construct proofs, using specifications of their ...