Constrained Stimulus Generation with Self-Adjusting Using Tabu Search with Memory
-
- ZHAO Yanni
- EDA lab, Department of Computer Science and Technology, Tsinghua University
-
- BIAN Jinian
- EDA lab, Department of Computer Science and Technology, Tsinghua University
-
- DENG Shujun
- EDA lab, Department of Computer Science and Technology, Tsinghua University
-
- KONG Zhiqiu
- EDA lab, Department of Computer Science and Technology, Tsinghua University
-
- ZHAO Kang
- EDA lab, Department of Computer Science and Technology, Tsinghua University
この論文をさがす
抄録
Despite the growing research effort in formal verification, industrial verification often relies on the constrained random simulation methodology, which is supported by constraint solvers as the stimulus generator integrated within simulator, especially for the large design with complex constraints nowadays. These stimulus generators need to be fast and well-distributed to maintain simulation performance. In this paper, we propose a dynamic method to guide stimulus generation by SAT solvers. An adjusting strategy named Tabu Search with Memory (TSwM) is integrated in the stimulus generator for the search and prune processes along with the constraint solver. Experimental results show that the method proposed in this paper could generate well-distributed stimuli with good performance.
収録刊行物
-
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
-
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E92-A (12), 3086-3093, 2009
一般社団法人 電子情報通信学会
- Tweet
キーワード
詳細情報
-
- CRID
- 1390001206311693952
-
- NII論文ID
- 10026861470
-
- NII書誌ID
- AA10826239
-
- ISSN
- 17451337
- 09168508
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可