skip to main content
column

SafeProver: A High-Performance Verification Tool

Published:10 May 2017Publication History
Skip Abstract Section

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.

References

  1. 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 ScholarGoogle Scholar
  2. R. K. Brayton and A. Mishchenko. ABC: An Academic Industrial-Strength Verification Tool. In CAV, pages 24--40, 2010.Google ScholarGoogle Scholar
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. EN 50128, Railway applications. CENELEC, June 2011.Google ScholarGoogle Scholar
  5. N. Eén and N. Sörensson. Temporal induction by incremental SAT solving. Electr. Notes Theor. Comput. Sci., 89(4):543--560, 2003. Google ScholarGoogle ScholarCross RefCross Ref
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

(auto-classified)
  1. SafeProver: A High-Performance Verification Tool

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!