As microprocessor designs have grown considerably in complexity,
the use of hand-written directed tests in verification has dwindled.
Automated random test generators that cover the stimulus space more
efficiently have emerged in their place. These random test generators
create microcode test sequences, emphasizing the distribution of stimuli
across all meaningful values for opcodes and other instruction
attributes. Traditional methods randomize instruction fields
sequentially, which often results in verbose, redundant code and limited
control over distributions.
In this article, we explore using a hierarchical constrained-random
approach to accelerate generation and reduce memory consumption, while
providing optimal distribution and biasing to hit corner cases using the
Synopsys VCS constraint solver. We present and analyze the method and
discuss its effectiveness in today’s verification environment.
To access the full article (PDF
Format), click here.
Join our online Radio Show on Friday 11th July starting at 2:00pm Eastern, when EETimes editor of all things fun and interesting, Max Maxfield, and embedded systems expert, Jack Ganssle, will debate as to just what is, and is not, and embedded system.