# ProVerif with Lemmas, Induction, Fast Subsumption, and Much More

Bruno Blanchet, Vincent Cheval and Véronique Cortier.

This paper presents a major overhaul of one the most widely used symbolic security protocol verifiers, ProVerif. We provide two main contributions. First, we extend ProVerif with lemmas, axioms, proofs by induction, natural numbers, and temporal queries. These features not only extend the scope of ProVerif, but can also be used to improve its precision (that is, avoid false attacks) and make it terminate more often. Second, we rework and optimize many of the algorithms used in ProVerif (generation of clauses, resolution, subsumption, ...), resulting in impressive speed-ups on large examples.

A long version and a short version of the paper are available.

Here are the benchmarks and ProVerif versions that were used in the paper (see Section 4 in Short paper for details).

- Benchmark
- ProVerif (A): Subsumption
- ProVerif (B): Clause generation
- ProVerif (C): Set-to-clause resolution
- ProVerif (D): Global redundancy
- ProVerif (E): Pre-treatment of processes

Bruno Blanchet Vincent Cheval