Skip to content
STIMSMITH

SAT-based Stimuli Generation

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

NEIGHBORHOOD

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

explore full graph →

RELATIONSHIPS

6 connections
Minimal Stimuli Generation implements → 95% 2e
The SAT-based stimuli generation technique is used to implement minimal stimuli generation by encoding the problem as a SAT instance.
Constraint-based Stimuli Generation implements → 90% 2e
SAT-based stimuli generation is a realization of constraint-based stimuli generation using Boolean satisfiability solvers.
Boolean Satisfiability (SAT) uses → 95% 2e
Boolean satisfiability solving is the core engine used in SAT-based stimuli generation.
boolector uses → 95% 2e
Boolector is the off-the-shelf SAT/SMT solver used in the implementation of SAT-based stimuli generation.
Algorithm 1: Minimal Stimuli Generation ← uses 95% 2e
Algorithm 1 uses SAT-based stimuli generation as its core solving method.
SMT-based Stimuli Generation ← compares with 75% 1e
SMT-based stimuli generation is a related prior approach comparable to the SAT-based technique proposed in this paper.