This paper presents a particular approach to the design and verification of large sequential
systems. It is based on structured algebraic specifications and stepwise refinement by …

This paper is a chapter of the Handbook of Automated Reasoning edited by Voronkov and
Robinson. It describes techniques for automated reasoning in theories containing rules of …

Superposition-based provers have been successfully used to discharge proof obligations
stemming from proof assistants. However, many such obligations require induction to be …

Proofs by induction arc important in many computer science and artificial intelligence
applications, in particular, in program verification and specification systems. We present a …

A crucial point in proving theorems by induction is to manipulate the induction conclusion to
enable the use of the induction hypothesis. We propose a technique to control such a …

Rippling is a type of rewriting developed for inductive theorem proving that uses annotations
to direct search. Rippling has many desirable properties: for example, it is highly goal …

To prove the termination of a functional program there has to be a well-founded ordering
such that the arguments in each recursive call are smaller than the corresponding inputs. In …

The INKA system is a first-order theorem prover with induction based on the explicit
induction paradigm. Since 1986 when a first version of the INKA system was developed …

We survey research in the automation of deductive inference, from its beginnings in the early
history of computing to the present day. We identify and describe the major areas of …

In the following, we describe the basic ideas underlying~-MKRP, an interactive proof
development environment [6]. The requirements for this system were derived from our …