BMC vs Unbounded Proof Strategies: Interview Drills

Interview drills

Interview Drills for BMC vs Unbounded Proof Strategies is anchored on Bound depth achieved, k-induction success rate, and ratio of bug-find to full-proof properties.. Convert outcomes into assumption-aware, evidence-backed actions.

PROMPT
You observe regression in Bound depth achieved, k-induction success rate, and ratio of bug-find to full-proof properties. for BMC vs Unbounded Proof Strategies. Explain root cause and signoff decision.

STRONG ANSWER
1. Defines requirement context and first divergence.
2. Explains mechanism: Bounded model checking (BMC) searches for counterexamples up to depth k and is excellent for quickly finding shallow bugs, initialization escapes, and protocol startup issues. Unbounded proof attempts establish correctness for all time, typically through induction, interpolation, IC3/PDR-style fixed-point reasoning, or hybrid engine orchestration. K-induction bridges these worlds by proving a base case and inductive step, but it often needs strengthening invariants and helper assertions before convergence. Teams should classify properties early into bug-hunting, bounded-signoff, or unbounded-signoff intent so runtime budgets and expectations stay realistic.
3. Requests proving artifact: Proof intent matrix mapping each property to BMC depth goals, unbounded targets, and escalation criteria.
4. Proposes bounded fix + owner + rollback-safe validation.

WEAK ANSWER
Gives generic formal advice without model boundaries, proof quality, or ownership.

Formal deep dive

Convergence requires engine strategy, invariant quality, and model realism to move together with measurable progress.

Concept diagram

CONVERGENCE DECISION FLOW

property bucket -> engine strategy -> helper invariants -> convergence audit -> closure

Metric graph

CONVERGENCE BURNDOWN

open hard properties    ███████
inconclusive aging      █████
closed with audit       ████████

Metrics and artifacts to collect

• engine effectiveness by property class

• induction and helper-lemma success ratio

• stalled-property aging dashboard

• runtime vs closure-quality movement

Mini case study

A stalled set closed only after case-splitting by mode and auditing fairness assumptions for realism.

Debug branches

• Bucket properties by structure and intent before tuning.

• Inspect proof core stability, not runtime alone.

• Reject speed gains that reduce legal reachability.

Senior review question

Ask: which requirement intent is proven, under which assumptions, and what residual risk remains?

Key takeaways

• Tie each proof claim to assumption boundaries and reachability evidence.

• Prefer minimal reversible fixes and preserve legal behavior visibility.

Common pitfalls

• Treating runtime reduction as proof-quality improvement without audits.

• Declaring closure while critical covers remain unreachable.

• Using broad waivers instead of first-divergence root-cause ownership.

Principal formal review addendum

BMC vs Unbounded Proof Strategies should be reviewed as a requirement-evidence workflow, not a single status report.

Use Bound depth achieved, k-induction success rate, and ratio of bug-find to full-proof properties. as the monitoring lens and Proof intent matrix mapping each property to BMC depth goals, unbounded targets, and escalation criteria. as closure proof.

Convergence is an engineering loop: classify hard properties, tune engines, strengthen invariants, and audit constraints continuously. Strong teams preserve legal reachability while improving convergence.