formalmethods.dev

§ 1.10

Beyond checking: proving

SAT, SMT, and proof assistants — when exhaustive still isn't enough.

see also · Bounded model checking · Model checking

The wider toolbox

Model checking finite structures is the friendly corner of formal methods. Unbounded state extends the toolbox: SAT/SMT for bounded checking over infinite data, theorem provers (Coq, Lean, Isabelle) that prove all instances at once, abstraction that over-approximates infinite systems.

For testing teams the bridge stays the same: keep the model, let a solver search it.

The honest spectrum

Confidence vs cost: example tests (cheap, weak) → random falsification → bounded checking → full model checking (exhaustive, needs abstraction) → proof assistants (total, expensive). The craft is picking the strongest tool you can still afford — and labelling the answer with what it proves.

try it · the doing-guide — §04 →