Skip to content
STIMSMITH

Iterative Stimuli Generation

Technique
First seen 8/6/2026
Last seen 8/6/2026
Evidence 4 chunks

NEIGHBORHOOD

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

explore full graph →

RELATIONSHIPS

4 connections
Minimal Stimuli Generation ← compares with 90% 2e
The iterative approach from prior work is compared to the proposed minimal approach to evaluate heuristic quality.
Coverage-driven Stimuli Generation (Yang et al., 2012) ← introduces 85% 2e
The coverage-driven stimuli generation paper introduced the iterative stimuli generation scheme compared in experiments.
Minimal Stimuli Generation implements → 90% 1e
The iterative workflow is part of the proposed approach to determine minimal stimuli sets.
Algorithm 1: Minimal Stimuli Generation ← uses 95% 1e
Algorithm 1 uses an iterative approach, incrementing the number of stimuli until a sufficient set is found.