Work it through
Reset while ID2 is pending
A reset cancels A and B under this example contract. A new request can reuse ID2 after restart.
Track reset epoch and queue position internally so late observations cannot match unrelated new work.
Your next page is on its way.
Chapter 3 · Ordering & closure
Model per-ID ordering, out-of-order completion, end-to-end prediction, assertions, coverage, and zero-outstanding closure.

A worked mechanism
Assume one interface, one destination, one response channel and in-order completion within each ID.
ID2:[A,B] ID7:[C]
A and B share an ordered queue. C belongs to a separate queue.
ID7 → C; ID2:[A,B]
Across-ID reordering can be legal without advancing ID2.
expected head = A
Compare A, then remove only A. A response carrying B first violates this example contract.
Work it through
A reset cancels A and B under this example contract. A new request can reuse ID2 after restart.
Track reset epoch and queue position internally so late observations cannot match unrelated new work.
Read and write channels are not automatically one shared ordering queue. Use the protocol-defined ordering domain.
Inject cross-ID passing, same-ID reversal, an unexpected response, cancellation and ID reuse. End-of-test must account for every accepted item.
Question-first preparation
Each question maps directly to one of the sections below, so you can test the contract before reading the explanation.
One representative prompt from each major mechanism. Open any card in the live question bank.
Latency tolerance without lost order
AXI permits useful concurrency and response reordering while preserving required order within the applicable ID and destination relationship.
Ordering-domain explorer
Queue A at the tail of ordering domain ID 3.
Queue B independently in ordering domain ID 8.
C follows A in the same ID 3 queue.
B may complete before A because the IDs differ.
The head of the ID 3 queue must complete first.
Queue A at the tail of ordering domain ID 3.
The scoreboard should accept every architecturally legal completion order and reject only real ordering, association, duplication, loss or data errors.
Track accepted requests by channel, ID, destination, burst shape and reset epoch; observe responses with their RID or BID.
Use a queue per ordering domain, plus a transaction map when the interconnect extends, remaps or routes IDs.
A global FIFO rejects legal cross-ID reordering, or an associative lookup accidentally allows same-ID responses to reverse.
Constrain comparison to legal ordering domains, check unmatched and duplicate responses, drain all outstanding work and cover reorder depth across IDs.
An ID is part of the ordering domain, not automatically a globally unique transaction handle. The complete key depends on the manager, direction, destination and interconnect transformations.
| Structure | Use | Characteristic mistake |
|---|---|---|
| One global FIFO | Only a globally ordered interface | Rejects legal AXI cross-ID reordering. |
| Queue per ID/domain | Preserve order inside each domain | Needs a complete routing key. |
| Associative transaction map | Find independent outstanding work | Can hide illegal same-ID reversal if used alone. |
| Age or deadline map | Progress and timeout policy | Must distinguish legal latency from starvation. |
The pseudocode below uses one queue for each response ordering key. A production model also retains expected beat data, responses, destination and reset epoch.
on_request(req):
key = {direction, manager, destination, req.id, reset_epoch}
expected[key].push_back(predict(req))
on_response(rsp):
context = correlate_with_retained_request(rsp)
// Wire IDs alone do not carry a reset epoch. If old/new work
// is ambiguous, block reuse until the old path is quiescent.
key = {direction, manager, destination, rsp.id, context.epoch}
require expected.exists(key) and !expected[key].empty()
exp = expected[key].front()
compare_current_beat(exp, rsp)
if rsp.is_last_accepted_beat:
expected[key].pop_front()
end_of_test:
require every expected queue is emptyReset may discard work in one scope while another fabric segment remains alive. A checker needs an explicit flush, abort or epoch policy rather than silently clearing every map.
Explain it out loud
Yes. Different IDs allow independent ordering domains, so a later request on another ID can complete first.
This tests whether the candidate understands why AXI has IDs and how a latency-tolerant checker uses them.
Answering that any order is legal and forgetting same-ID constraints.
Not if that lookup ignores order. Same-ID transactions in the applicable ordering domain must be compared in the required order, normally through a queue.
This exposes scoreboards that are flexible enough to accept a real DUT bug.
Searching all expected items for any payload match and removing whichever happens to compare.
It can append manager identity or routing context so overlapping source IDs remain unique inside the merged fabric, then remove that extension on the response path.
This connects pin-level protocol knowledge to a multi-port interconnect implementation.
Assuming an ID is globally unique across all managers without inspecting the fabric's transformation.
From local rules to end-to-end confidence
No single checker proves a bus. Local safety properties find cycle-accurate violations, while monitors, predictors, scoreboards, coverage and progress tracking prove the complete transaction lifecycle.
Verification evidence chain
Create requests, responses, waits, backpressure, errors and resets.
Check stability, sequencing, terminal beats and forbidden states.
Publish only architecturally completed channel or bus events.
Model data, response, ordering, routing and transaction lifetime.
Demonstrate feature combinations, stress depth and progress behavior.
Create requests, responses, waits, backpressure, errors and resets.
A strong strategy layers independent evidence. A protocol checker can prove legal pins and still miss wrong data, a misrouted response, starvation or an expected transaction left in the scoreboard.
Inventory interfaces, optional features, ordering domains, outstanding limits, reset scopes, errors, performance targets and legal backpressure.
Partition safety into SVA, reconstruction into monitors, functional prediction into models, comparison into scoreboards and intent into coverage.
A team relies on one vendor checker, counts attempted traffic, compares in the wrong order or reaches end of test with silent outstanding work.
Trace requirements into checkers and coverage, run negative and disruption tests, audit unmatched work and trend latency, throughput and starvation evidence.
Protocol selection is a design tradeoff, and it shapes the verification problem. Preserve the implemented version and optional-feature list in configuration rather than teaching one interface as a universal superset.
| Interface | Best fit | Primary verification risk |
|---|---|---|
| Ready/valid | A local streaming or decoupled channel | Stall persistence, throughput and buffering. |
| APB | Low-bandwidth registers and peripherals | SETUP/ACCESS phase legality and wait stability. |
| AHB/AHB-Lite | Pipelined memory-mapped transfers | Address/data phase association and HREADY stalls. |
| AXI4-Lite | Simple memory-mapped control without bursts | Independent channel joins despite reduced features. |
| AXI4/AXI5 | High-throughput outstanding traffic | Bursts, channel independence, IDs, ordering and backpressure. |
Reusable VIP separates active behavior from passive truth. Drivers honor the protocol; passive monitors independently reconstruct what the DUT actually accepted.
A protocol testplan should make every legal timing relationship happen and every prohibited relationship fail in a controlled negative test.
A strong protocol answer starts with the sampled rule, names state ownership, identifies the failure mode and finishes with independent evidence.
| Step | Question to answer | Protocol example |
|---|---|---|
| Contract | What exact edge commits state? | VALID && READY, APB completion or HREADY-qualified phase. |
| State | What must the checker remember? | Pending offer, APB request, AHB phase or AXI burst/ID queue. |
| Failure | What characteristic bug appears? | Early advance, unstable wait, wrong association or illegal reorder. |
| Proof | Which independent evidence catches it? | SVA plus monitor, scoreboard, coverage and outstanding audit. |
Explain it out loud
No. It is valuable for signal-level legality, but the environment still needs independent transaction reconstruction, functional prediction, data and ordering comparison, coverage and progress checks.
This tests whether the candidate can design a complete verification strategy instead of naming a tool.
Equating protocol compliance with functional correctness.
Sample architectural transaction coverage on acceptance or completion. Offered traffic can be useful stimulus coverage, but it must be labeled separately.
This reveals whether the coverage model is tied to the real protocol event.
Sampling whenever VALID or PSEL is high and calling every sampled cycle a transaction.
Start at accepted events: verify the monitor's sampled handshake and retained state, then check association and ordering before investigating payload prediction.
This tests practical debug prioritization across waveform and transaction layers.
Immediately changing the reference model before proving that the monitor reconstructed the bus correctly.