Skip to content
STIMSMITH

Algorithm 1: Minimal Stimuli Generation

CodeArtifact
First seen 8/6/2026
Last seen 8/6/2026
Evidence 3 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 implements → 98% 2e
Algorithm 1 is the formal implementation of the minimal stimuli generation approach.
SAT-based Stimuli Generation uses → 95% 2e
Algorithm 1 uses SAT-based stimuli generation as its core solving method.
Iterative Stimuli Generation uses → 95% 1e
Algorithm 1 uses an iterative approach, incrementing the number of stimuli until a sufficient set is found.
boolector uses → 95% 1e
The implementation of Algorithm 1 uses Boolector as the constraint solver.