Random generation of combinatorial structures from a uniform
Theoretical Computer Science
The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
On the hardness of approximate reasoning
Artificial Intelligence
Uniform generation of NP - witnesses using an NP -oracle
Information and Computation
Constraint Slving for Test Case Generation
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
A compiler for deterministic, decomposable negation normal form
Eighteenth national conference on Artificial intelligence
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Algorithms and Complexity Results for #SAT and Bayesian Inference
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Stimulus generation for constrained random simulation
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Functional Design Errors in Digital Circuits: Diagnosis Correction and Repair
Functional Design Errors in Digital Circuits: Diagnosis Correction and Repair
Constraint-based random stimuli generation for hardware verification
IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Model counting: a new strategy for obtaining good bounds
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Simulation-Based Verification of Floating-Point Division
IEEE Transactions on Computers
Satisfiability modulo theories: introduction and applications
Communications of the ACM
Validating a modern microprocessor
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Simplifying Boolean constraint solving for random simulation-vector generation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Functional verification constitutes one of the most challenging tasks in the development of modern hardware systems, and simulation-based verification techniques dominate the functional verification landscape. A dominant paradigm in simulation-based verification is directed random testing, where a model of the system is simulated with a set of random test stimuli that are uniformly or near-uniformly distributed over the space of all stimuli satisfying a given set of constraints. Uniform or near-uniform generation of solutions for large constraint sets is therefore a problem of theoretical and practical interest. For Boolean constraints, prior work offered heuristic approaches with no guarantee of performance, and theoretical approaches with proven guarantees, but poor performance in practice. We offer here a new approach with theoretical performance guarantees and demonstrate its practical utility on large constraint sets.