Sunday 02 March 2025
The quest for efficient and accurate model checking has been a long-standing challenge in the field of computer science. Model checking is a crucial step in verifying the correctness of complex systems, such as hardware and software designs, by analyzing their behavior against a set of specifications or properties.
Recently, researchers have made significant progress in developing novel approaches to improve the efficiency and scalability of model checking. One such approach is the integration of interpolant computation with SAT (Boolean Satisfiability) solvers, which has been shown to significantly reduce the computational resources required for model checking.
In a recent paper, a team of researchers presented an implementation of DRUP- (DRAT-based Unrolling Proof)-based interpolants in CaDiCaL 2.0, a state-of-the-art SAT solver. The authors leveraged the new Tracer API introduced in CaDiCaL 2.0 to trace proof AT proofs and compute interpolants.
The key innovation behind this approach is the use of DRUP-based interpolants, which are computed by unrolling the model and solving BMC (Bounded Model Checking) instances at each bound. This approach allows for the generation of strong and concise interpolants that can be used to prune the search space during model checking.
To evaluate the effectiveness of their implementation, the researchers conducted a series of experiments using benchmarks from the Hardware Model Checking Competition (HWMCC). The results showed that integrating CaDiCaL with DRUP-based interpolants significantly improved the performance of the model checker, both in terms of runtime and number of solved instances.
The authors also explored the impact of minimizing the proof size on the performance of the model checker. By replaying the minimized proofs during interpolant computation, they were able to further reduce the computational resources required for model checking.
This work demonstrates the potential of integrating SAT solvers with interpolant computation for efficient and accurate model checking. The authors’ implementation in CaDiCaL 2.0 provides a promising direction for future research in this area, enabling the development of more scalable and effective model checkers.
The integration of SAT solvers with interpolant computation has far-reaching implications for various applications, including formal verification, software testing, and hardware design. By leveraging the strengths of both approaches, researchers can develop more efficient and accurate methods for verifying complex systems, ultimately leading to better-quality software and hardware designs.
In addition to its theoretical significance, this work also highlights the importance of practical considerations in model checking.
Cite this article: “Efficient Model Checking through Interpolant Computation and SAT Solvers”, The Science Archive, 2025.
Model Checking, Sat Solvers, Interpolant Computation, Bmc, Hwmcc, Formal Verification, Software Testing, Hardware Design, Drat-Based Unrolling Proof, Efficient Model Checking
Reference: Basel Khouri, Yakir Vizel, “Revisiting DRUP-based Interpolants with CaDiCaL 2.0” (2025).
