Chapter 7 quiz

Check yourself: Formal Apps for Everyday Problems

Pick one answer per question, then press Check answers. Explanations appear after checking. Your best score is saved in this browser.

Q1 Why is connectivity verification a good fit for formal? Because connections are hard to simulate in principle. Because the properties are simple, there are very many of them, and formal checks each exhaustively in all modes. Because connectivity only exists in netlists. Because formal does not need a connection table.

Q2 In vr_checker with SRC_IS_DUT = 0, how are the valid/data rules used? As assertions As assumptions about the DUT's inputs As covers only They are ignored

Q3 A write-1-to-clear status bit and a hardware set happen in the same cycle. In our csr_block, what is the result? The bit is cleared The bit is set (hardware wins) The bit toggles The result is X

Q4 Formal proves a coverage item unreachable. What is the correct action? Write more random tests. Exclude the item from coverage with the proof as justification (re-check if the design or assumptions change). Delete the corresponding RTL. Lower the coverage goal.

Was this page helpful?

Tip: select any text on the page before clicking Report and it will be quoted in your report.