The efficient SMT-based context-bounded model checker (ESBMC)
-
Updated
Oct 4, 2026 - C++
The efficient SMT-based context-bounded model checker (ESBMC)
SRI Sally: A model checker for infinite-state systems.
Formal proof of an arbiter, a FIFO and an AXI4-Lite slave with SymbiYosys: 25 assertions proved unbounded, 13/13 covers reached, and a broken arbiter that passes every safety property.
Formal verification reference flow: an FSM safety property proven unbounded by k-induction with SymbiYosys, Yosys, and z3. The same toolchain we use to prove coverage holes unreachable on real cores.
Portable, independently re-derivable logic-equivalence receipts — DRAT checking with zero dependencies
To associate your repository with the k-induction topic, visit your repo's landing page and select "manage topics."