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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
