Constraint Contradiction
ConceptIn constraint-based random simulation, a constraint contradiction occurs when the overall set of constraints describing a test scenario admits no satisfying assignment, preventing the constraint solver from producing valid stimulus patterns and forcing the simulation run to be terminated. Identifying and resolving such contradictions is a critical and typically time-consuming step in hardware verification.
WIKI
Overview
Constraint-based random simulation is a state-of-the-art technique for verifying multi-million gate industrial designs. Stimuli are generated directly from constraints by a constraint solver, which selects stimulus patterns that satisfy the specified constraints. This approach is valuable because it covers corner case test scenarios that are usually hard to identify manually by the verification engineer, increasing the quality of design verification significantly.
However, when the verification engineer specifies constraints for a specific test scenario, the overall constraint may have no solution. This situation is called a constraint contradiction (equivalently referred to as over-constraining). When a contradiction occurs in a constraint-based random simulation run, the run has to be terminated because no valid stimulus patterns can be applied.
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →