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 …

In first-order logic, the formula-based instances of the Noetherian induction principle allow to
perform effectively simultaneous, mutual and lazy induction reasoning. Compared to the …

SPIKE, an induction-based theorem prover built to reason on conditional theories with
equality, is one of the few formal tools able to perform automatically mutual and lazy …

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 …

Abstract The Available Bit Rate protocol (ABR) for ATM networks is well adapted to data
traffic by providing minimum rate guarantees and low cell loss to the ABR source end …

We detail the integration in SPIKE, an implicit induction theorem prover, of two reasoning
modules operating over naturals combined with interpreted symbols. The first integration …

Résumé La preuve de théorèmes avec des techniques automatisées, comme celles basées
sur la saturation et la récurrence implicite, est devenue aujourd'hui une pratique courrante …

Noetherian induction is one of the most general induction principles used in formal
reasoning. In the frame of the first-order reasoning, we propose a classification of its …

This paper describes a contribution to the area of mechanically theorem proving focusing
especially on the automation of the invariance proof. In this respect, we present an initial …

Résumé Les preuves par récurrence sont parfaitement adaptées au raisonnement sur des
structures de données non-bornées, comme par exemple les entiers et les listes, ou, de …