Deadlock and Livelock Checks for Arbitration and Handshake Logic: Theory Deep Dive

Foundational theory

Deadlock and Livelock Checks for Arbitration and Handshake Logic is a core topic in Formal Applications (Apps). Treat each proof result as evidence under a modeled world, not a context-free truth statement.

Core concepts explained

• Deadlock/livelock formal apps verify forward progress under realistic fairness assumptions, especially in arbiters, NoC routers, and credit-based handshakes. Safety assertions catch illegal states (for example, granting two mutually exclusive resources), but progress requires liveness properties such as `assert property (@(posedge clk) disable iff (!rst_n) req_i |-> s_eventually grant_i);` with fairness assumptions on downstream readiness. In bounded engines, teams often add bounded progress guards like `req_i |-> ##[1:16] grant_i` and then justify the bound from microarchitecture latency budgets. For lock-based protocols, formal should prove absence of circular wait and prove escape transitions from retry/backoff loops. Debug discipline matters: if a liveness failure is spurious due to unconstrained environment starvation, convert missing environment guarantees into explicit assumptions rather than weakening the design guarantee.

• Primary metric: non-vacuous closure rate, counterexample turnaround time, and requirement-level residual risk trend

• Primary artifact: formal closure packet: assumptions audit, proof status matrix, counterexample classification, and requirement traceability

• Owners: formal verification owner, rtl owner, verification lead

• 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

Progress guarantees are release-critical in arbitration and handshake logic, where rare starvation escapes are expensive.

Mental model

FORMAL APPLICATIONS MAP

                 +--> FPV (assertion proof)
Formal methods --+--> LEC (RTL/netlist equivalence)
                 +--> CDC/RDC protocol intent checks
                 +--> Security / safety invariants
                 +--> Deadlock and X-propagation analysis

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 non-vacuous closure rate, counterexample turnaround time, and requirement-level residual risk trend with requirement-level ownership.

4. Collect formal closure packet: assumptions audit, proof status matrix, counterexample classification, and requirement traceability 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

Formal apps generate high confidence when app-specific assumptions mirror integration and firmware behavior.

Concept diagram

FORMAL APPS MAP

connectivity + csr + progress + reset/x checks -> integrated SoC confidence

Metric graph

APPS CLOSURE QUALITY

functional app closure   ███████
environment realism      █████
waiver pressure          ███

Metrics and artifacts to collect

• connectivity route reachability

• CSR semantic correctness matrix

• progress guarantee closure by interface

• reset/X convergence confidence

Mini case study

Deadlock traces were resolved by tightening fairness assumptions to architecture contracts, not by weakening liveness guarantees.

Debug branches

• Validate mode and configuration constraints for each app.

• Pair safety and liveness checks for progress-sensitive logic.

• Add first-transaction covers for reset-sensitive interfaces.

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.