Formal Verification · Hard · SystemVerilog

Bounded Cache Progress Property

Prove every accepted request eventually produces a response within a bounded interval.

Task

If req_valid && req_ready occurs, require resp_valid within 1 to 32 cycles.

Examples

Constraints

Concepts to review

formal, cache, liveness

Open HDLForge to solve this problem in the interactive editor.

Related problems