A General Framework to Build Contextual Cover Set Induction Provers

Abstract

Cover set induction is known as a proof method that keeps the advantages of explicit induction and proof by consistency. Most implicit induction proof procedures are defined in a cover set induction framework. Contextual cover set (CCS) is a new concept that fully characterizes explicit induction schemes, such as the cover sets, and many simplification techniques as those specific to the "proof by consistency" approach. Firstly, we present an abstract inference system uniformly defined in terms of contextual cover sets as our general framework to build implicit induction provers. Then, we show that it generalizes existing cover set induction procedures.This paper also contributes to the general problem of assembling reasoning systems in a sound manner. Elementary CCSs are generated by reasoning modules that implement various simplification techniques defined for a large class of deduction mechanisms such as rewriting, conditional rewriting and resolution-based methods for clauses. We present a generic and sound integration schema of reasoning modules inside our procedure together with a simple methodology for improvements and incremental sound extensions of the concrete proof procedures. As a case study, the inference system of the SPIKE theorem prover has been shown to be an instance of the abstract inference system integrating reasoning modules based on rewriting techniques defined for conditional theories. Our framework allows for modular and incremental sound extensions of SPIKE when new reasoning techniques are proposed. An extension of the prover, incorporating inductive semantic subsumption techniques, has proved the correctness of the MJRTY algorithm by performing a combination of arithmetic and inductive reasoning.

Automated Certification of Implicit Induction Proofs

“…each function is defined in any point of the domain. In [19], we have proposed a methodology for a modular checking of the soundness of implicit induction inference systems. The heart of the methodology is a very general inference system consisting only of two rules, AddPremise and Simplify, which has been shown sound, like any system built from instantiations of its rules.…”

“…We are interested in certifying properties about conditional specifications using automated proof techniques like those employed by Spike [5,19,3], a rewrite-based implicit induction proof system. The implementation of Spike's inference system is spread over thousands of lines of OCaml [12] code.…”

An Undo Framework for P2P Collaborative Editing

“…Consequently, we choose to use the proof environment VOTE [21] based on the theorem prover Spike [22,23] which generates all the cases and ensures the verification of all properties.…”

Towards Synchronizing Linear Collaborative Objects with Operational Transformation

“…SPIKE was employed for the following reasons: (i) its high automation degree; (ii) its ability to perform case analysis (to deal with multiple methods and many transformation cases); (iii) its ability to find counter-examples; (iv) its incorporation of decision procedures (to automatically eliminate arithmetic tautologies produced during the proof attempt) [13].…”