Laura Kovács

Combining rewriting and inductive reasoning boosts efficiency in automated theorem proving.

A new method for creating recursion-free programs from functional specifications.

This article reviews recent efforts to automate inductive reasoning in theorem proving.