mixed Boolean/integer variable domains
Mixed Boolean/integer variable domains combine Boolean variables and integer variables within the same constraint-solving problem.
In the cited work on constrained random simulation for hardware verification, these domains are the setting for stimulus generation: input stimuli must be generated randomly while obeying declaratively specified input constraints. The paper frames efficient constraint solving for mixed Boolean/integer variable domains as an important part of the overall verification flow, and it presents a hybrid solver based on Markov-chain Monte Carlo methods for this purpose.
Relevance in constrained random simulation
According to the cited abstract, the efficiency of constrained random simulation depends critically on:
- the performance of the constraint solver, and
- the distribution of the generated solutions.
This makes mixed Boolean/integer variable domains relevant wherever stimulus-generation constraints span both logical conditions and integer-valued quantities.