Laura Kovács

Examining difficulties in finding strong invariants for polynomial loops and their implications.

Exploring the integration of connection methods with SAT solvers for theorem proving.

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.