iSMC presents the first self-certifying symbolic model checker for arbitrary CTL properties with justice requirements using interactive certification based on interactive proof systems.
Next, we prove using induction on ApplyEBDD’s recursive call graph that it maintains eBDD invariants
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
iSMC: A BDD-based Symbolic Model Checker with Interactive Certification
iSMC presents the first self-certifying symbolic model checker for arbitrary CTL properties with justice requirements using interactive certification based on interactive proof systems.