Edinburgh Research Explorer

An Experimental Comparison of Rippling and Exhaustive Rewriting

Research output: Working paper

Related Edinburgh Organisations


Original languageEnglish
Number of pages17
Publication statusUnpublished - Dec 1996

Publication series

NameDAI Working Paper No. 836


We compare rippling and exhaustive rewriting using recursive path ordering, on a range of inductive proofs. We present statistics on success rates, branching rates and CPU times. We use these statistics to argue that rippling succeeds more often. However, these statistics also show that rippling and reduction are roughly the same in terms of average branching rate and that rippling often takes longer in terms of CPU time.

Download statistics

No data available

ID: 19654334