SafeProver
Jean-Frédéric Étienne, Eric Juppeaux · ACM SIGAda Ada Letters · 2017
In this paper, we present SAFEPROVER, a formal verification tool based on bounded model checking (BMC) and which uses a set of algorithms derived from the K-Induction principle [1] for invariant satisfaction and lemma generation. The main novelty offered by SAFEPROVER is a set of symmetry detection and latch synthesis rules that are applied on an intermediate representation where the characteristics the models to be analysed are still available. These rules allow to reduce the number of satisfiability checks required to establish the inductiveness of safety properties. On some benchmarks, they have proved to be even more efficient than IC3/PDR and interpolation techniques.