期刊文献+

模型检验中迁移关系的分组策略 被引量:3

Strategy to Group Partitioned Transition Relationship in Model Checking
在线阅读 下载PDF
导出
摘要 迁移关系的构建是基于BDD模型检验中的一个重要环节 ,而建立占内存尽可能小且运算高效的迁移关系一直是难点 ,通常做法是对迁移关系进行分割 提出一种的对按位分割后的迁移关系进行分组的方法 通过对IS CAS 89中时序电路的试验表明 。 In BDD-based model checking, it is a critical step to build a small and efficient transition relationship. An effective method is to partition it according to the bit of future state. The author proposed a strategy to group the partitioned transition relationship. The experiment conducted on the benchmark of ISCAS89 exhibits that our method is more effective under certain conditions.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2003年第9期1101-1104,共4页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金重点项目 ( 90 2 0 70 0 2 ) 北京市科技重点项目(H0 2 0 12 0 12 0 13 0 )资助
关键词 集成电路 设计 模型检验 迁移关系 分组策略 BDD模型 model checking transition relationship BDD
  • 相关文献

参考文献8

  • 1Moon In-Ho, et al. Least fix-point approximations for reachability analysis [ A ] . In: Proceedings of the International Conference on Computer-Aided Design, San Jose, CA, 1999.41 -- 44.
  • 2Bryant R E. Graph-based algorithms for Boolean function manipulation[J]. IEEE Transactions on Computers, 1986, 35(8): 677--691.
  • 3Fabio Somenzi. CUDD: CU decision diagram package release 2.3.1 [ OL ]. ftp://vlsi. colorado. edu/pub/cudd-2.3.1. tar. gz,2001.
  • 4Shankar G Govindaraju, et al. Approximate reaehability with BDDs using overlapping projections[A]. In: Proceedings of the 35th Design Automation Conference, San Francisco, 1998. 451-- 456.
  • 5Andreas Hett, et al. Distance driven finite state machine traversal[A] . In: Proceedings of the 37th Design Automation Conference, Los Angeles, 2000. 39--42.
  • 6Moon In-Ho, et al. To split or to conjoin: The question in image computation[A] . In: Proceedings of the 37th Design Automation Conference, Los Angeles, 2000. 23--28.
  • 7Carl Pixel. Formal verification of commercial integrated circuits[J]. IEEE Design and Test of Computers, 2001, 18(4): 4--5.
  • 8Car Pixel, et al. Commercial design verification: Method ologyand tools [A]. In: Proceedings of IEEE International Test Conference, Washingto, D C, 1996. 839--848.

同被引文献32

  • 1严晓浪,郑飞君,葛海通,杨军.结合二叉判决图和布尔可满足性的等价性验证算法[J].电子学报,2004,32(8):1233-1235. 被引量:8
  • 2李暾,郭阳,李思昆.RTL数据通路模拟矢量自动生成方法研究与实现[J].计算机辅助设计与图形学学报,2004,16(8):1062-1069. 被引量:2
  • 3Clarke E, Biere A, Raimi A, et al. Bounded model checking using satisfiability solving[J]. Formal Methods in System Design, 2001, 19(1): 7-34
  • 4Biere A, Kunz W. SAT and ATPG: Boolean engines for formal hardware verification[C]//Proceedings of IEEE/ACM International Conference on Computer Aided Design, San Jose, California, 2002: 782-785
  • 5McMillan K L. Symbolic model checking[M]. Boston, Massachusetts: Kluwer Academic Publishers, 1993
  • 6Marques-Silva J, Sakallah K. Boolean satisfiability in electronic design automation[C]//Proceedings of the 37th Design Automation Conference, Los Angeles, California, 2000: 675-680
  • 7陈闽川, 吴为民, 边计年. 基于可满足性问题求解的时序电路性质检验方法[C]//第3届中国测试学术会议,长沙,2004: 292-297.
  • 8Fallah F, Devadas S, Keutzer K. Functional vector generation for HDL models using linear programming and 3-satisfiability[C]//Proceedings of the 35th Design Automation Conference, San Francisco, California, 1998: 528~533
  • 9Fallah F. Coverage directed validation of hardware models[D]. Cambridge, Massachusetts: Massachusetts Institute of Technology, 1999
  • 10Huang C Y, Cheng K T. Using word-level ATPG and modular arithmetic constraint-solving techniques for assertion property checking[J]. IEEE Transactions on CAD of Integrated Circuits and Systems, 2001, 20(3): 381-391

引证文献3

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部