首页 | 本学科首页   官方微博 | 高级检索  
     

改进的时间帧展开的时序电路等价验证算法
引用本文:丁敏,唐璞山.改进的时间帧展开的时序电路等价验证算法[J].计算机辅助设计与图形学学报,2006,18(1):53-61.
作者姓名:丁敏  唐璞山
作者单位:上海复旦大学微电子系专用集成电路国家重点实验室,上海,200433;上海复旦大学微电子系专用集成电路国家重点实验室,上海,200433
基金项目:国家科技攻关项目;中国科学院资助项目
摘    要:提出一种改进的基于时间帧展开的时序电路等价验证算法,其来源于模型检查中的基于数学归纳的验证算法,在使用并简化了SAT问题中不可满足子集提取过程后,将基本条件检查和归纳检查合并处理.为了能在时间帧展开过程中减少状态搜索空间,利用结构不动点技术并提出了准动态唯一状态约束等改进的方法.实验表明,随着时间帧的不断展开,文中算法运行时间的增长速度明显慢于基于数学归纳法的验证算法,其适合验证经过时序优化后的电路.

关 键 词:时序电路等价验证  形式验证  可满足性问题
收稿时间:2004-12-08
修稿时间:2005-06-09

A Modified Frame Expansion Based Sequential Equivalence Checking Algorithm
Ding Min,Tang Pushan.A Modified Frame Expansion Based Sequential Equivalence Checking Algorithm[J].Journal of Computer-Aided Design & Computer Graphics,2006,18(1):53-61.
Authors:Ding Min  Tang Pushan
Abstract:A new frame-expansion based sequential equivalence checking algorithm is proposed. It derives from the induction-based model checking algorithm, and merges the checking processes of base condition and induction condition using our simplified unsatisfiable core extraction in SAT problem. Furthermore, in order to reduce the state space searched during frame expansion, structural fixed-point technique is exploited, and quasi-dynamic unique state constraint is proposed. Experimental results show that during the expansion of circuit frames, the elapsed time of our method increases much slower than that of the induction based algorithm. The total elapsed time is also promising when verifying sequentially optimized circuits.
Keywords:sequential equivalence checking  formal verification  satisfiability(SAT)  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号