Skip to question
SystemVerilogDesignVerificationFirmwareArchitectureASIC Interview Questions→
/Interview questions/Explain What Static Timing Analysis Proves

Q122·Free·SystemVerilog

Explain What Static Timing Analysis Proves

Difficulty
Easy
Topic
Timing
Language
SV
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

  1. A. STA checks only the single longest combinational path and does not analyze minimum delay or hold timing.
  2. B. STA runs every possible functional input sequence and therefore replaces simulation for protocol and state-machine bugs.
  3. 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.
  4. D. An unconstrained path automatically passes because the timing tool has proven that no clock can capture it.
Exact question handoffPractice Q122

Solve it in the question bank, keep your progress, and reveal the reviewed solution when your access allows.

Open in question bank →
Solution accessEach time you open this Solution, one Practice Credit is used; it is not permanently unlocked. Premium Solution content also uses one credit per opening.
Continue learning

Synthesis and Constraints

Review inference, mapping, clocks, I/O timing, relationships, modes, corners, and exceptions.

  • Timing
  • STA
  • Clocking
Synthesis and Constraints →
Continue practicing

Related questions

Q114 · TimingClassify timing-path startpoints and endpointsEasy→Q836 · TimingConstrain a three-cycle datapathMediumP→Q680 · TimingInput-delay constraints from an external deviceMediumP→
ASIC.FYI · Learn silicon end to end.info@asic.fyi