首页> 外文期刊>IEICE Transactions on fundamentals of electronics, communications & computer sciences >Constrained Stimulus Generation with Self-Adjusting Using Tabu Search with Memory
【24h】

Constrained Stimulus Generation with Self-Adjusting Using Tabu Search with Memory

机译:使用带记忆的禁忌搜索进行自我调整的约束刺激生成

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

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.
机译:尽管形式验证方面的研究工作越来越多,但工业验证通常依赖于约束随机仿真方法,该方法由约束求解器作为集成在仿真器中的激励发生器支持,特别是对于当今具有复杂约束的大型设计。这些激励发生器需要快速且分布良好,以保持仿真性能。在本文中,我们提出了一种动态方法来指导SAT求解器的激励生成。一种名为 Tabu Search with Memory (TSwM) 的调整策略与约束求解器一起集成在用于搜索和修剪过程的激励生成器中。实验结果表明,本文提出的方法可以产生分布良好的刺激,并具有良好的性能。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号