Constraint Satisfaction Problem-based Test Generation
TechniqueConstraint Satisfaction Problem-based Test Generation is a simulation-oriented processor verification technique in which constraints are used to specify or guide the generation of processor-level test stimuli, with CSP or SMT solvers processing those constraints. The cited evidence places it among model-based test generation approaches and contrasts this family of techniques with coverage-guided fuzzing for processor verification.
WIKI
Overview
Constraint Satisfaction Problem-based Test Generation is a processor-verification technique in which constraints are used as part of the test-input specification and are processed by Constraint Satisfaction Problem (CSP) or Satisfiability Modulo Theories (SMT) solvers to generate processor-level stimuli. The technique appears in the broader class of simulation-based processor verification approaches that rely on test generation. [C1]
Role in processor verification
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →