The Community for Technology Leaders
RSS Icon
Subscribe
Santiago, Chile
Apr. 22, 2009 to Apr. 24, 2009
ISBN: 978-1-4244-3534-0
pp: 62-65
Yanni Zhao , Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China
Jinian Bian , Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China
Shujun Deng , Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China
Zhiqiu Kong , Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China
ABSTRACT
Constrained random simulation methodology still plays an important role in hardware verification due to the limited scalability of formal verification, especially for the large and complex design in industry. There are two aspects to measure the stimulus generator which are the quality of the stimulus generated and the efficiency of the generator. In this paper, we propose a self-tuning method to guide the generation for constrained random simulation by SAT solvers. We use a greedy search strategy in solving process to get the high-uniform distribution of the stimulus, and improve the efficiency of the generator by affinity grouping. Experimental results show that our methods can generate more uniform random stimulus with good performance.
CITATION
Yanni Zhao, Jinian Bian, Shujun Deng, Zhiqiu Kong, "Random stimulus generation with self-tuning", CSCWD, 2009, International Conference on Computer Supported Cooperative Work in Design, International Conference on Computer Supported Cooperative Work in Design 2009, pp. 62-65, doi:10.1109/CSCWD.2009.4968035
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool