Automating Inductive Specification Proofs

Authors:
Brigitte Pientka;Christoph Kreitz
Affiliations:
(Correspd.) Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA;(Correspd.) Department of Computer Science, Cornell University, Ithaca, NY, USA
Venue:
Fundamenta Informaticae
Year:
1999

Citing 12
Cited 0

Proofs as programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Automated deduction in nonclassical logics

Automated deduction in nonclassical logics
Extensions to the rippling-out tactic for guiding inductive proofs

CADE-10 Proceedings of the tenth international conference on Automated deduction
Rippling: a heuristic for guiding inductive proofs

Artificial Intelligence
On Matrices with Connections

Journal of the ACM (JACM)
A Connection Based Proof Method for Intuitionistic Logic

TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Uniform Proof Procedure for Classical and Non-Classical Logics

KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Synthesis of Induction Orderings for Existence Proofs

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Resolution Theorem Prover for Intuitonistic Logic

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Converting Non-Classical Matrix Proofs into Sequent-Style Systems

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Automatic synthesis of recursive programs: the proof-planning paradigm

ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an automatic method which combines logical proof search and rippling heuristics to prove specifications. The key idea is to instantiate meta-variables in the proof with a simultaneous match based on rippling/reverse rippling heuristic. Underlying our rippling strategy is the rippling distance strategy which introduces a new powerful approach to rippling, as it avoids termination problems of other rippling strategies. Moreover, we are able to synthesize conditional substitutions for meta-variables in the proof. The strength of our approach is illustrated by discussing the specification of the integer square root and automatically synthesizing the corresponding algorithm. The described procedure has been integrated as a tactic into the NUPRL system but it can be combined with other proof methods as well.