Low Power Verification · All levels
Power-Aware Simulation: Tricky Q&A
Senior interview and review questions for Power-Aware Simulation.
Section Q&A bank
Use these drills after completing all topics in Power-Aware Simulation. Answer with context, mechanism proof, artifact, owner, and release decision.
A simulation run loads UPF successfully but shows almost no X-corruption during domain shutoff. Why can this still be a serious setup failure?
[INT][LPV][POWER-AWARE-SIMULATION]
Q: A simulation run loads UPF successfully but shows almost no X-corruption during domain shutoff. Why can this still be a serious setup failure?
A:
UPF parse success does not guarantee active low-power semantics. If power-aware switches, corruption models, or power-state control bindings are not enabled correctly, the simulator may execute near-functional behavior while silently skipping domain corruption and isolation timing rules. The right check is to force known illegal access patterns during power-down and confirm explicit corruption/isolation events in assertions and waveforms.
FOLLOW-UP TRAP: Assuming 'UPF loaded without errors' means power-aware behavior is truly active.When modeling supply networks, why is a single idealized on/off control often insufficient for verification closure?
[INT][LPV][POWER-AWARE-SIMULATION]
Q: When modeling supply networks, why is a single idealized on/off control often insufficient for verification closure?
A:
Real domains depend on rail hierarchy, shared resources, and transition latency, so idealized toggles hide sequencing races and dependency bugs. Verification needs modeled settle time, parent-child supply coupling, and asynchronous transition ordering to expose deadlocks, early transactions, and illegal state-table traversal that do not appear in a perfectly synchronous model.
FOLLOW-UP TRAP: Treating supply control as instantaneous and independent across all domains.How do you distinguish a true retention bug from expected corruption after power cycling?
[INT][LPV][POWER-AWARE-SIMULATION]
Q: How do you distinguish a true retention bug from expected corruption after power cycling?
A:
A true retention bug appears when elements declared retained fail save/restore protocol or emerge with incorrect values despite retention supply and control timing meeting spec. Expected corruption is limited to non-retained logic or retained logic accessed outside legal save/restore windows. The key is correlating power state, save/restore handshake timing, and per-register retention intent rather than judging only final observed value.
FOLLOW-UP TRAP: Flagging every post-wake value mismatch as retention failure without checking retention intent and timing preconditions.Isolation assertions pass in simple tests, yet silicon shows wake-up instability. What simulation gap is most commonly missed?
[INT][LPV][POWER-AWARE-SIMULATION]
Q: Isolation assertions pass in simple tests, yet silicon shows wake-up instability. What simulation gap is most commonly missed?
A:
Many environments only validate steady-state clamp correctness, but miss dynamic timing interactions during rapid or concurrent transitions. Wake-up instability often comes from early clamp release, control from non-always-on logic, or missing reset/clock qualification when multiple domains change state together. Stressing concurrent transitions and software-driven accesses is essential to reveal these latent issues.
FOLLOW-UP TRAP: Concluding isolation is fully verified because static clamp value checks pass in linear power sequences.Q&A drill guide
SYMPTOM -> LPV FAILURE CLASS -> EVIDENCE -> OWNER ACTION -> VALIDATIONSketch while answering
POWER-AWARE SIM FLOW
UPF + RTL + testbench -> elaboration -> transition simulation -> assertions and triageCommon traps
Start from first failing phase, not final mismatch.
Check semantic setup consistency before declaring design bug.
Use one reproducible scenario per hypothesis branch.
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.