Deadlock and Livelock Checks for Arbitration and Handshake Logic: Comparison Matrix

Comparison matrix

Application flows differ in setup and failure shape, but all require explicit environment modeling and reachability evidence.

+------------------+----------------+----------------+----------------+
| Approach         | Strength       | Weakness       | Best when      |
+------------------+----------------+----------------+----------------+
| Strict model     | high trust     | longer runtime | signoff-critical logic |
| Balanced model   | faster closure | needs reviews  | daily regressions |
| Heavy abstraction | runtime gain   | confidence risk | exploratory triage |
| Property refactor | debug clarity  | rewrite effort | stalled proof sets |
+------------------+----------------+----------------+----------------+

When to choose each approach

• Choose strategy by requirement criticality and residual-risk tolerance, not by runtime alone.

Interview traps

• Applying one setup strategy to all property classes without intent review.

• Accepting waivers before replaying first divergence with owners.

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.

Principal formal review addendum

Deadlock and Livelock Checks for Arbitration and Handshake Logic should be reviewed as a requirement-evidence workflow, not a single status report.

Use non-vacuous closure rate, counterexample turnaround time, and requirement-level residual risk trend as the monitoring lens and formal closure packet: assumptions audit, proof status matrix, counterexample classification, and requirement traceability as closure proof.

Formal apps deliver high leverage when properties mirror system contracts: connectivity, access control, progress, and reset determinism. Strong teams preserve legal reachability while improving convergence.