Q122FreeSystemVerilog
Explain What Static Timing Analysis Proves
Interview prompt
Question
A synchronous ASIC has completed synthesis and has clocks, I/O delays, exceptions, and timing corners defined. Which statement about static timing analysis is correct?
Choose one
Answer choices
- A. STA checks only the single longest combinational path and does not analyze minimum delay or hold timing.
- B. STA runs every possible functional input sequence and therefore replaces simulation for protocol and state-machine bugs.
- C. STA propagates delays through a timing graph without functional input vectors, checks constrained launch-to-capture paths for setup and hold across corners, and depends on complete clocks, uncertainties, I/O constraints, and valid exceptions.
- D. An unconstrained path automatically passes because the timing tool has proven that no clock can capture it.
