Self-adjusting constrained random stimulus generation using splitting evenness evaluation and XOR constraints

Constrained random stimulus generation plays significant roles in hardware verification nowadays, and the quality of the generated stimuli is key to the efficiency of the test process. In this work, we present a linear dynamic method to guide random stimulus generation by SAT solvers. A splitting simplified Min-Distance-Sum evaluation method and an XOR sampling strategy are integrated in the self-adjusting random stimulus generation framework. The evenness of the split groups is evaluated to find out some uneven parts. Then, random partial solutions for the uneven parts and random XOR constraints for the other inputs are added into constraints to get better distributed stimuli. Experimental results show that our method can evaluate the evenness as well as more complex formulae for stimulus generation, and also confirm that the self-adjusting method can improve the fault coverage ratio by more than 17% averagely with the same number of stimuli.

[1]  A. J. Compton An Algorithm for the Even Distribution of Entities in One Dimension , 1985, Comput. J..

[2]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[3]  Igor L. Markov,et al.  Random Stimulus Generation using Entropy and XOR Constraints , 2008, 2008 Design, Automation and Test in Europe.

[4]  Leena Singh,et al.  Advanced Verification Techniques: A SystemC Based Approach for Successful Tapeout , 2004 .

[5]  Dong Sam Ha,et al.  HOPE: an efficient parallel fault simulator for synchronous sequential circuits , 1992, DAC '92.

[6]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

[7]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[8]  Adnan Aziz,et al.  Constraint-based verification , 2006 .

[9]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[10]  Andreas Kuehlmann,et al.  Stimulus generation for constrained random simulation , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[11]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[12]  Bart Selman,et al.  Counting CSP Solutions Using Generalized XOR Constraints , 2007, AAAI.

[13]  C. Pixley,et al.  Simplifying Boolean constraint solving for random simulation-vector generation , 2002, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[15]  Bart Selman,et al.  Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints , 2006, NIPS.