In this paper we present an approach to integrating reasoning specialists into Cover Set Induction based on Constraint Contextual Rewriting. The approach has been successfully used to incorporate decision procedures into the SPIKE prover. Computer experiments on non-trivial verification problems illustrating the effectiveness of the proposed technique are given. The generality of the approach allows for the integration of Computer Algebra algorithms and techniques into induction theorem provers. To illustrate this, we discuss the integration of Buchberger algorithm into our framework. 1
We propose a new procedure for proof by induction in conditional theories where case analysis is sim...
We propose a new procedure for proof by induction in conditional theories where case analysis is sim...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...
In this paper we present an approach to integrating reasoning specialists into Cover Set Induction ...
AbstractIn this paper we present an approach to integrating reasoning specialists into cover set ind...
Article dans revue scientifique avec comité de lecture.Cover set induction is known as a proof metho...
AbstractCover set induction is known as a proof method that keeps the advantages of explicit inducti...
Rapport interne.Cover sets are at the core of implicit induction proof techniques which keep the adv...
International audienceWe detail the integration in SPIKE, an implicit induction theorem prover, of t...
The original publication is available at www.springerlink.com.International audienceWe give evidence...
The software certification process is in most of the cases a laborious and costly task that needs no...
We develop a generic representation of implicit induction proof procedures within the cover set indu...
Texte intégral accessible uniquement aux membres de l'Université de LorraineThe software certificati...
Z is a formal specification language that is extensively used in both academia and industry. Several...
Largely adopted by proof assistants, the conventional induction methods based on explicit induction ...
We propose a new procedure for proof by induction in conditional theories where case analysis is sim...
We propose a new procedure for proof by induction in conditional theories where case analysis is sim...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...
In this paper we present an approach to integrating reasoning specialists into Cover Set Induction ...
AbstractIn this paper we present an approach to integrating reasoning specialists into cover set ind...
Article dans revue scientifique avec comité de lecture.Cover set induction is known as a proof metho...
AbstractCover set induction is known as a proof method that keeps the advantages of explicit inducti...
Rapport interne.Cover sets are at the core of implicit induction proof techniques which keep the adv...
International audienceWe detail the integration in SPIKE, an implicit induction theorem prover, of t...
The original publication is available at www.springerlink.com.International audienceWe give evidence...
The software certification process is in most of the cases a laborious and costly task that needs no...
We develop a generic representation of implicit induction proof procedures within the cover set indu...
Texte intégral accessible uniquement aux membres de l'Université de LorraineThe software certificati...
Z is a formal specification language that is extensively used in both academia and industry. Several...
Largely adopted by proof assistants, the conventional induction methods based on explicit induction ...
We propose a new procedure for proof by induction in conditional theories where case analysis is sim...
We propose a new procedure for proof by induction in conditional theories where case analysis is sim...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...