The Boyer-Moore Waterfall Model Revisited

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.

[1]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[2]  John Harrison,et al.  HOL Done Right , 1995 .

[3]  Frank van Harmelen,et al.  The Oyster-Clam System , 1990, CADE.

[4]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[5]  Lucas Dixon,et al.  A proof planning framework for Isabelle , 2006 .

[6]  Volker Sorge,et al.  Proof Development with OMEGA , 2002, CADE.

[7]  John Harrison,et al.  Optimizing Proof Search in Model Elimination , 1996, CADE.

[8]  Thomas J. Misa,et al.  College Of Science And Engineering , 2010 .

[9]  Hubert Comon-Lundh,et al.  Inductionless Induction , 2001, Handbook of Automated Reasoning.

[10]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[11]  Volker Sorge,et al.  Proof development with ΩMEGA , 2002 .

[12]  Alan Bundy,et al.  A Science of Reasoning , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[13]  Panagiotis Manolios,et al.  Computer-Aided Reasoning: An Approach , 2011 .

[14]  Alan Bundy,et al.  Rippling - meta-level guidance for mathematical reasoning , 2005, Cambridge tracts in theoretical computer science.

[15]  Birgit Hummel.  Generierung von Induktionsformeln und Generalisierung beim automatischen Beweisen mit vollständiger Induktion , 1990 .

[16]  Richard J. Boulton.  Boyer-Moore Automation for the HOL System , 1992, TPHOLs.

[17]  Markus Aderhold,et al.  Improvements in Formula Generalization , 2007, CADE.