Cyclic proof systems, in which induction is managed implicitly, are a promising approach to
automatic verification. The soundness of cyclic proof graphs is ensured by checking them …

We propose a new cyclic proof system for automated, equational reasoning about the
behaviour of pure functional programs. The key to the system is the way in which cyclic …

Cyclic induction is a powerful reasoning technique that consists in blocking the proof
development of certain subgoals already encountered during the proof process. In the …

Résumé La récurrence nœthérienne est un des principes les plus généraux de
raisonnement formel. Dans le cadre du raisonnement de premier ordre, nous présentons …

Cyclic induction is a more recent proof technique that can be applied for proof derivations
involving repetitive steps. Since repetition may be an infinite process, cyclic pre-proofs help …