iSMC: A BDD-based Symbolic Model Checker with Interactive Certification

2026-05-05

AI Summary

This work addresses the lack of efficient and trustworthy verification mechanisms for CTL model checking with fairness constraints by presenting the first self-certifying symbolic model checker that supports interactive certification. The approach leverages Binary Decision Diagrams (BDDs) to perform symbolic verification of CTL properties and introduces, for the first time, an interactive proof system that formally certifies verification results with user-configurable high confidence after solving. By integrating CTL semantics with fairness constraints, QBF solving techniques, and interactive certification, this method preserves full CTL model checking capabilities while delivering a reliable and verifiable automated verification guarantee.

Abstract

We present iSMC, the first self-certifying model checker with interactive certification, a certification paradigm based on the theory of interactive proof systems. iSMC is a symbolic BDD-based model checker for arbitrary properties of Computation Tree Logic (CTL) with justice requirements. After solving an instance of the model-checking problem, iSMC conducts a certification procedure that guarantees with high probability (chosen by the user) that the answer is correct. iSMC is based on the technology of the QBF-solver with interactive certification presented by Couillard et al. at CAV 2023. We extend, improve on, and re-implement this technology, adapting it to the needs of CTL model checking.

Problem

• symbolic model checking
• interactive certification
• Computation Tree Logic
• BDD
• correctness guarantee

Innovation

• interactive certification
• self-certifying model checking
• BDD-based symbolic model checking
• Computation Tree Logic (CTL)
• justice requirements