SAT-based unbounded symbolic model checking

Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451) Pub Date : 2005-01-24 DOI:10.1109/DAC.2003.1219136

Hyeong-Ju Kang, I. Park

引用次数: 34

Abstract

This paper describes a SAT-based unbounded symbolic model checking algorithm. BDDs have been widely used for symbolic model checking, but the approach suffers from memory overflow. The SAT procedure was exploited to overcome the problem, but it verified only the states reachable through a bounded number of transitions. The proposed algorithm deals with unbounded symbolic model checking. The proposed algorithm deals with unbounded symbolic model checking. The conjunctive normal form is used to represent sets of states and the transition relation, and a SAT procedure is modified to compute the existential quantification required in obtaining a pre-image. Some optimization techniques are exploited, and the depth first search method is used for efficient safety-property checking. Experimental results show the proposed algorithm can check more circuits than BDD-based symbolic model checking tools.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于sat的无界符号模型检验

提出了一种基于sat的无界符号模型检验算法。bdd已广泛用于符号模型检查，但这种方法存在内存溢出的问题。利用SAT过程来克服这个问题，但它只验证通过有限数量的转换可到达的状态。该算法处理无界符号模型检验。该算法处理无界符号模型检验。使用合取范式来表示状态集和转换关系，并修改SAT程序来计算获得预像所需的存在量化。利用一些优化技术，采用深度优先搜索法进行有效的安全性能检查。实验结果表明，与基于bdd的符号模型检测工具相比，该算法可以检测更多的电路。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)

自引率

0.00%

发文量

期刊最新文献

SAT-based unbounded symbolic model checking Self-biased high-bandwidth low-jitter 1-to-4096 multiplier clock generator PLL Design techniques for sensor appliances: foundations and light compass case study Hybrid hierarchical timing closure methodology for a high performance and low power DSP Low-power design methodology for an on-chip with adaptive bandwidth capability