RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now maturedâ€¦ (More)

The unification problem for terms containing associative and commutative functions is of importance in theorem provers based on term rewriting and resolution methods as well as in logic programming.â€¦ (More)

This paper presents a method for automatically generating all polynomial invariants in simple loops. It is first shown that the set of polynomials serving as loop invariants has the algebraicâ€¦ (More)

Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to control-dominatedâ€¦ (More)

Automating proofs of properties of functions defined on inductively constructed data structures is important in many computer science and artificial intelligence applications, in particular inâ€¦ (More)

Advances of the past decade in methods and computer programs for showing consistency of proof systems based on first-order equations have made it feasible, in some settings, to use proof byâ€¦ (More)