Save/Restore Handshake Sequencing: Theory Deep Dive

Foundational theory

Save/Restore Handshake Sequencing is core to Retention & Restore. Treat each power behavior change as a correctness and signoff risk decision.

Core concepts explained

• Save/restore sequencing must be verified as a protocol, not only as a waveform snapshot. The environment should assert legal ordering between save request, save acknowledge, isolation enable, clock gating, power switch transitions, and restore deassertion. Verification should model realistic controller jitter, firmware delays, and concurrent requests from neighboring domains so sequencing robustness is validated under system pressure. Critical checks include ensuring restore is blocked until clocks and supplies are stable, retained state is visible before dependent logic resumes, and no stale handshake from a prior cycle leaks into the next power event. Negative tests should intentionally inject early wake, missing save ack, and double-trigger conditions to prove recovery paths and watchdog behavior instead of assuming clean operation.

• Primary metric: Handshake protocol compliance rate, save-to-off and restore-to-functional timing margin, and timeout escape count.

• Primary artifact: Temporal handshake checker suite with protocol assertions, timeout diagnostics, and scenario-wise latency histograms.

• Owners: power controller owner, firmware/power management owner, low-power verification owner, SoC integration owner

• Power intent and RTL behavior must stay aligned through transitions

• Proof quality beats broad waive strategies in low-power closure

Why this matters in low-power signoff

Retention closure requires proving save, off, and restore phases as one lifecycle with explicit handshake timing. Teams that enforce this reduce false alarms and real escapes.

Mental model

RETENTION SAVE / RESTORE FLOW

PMU            RET CTRL             RET FLOPS              DOMAIN
 | save_req ---> |                     |                     |
 |               |--- capture ----->   | latch state         |
 | <--- save_ack |                     |                     |
 | power_off --->|---------------------X--------------------> OFF
 | power_on  --->|------------------------------------------> RAMP
 |               |--- restore ----->   | load state          |
 | <--- rst_done |                     |                     |

Verification focus:
- no data loss across save/restore window
- restore completes before functional traffic resumes

Worked intuition

1. Classify symptom first: illegal transition, corruption, isolation break, retention drift, or X-prop ambiguity.

2. Pinpoint first phase boundary where expected low-power behavior diverges.

3. Quantify movement in Handshake protocol compliance rate, save-to-off and restore-to-functional timing margin, and timeout escape count. before broad refactors.

4. Collect Temporal handshake checker suite with protocol assertions, timeout diagnostics, and scenario-wise latency histograms. with fixed run metadata and mode sequencing.

5. Apply one bounded fix and replay both targeted and broader scenarios.

6. Publish owner-signed closure note with rollback trigger.

Common misconceptions

• Passing nominal ON/OFF smoke proves transition correctness.

• UPF compile clean means all intent semantics are correct.

• All X-prop failures indicate real product escapes.

• Retention behavior can be trusted without multi-cycle restore stress.

Low-power verification deep dive

Retention closure requires proving end-to-end state lifecycle through save, off, and restore windows.

Concept diagram

RETENTION LIFECYCLE

save request -> state capture -> power off -> power on -> restore -> traffic resume

Metric graph

RETENTION STABILITY

restore mismatch       █████
save timing defects    ████
stable wake cycles     ███████

Metrics and artifacts to collect

• retention save/restore timing report

• pre/post state diff matrix

• multi-cycle retention stress summary

• state-loss bug trend by mode

Mini case study

A corruption issue persisted until retention checks compared multi-cycle state snapshots rather than single wake events.

Debug branches

• Track save acknowledgement against actual state capture.

• Validate restore completion before functional traffic resumes.

• Run repeated sleep/wake cycles to expose drift.

Senior review question

Ask: what exact low-power transition boundary failed first, and which artifact proves the closure claim reproducibly?

Key takeaways

• Tie each LPV claim to a concrete transition boundary and one proving artifact.

• Prefer minimal reversible fixes with explicit owner and rollback criteria.

Common pitfalls

• Treating power-aware failures as random before boundary classification.

• Waiving X-prop failures before proving impact and root cause.

• Declaring closure without deterministic replay across key modes.

Theory reinforcement

Theory matters when it predicts concrete failure signatures and closure boundaries.

Translate LPV semantics into reproducible verification outcomes.