Skip to content
STIMSMITH

two-step constrained random synthesis

Technique
First seen 7/7/2026
Last seen 7/7/2026
Evidence 4 chunks

NEIGHBORHOOD

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

explore full graph →

RELATIONSHIPS

9 connections
strip computation uses → 100% 2e
Strip computation is a core component of the software preprocessing step in the two-step methodology.
Hardware accelerated constrained random test generation ← introduces 100% 2e
The paper presents a two-step approach for constrained random synthesis.
constrained random value selection uses → 100% 1e
The two-step methodology performs constrained random value selection in hardware as the second step.
entailed regions uses → 100% 1e
Entailed regions pre-computed in software are used in hardware for random value selection.
Integer Linear Programming uses → 100% 1e
ILP is used in the software preprocessing step to compute solution regions.
linear feedback shift register uses → 100% 1e
LFSR is used in hardware for pseudo-random number generation within entailed regions.
solution space projection uses → 100% 1e
Solution space projection onto 2D planes is used in the preprocessing step of the two-step methodology.
bi-variate linear constraints uses → 100% 1e
The methodology targets bi-variate linear constraints where each constraint involves at most two variables.
constraint pre-processing uses → 100% 1e
The two-step methodology uses constraint pre-processing as its first step.