Abstract
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.
- A. Biere. Bounded model checking. In Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, pages 457--481. IOS Press, 2009.Google Scholar
- R. K. Brayton and A. Mishchenko. ABC: An Academic Industrial-Strength Verification Tool. In CAV, pages 24--40, 2010.Google Scholar
- R. Cavada, A. Cimatti, M. Dorigatti, A. Griggio, A. Mariotti, A. Micheli, S. Mover, M. Roveri, S. Tonetta, and F. B. Kessler. The nuxmv symbolic model checker. In In CAV, pages 334--342, 2014. Google Scholar
Digital Library
- EN 50128, Railway applications. CENELEC, June 2011.Google Scholar
- N. Eén and N. Sörensson. Temporal induction by incremental SAT solving. Electr. Notes Theor. Comput. Sci., 89(4):543--560, 2003. Google Scholar
Cross Ref
- J.-H. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie. A Formally-Verified C Static Analyzer. In POPL, pages 247--259. ACM, 2015. Google Scholar
Digital Library
Index Terms
(auto-classified)SafeProver: A High-Performance Verification Tool
Recommendations
Beyond safety: customized SAT-based model checking
DAC '05: Proceedings of the 42nd annual Design Automation ConferenceModel checking of safety properties has taken a significant lead over non-safety properties in recent years. To bridge the gap, we propose dedicated SAT-based model checking algorithms for properties beyond safety. Previous bounded model checking (BMC) ...
Bounded model checking of high-integrity software
HILT '13: Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technologyModel checking [5] is an automated algorithmic technique for exhaustive verification of systems, described as finite state machines, against temporal logic [9] specifications. It has been used successfully to verify hardware at an industrial scale [6]. ...
Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure
We present an abstraction refinement algorithm for model checking of safety properties that relies exclusively on a SAT solver for checking the abstract model, testing abstract counterexamples on the concrete model, and refinement. Model checking of the ...






Comments