The Boyer-Moore Waterfall Model Revisited

08/11/2018
by   Petros Papapanagiotou, et al.
0

In this paper, we investigate the potential of the Boyer-Moore waterfall model for the automation of inductive proofs within a modern proof assistant. We analyze the basic concepts and methodology underlying this 30-year-old model and implement a new, fully integrated tool in the theorem prover HOL Light that can be invoked as a tactic. We also describe several extensions and enhancements to the model. These include the integration of existing HOL Light proof procedures and the addition of state-of-the-art generalization techniques into the waterfall. Various features, such as proof feedback and heuristics dealing with non-termination, that are needed to make this automated tool useful within our interactive setting are also discussed. Finally, we present a thorough evaluation of the approach using a set of 150 theorems, and discuss the effectiveness of our additions and relevance of the model in light of our results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2018

DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)

We present a tool that automates termination proofs for recursive defini...
research
09/11/2015

Sharing HOL4 and HOL Light proof knowledge

New proof assistant developments often involve concepts similar to alrea...
research
07/06/2021

Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant

Recently, we developed an automated theorem prover for projective incide...
research
01/19/2021

Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra

log ('setlog') is a satisfiability solver for formulas of the theory of ...
research
04/02/2018

Learning to Reason with HOL4 tactics

Techniques combining machine learning with translation to automated reas...
research
02/11/2021

A formal proof of modal completeness for provability logic

This work presents a formalized proof of modal completeness for Gödel-Lö...
research
09/11/2015

Premise Selection and External Provers for HOL4

Learning-assisted automated reasoning has recently gained popularity amo...

Please sign up or login with your details

Forgot password? Click here to reset