Formal Properties for Coherency Safety: Inputs & Outputs

Inputs and outputs contract

Inputs & Outputs for Formal Properties for Coherency Safety explains how to reason from coherency invariant to measurable engineering decision.

INPUTS
  - protocol feature subset and revision
  - traffic assumptions and agent mix
  - ordering/fence behavior expected by software
  - observability hooks and logging policy

OUTPUTS
  - legal transition trace
  - measured metric trend
  - owner-assigned action items
  - signoff or escalation memo

Ownership view

OWNERSHIP MATRIX — Formal Properties for Coherency Safety

+---------------------+-----------------------------+------------------------------+
| Team                | Primary accountability      | Typical evidence             |
+---------------------+-----------------------------+------------------------------+
| formal | protocol semantics           | architecture spec + rationale|
| verification | implementation correctness   | waveform + state trace       |
| architecture | closure and reproducibility  | checker/coverage + dashboards|
+---------------------+-----------------------------+------------------------------+

Cache coherency deep dive

Cache coherence is a correctness contract across caches, interconnect, and software ordering.

Concept diagram

requester -> coherence fabric -> owner or memory -> state update

Metric graph

traffic mix across request, snoop, response, data

Metrics and artifacts to collect

• coherence latency

• invalidation rate

• retry rate

• stale-read incidents

Mini case study

Anchor debug to first stale read and the exact line state transition.

Debug branches

• Track ownership

• Track ordering

• Track evidence

Senior review question

Ask: what is the first line state transition that deviates, and which ordering rule does it break?

Key takeaways

• Tie every coherency claim to one cache line, one transaction identity, and one measurable counter.

• Keep proof artifacts from simulation and silicon replay aligned by address, state, and ordering event.

Common pitfalls

• Chasing bandwidth regressions without checking false sharing and line bouncing first.

• Assuming coherence correctness implies memory consistency correctness.

• Declaring closure without litmus, stress, and post-silicon replay evidence.