A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On Parallel Scalable Uniform SAT Witness Generation
[chapter]
2015
Lecture Notes in Computer Science
Constrained-random verification (CRV) is widely used in industry for validating hardware designs. The e↵ectiveness of CRV depends on the uniformity of test stimuli generated from a given set of constraints. Most existing techniques sacrifice either uniformity or scalability when generating stimuli. While recent work based on random hash functions has shown that it is possible to generate almost uniform stimuli from constraints with 100,000+ variables, the performance still falls short of
doi:10.1007/978-3-662-46681-0_25
fatcat:nrbbch5ok5d4hdlbp74gf5ds4y