Hume is a Turing-complete programming language, designed to guarantee space and time bounds whilst still working on a high-level. Formal properties of Hume programs, such as invariants and transformations, have previously been verified using the temporal logic of actions (TLA). TLA properties are verified in an inductive way, which often requires lemma discovery or generalisations. Rippling was...

We extend previous work on di erence identi cation and reduction as a technique for automated reasoning. We generalize uni cation so that terms are made equal not only by nding substitutions for variables but also by hiding term structure. This annotation of structural di erences serves to direct rippling, a kind of rewriting designed to remove structural di erences in a controlled way. On the ...

We present an approach to the automatic construction of decision procedures , via a detailed example in propositional logic. The approach adapts the methods of proof-planning, and particularly the technique of rippling BSvH + 93], to a new domain, that of meta-theoretic procedures. This approach starts by providing an alternative characterisation of validity; the proofs of the correctness of th...

We extend work on difference identification and reduction as a technique for automated reasoning. We generalize unification so that terms are made equal not only by finding substitutions for variables but also by hiding term structure. This annotation of structural differences serves to direct rippling, a kind of rewriting designed to remove differences in a controlled way. On the technical sid...