Random stimulus generation with self-tuning

Authors:
Yanni Zhao; Jinian Bian; Shujun Deng; Zhiqiu Kong
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China
Venue:
CSCWD '09 Proceedings of the 2009 13th International Conference on Computer Supported Cooperative Work in Design
Year:
2009

Citing 0
Cited 3

Toward an extremely-high-throughput and even-distribution pattern generator for the constrained random simulation techniques

Proceedings of the International Conference on Computer-Aided Design
A robust general constrained random pattern generator for constraints with variable ordering

Proceedings of the International Conference on Computer-Aided Design
A robust constraint solving framework for multiple constraint sets in constrained random verification

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

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.