Stratified Certification for k-Induction

08/02/2022
by   Emily Yu, et al.
0

Our recently proposed certification framework for bit-level k-induction-based model checking has been shown to be quite effective in increasing the trust of verification results even though it partially involved quantifier reasoning. In this paper we show how to simplify the approach by assuming reset functions to be stratified. This way it can be lifted to word-level and in principle to other theories where quantifier reasoning is difficult. Our new method requires six simple SAT checks and one polynomial-time check, allowing certification to remain in co-NP while the previous approach required five SAT checks and one QBF check. Experimental results show a substantial performance gain for our new approach. Finally, we present and evaluate our new tool Certifaiger-wl which is able to certify k-induction-based word-level model checking.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2022

Formal Verification of Safety Properties Using Interpolation and k-induction

This technical report presents implementation of two symbolic model chec...
research
02/28/2021

"ReLIC: Reduced Logic Inference for Composition" for Quantifier Elimination based Compositional Reasoning and Verification

The paper presents our research on quantifier elimination (QE) for compo...
research
06/24/2020

Formalizing the Soundness of the Encoding Methods of SAT-based Model Checking

One of the effective model checking methods is to utilize the efficient ...
research
06/04/2019

Interpolating Strong Induction

The principle of strong induction, also known as k-induction is one of t...
research
04/04/2019

Beyond k-induction: Learning from Counterexamples to Bidirectionally Explore the State Space

We describe and evaluate a novel k-induction proof rule called bidirecti...
research
02/12/2018

Unbounded Software Model Checking with Incremental SAT-Solving

This paper describes a novel unbounded software model checking approach ...
research
06/30/2023

Speculative SAT Modulo SAT

State-of-the-art model-checking algorithms like IC3/PDR are based on uni...

Please sign up or login with your details

Forgot password? Click here to reset