YENRA VERIFICATION EVIDENCE RECORD Guide: https://yenra.com/silicon-verification/ Worksheet revision: September 16, 2026 Purpose: connect one observable design requirement to checks and reviewable evidence. Duplicate this record for each requirement. It is a planning aid, not a testbench. REQUIREMENT Identifier / owner / specification revision: Observable behavior and acceptance criterion: Clock, reset, interface and boundary semantics: Environment assumptions and excluded behavior: IMPLEMENTATION AND REPRODUCTION Design revision / configuration: Testbench and checker revisions: Tool and library versions: Run command / seed / input data / log locations: Independent expected-result model and review: EVIDENCE PLAN Stimulus or formal property: Monitor: how accepted operations are observed: Checker or scoreboard: what result is compared and when: Coverage: meaningful ordinary and boundary situations to exercise: Method: simulation / formal / emulation / prototype / fabricated device: Method-specific bounds, model differences and operating conditions: RESULT Passed / failed / proved / bounded / inconclusive / waived: Observed result and supporting logs: Coverage reached / uncovered cases and explanation: Failures / minimal reproduction / issue reference: Fix revision / affected checks rerun: Waiver owner / reason / scope / review date: Remaining work / owner: Reviewer / decision / date: ARTICLE EXAMPLE: EIGHT-ENTRY, SINGLE-CLOCK FIFO Sample operations at the rising edge; reset wins and empties the queue. Accept write only if occupancy before the edge is less than 8. Accept read only if occupancy before the edge is greater than 0. No empty bypass. When both are accepted, return the oldest item and append the new. New occupancy = old occupancy + accepted writes - accepted reads, except at reset. Check range 0..8, ordering, reset while occupied, stalls and pointer wraparound. At full occupancy with both requests: read accepted, write blocked, new count 7. At empty occupancy with both requests: write accepted, read blocked, new count 1. A design allowing a full-queue replacement needs a different contract and checker. Methodology references are linked in the guide. Match the UVM library release to the simulator before implementing examples; the worksheet itself uses no UVM API.