Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

V11 · Proof-validity

planarian @ a924e09 · Spec v4.6 · snapshot main · all versions

Kani and its back end CBMC are sound within the stated bounds.

Sites: txn::kani, exec::kani

If it is false

Every proof stops describing the real machine: it is proof-validity trust.

No invariant names it in docs/verification-ratio.toml.