Supervised Learning for Coverage-Directed Test Selection in Simulation-Based Verification
Nyasha Masamba, Kerstin Eder, Tim Blackmore

TL;DR
This paper introduces a supervised learning-based method for selecting the most effective tests in simulation-based verification, reducing manual effort and resource consumption while accelerating coverage completion.
Contribution
It presents a novel coverage-directed test selection approach that automatically extracts constraints and prioritizes tests likely to improve functional coverage.
Findings
Reduces manual constraint writing in verification.
Accelerates coverage closure in industrial hardware design.
Decreases verification resource consumption.
Abstract
Constrained random test generation is one of the most widely adopted methods for generating stimuli for simulation-based verification. Randomness leads to test diversity, but tests tend to repeatedly exercise the same design logic. Constraints are written (typically manually) to bias random tests towards interesting, hard-to-reach, and yet-untested logic. However, as verification progresses, most constrained random tests yield little to no effect on functional coverage. If stimuli generation consumes significantly less resources than simulation, then a better approach involves randomly generating a large number of tests, selecting the most effective subset, and only simulating that subset. In this paper, we introduce a novel method for automatic constraint extraction and test selection. This method, which we call coverage-directed test selection, is based on supervised learning from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
