BMC vs Unbounded Proof Strategies: Theory Deep Dive

Foundational theory

BMC vs Unbounded Proof Strategies is a core topic in Proof Engines & Convergence. Treat each proof result as evidence under a modeled world, not a context-free truth statement.

Core concepts explained

• 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.

• Primary metric: Bound depth achieved, k-induction success rate, and ratio of bug-find to full-proof properties.

• Primary artifact: Proof intent matrix mapping each property to BMC depth goals, unbounded targets, and escalation criteria.

• Owners: formal verification owner, microarchitecture owner, verification lead, quality/signoff owner

• Proof quality includes vacuity and reachability, not pass/fail status only.

• Assumption discipline is part of design correctness, not tool setup.

Why this matters in formal signoff

Convergence is an engineering loop: classify hard properties, tune engines, strengthen invariants, and audit constraints continuously. Teams that formalize this posture reduce false passes and late-stage surprises.

Mental model

PROOF CONVERGENCE TREE

property status
      |
   converged?
    /      \
  yes       no
  |         |
 proven   bounded?
            /   \
          yes    no
          |       |
      increase    tighten assumptions /
       depth       split property / analyze COI

Worked intuition

1. Define requirement slice and property intent class (safety, liveness, or reachability).

2. Audit assumptions and reset model before trusting any status outcome.

3. Track movement in Bound depth achieved, k-induction success rate, and ratio of bug-find to full-proof properties. with requirement-level ownership.

4. Collect Proof intent matrix mapping each property to BMC depth goals, unbounded targets, and escalation criteria. before signoff or waiver decisions.

5. Apply one bounded model or RTL change per debug hypothesis.

6. Publish closure with residual risk and rollback conditions.

Common misconceptions

• Green proof status always means silicon-safe behavior.

• Faster convergence always means better model quality.

• Unreachable cover goals are acceptable if safety assertions pass.

• Bounded depth is equivalent to full proof unless a failure appears.

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.

Theory reinforcement

Theory matters only when it predicts observed traces and closure movement.

Use precise terminology for safety, liveness, boundedness, and vacuity.