Formal Verification of Safety Properties Using Interpolation and k-induction
Tephilla Prince, Atif Abdur Rahman, Sheerazuddin Syed

TL;DR
This paper implements and compares two symbolic model checking algorithms, interpolation-based and k-induction, using SAT/SMT solvers to verify safety properties in systems.
Contribution
It introduces implementations of two symbolic model checking algorithms and provides a comparative analysis of their effectiveness.
Findings
Both algorithms successfully verify safety properties.
Interpolation-based model checking shows different strengths compared to k-induction.
The comparative analysis highlights scenarios where each method performs best.
Abstract
This technical report presents implementation of two symbolic model checking algorithms that use SAT/SMT Solvers, namely interpolation based model checking and k-induction based model checking. We also do a comparative analysis of these two model checking algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Safety Systems Engineering in Autonomy · Software Reliability and Analysis Research
