Skip to content
STIMSMITH

constraint-based test case generation

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

NEIGHBORHOOD

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

explore full graph →

RELATIONSHIPS

9 connections
heap-allocated data structures uses → 95% 2e
The technique handles arbitrary pointer-based data structures allocated on the heap.
execution path uses → 95% 2e
The constraint-based approach generates test cases by modeling execution paths as constraint problems.
cyclic data structures uses → 90% 2e
The approach can generate test cases involving cyclic data structures.
non-determinism in constraint solving uses → 90% 2e
The approach models both path selection and value assignment as non-determinism in constraint solving.
Towards a framework for constraint-based test case generation ← introduces 100% 1e
The paper proposes an approach for automated test case generation based on constraint programming techniques.
Coverage Criterion implements → 90% 1e
The framework can implement any coverage criterion through parametrizable CP search strategies.
control flow graph uses → 95% 1e
The technique transforms paths through the control-flow graph into constraints.
constraint variable uses → 95% 1e
Unknown values are replaced by constraint variables during symbolic execution for test case generation.
pointer-based data structures uses → 95% 1e
The approach generates test cases dealing with in-place updates of variables, pointers and data structures.