Skip to content
STIMSMITH

Pseudorandom Biased Generation

Concept

Pseudorandom biased generation refers to the biased, pseudorandom, dynamic generation scheme used in IBM's first generation of random test-program generators for functional processor verification. In the documented IBM lineage, this approach preceded model-based pseudorandom generation, including Genesys and Genesys-Pro, which separated architecture-specific models from a generic generation engine and later used constraint-satisfaction solving to improve generation success and test quality.

First seen 5/26/2026
Last seen 5/26/2026
Evidence 3 chunks
Wiki v1

WIKI

Overview

Pseudorandom biased generation is documented in the context of IBM random test-program generation for functional processor verification. IBM's first generation of test generators, developed in the mid-1980s, incorporated a biased, pseudorandom, dynamic generation scheme. In the same verification context, generated stimuli are usually test programs intended to trigger architecture and microarchitecture events defined by a verification plan.

Verification role

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

1 connections
Genesys-Pro ← uses 95% 1e
Genesys-Pro uses pseudorandom biased generation as its generation approach

CITATIONS

9 sources
9 citations — click to expand
[1] IBM's first generation of test generators, developed in the mid-1980s, incorporated a biased, pseudorandom, dynamic generation scheme. [PDF] Genesys-pro: innovations in test program generation for functional ...
[2] Generated stimuli in processor functional verification are usually test programs that trigger architecture and microarchitecture events defined by a verification plan. [PDF] Genesys-pro: innovations in test program generation for functional ...
[3] Test programs must meet validity and quality requirements, and random selections during generation create variation among distinct, well-distributed instances. [PDF] Genesys-pro: innovations in test program generation for functional ...
[4] The need for a generic solution led to model-based test generation that separates a generic architecture-independent engine from a model of the targeted architecture. [PDF] Genesys-pro: innovations in test program generation for functional ...
[5] IBM developed Genesys in 1991 as the first model-based pseudorandom test-program generator. [PDF] Genesys-pro: innovations in test program generation for functional ...
[6] Genesys-Pro translates the test-generation problem into a CSP and uses a generic CSP solver customized for pseudorandom test generation to increase generation success probability and improve test-program quality. [PDF] Genesys-pro: innovations in test program generation for functional ...
[7] For single-instruction generation, Genesys-Pro formulates the request as a CSP, solves it, and produces an instruction instance satisfying the constraints. [PDF] Genesys-pro: innovations in test program generation for functional ...
[8] A CSP consists of variables, domains, and constraints; a solution assigns each variable a domain value so that all constraints are satisfied. [PDF] Genesys-pro: innovations in test program generation for functional ...
[9] Genesys-Pro uses a customized maintaining-arc-consistency algorithm that produces uniformly distributed random solutions satisfying all mandatory constraints and as many nonmandatory constraints as possible. [PDF] Genesys-pro: innovations in test program generation for functional ...