首页> 外文会议> >A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test
【24h】

A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test

机译:基于性能的基于QBF的迭代逻辑阵列表示形式,具有验证,调试和测试的应用程序

获取原文

摘要

Many CAD for VLSI techniques use time-frame expansion, also known as the Iterative Logic Array representation, to model the sequential behavior of a system. Replicating industrial- size designs for many time-frames may impose impractically ex- cessive memory requirements. This work proposes a performance- driven, succinct and parametrizable Quantified Boolean Formula (QBF) satisfiability encoding and its hardware implementation for modeling sequential circuit behavior. This encoding is then applied to three notable CAD problems, namely Bounded Model Checking (BMC), sequential test generation and design debugging. Extensive experiments on industrial circuits confirm outstanding run-time and memory gains compared to state-of-the-art techniques, pro- moting the use of QBF in CAD for VLSI.
机译:许多用于VLSI的CAD技术都使用时间范围扩展(也称为迭代逻辑阵列表示)来对系统的顺序行为进行建模。在许多时间范围内复制工业规模的设计可能会带来不切实际的过大内存需求。这项工作提出了一种性能驱动,简洁且可参数化的量化布尔公式(QBF)可满足性编码及其用于对顺序电路行为进行建模的硬件实现。然后将此编码应用于三个显着的CAD问题,即边界模型检查(BMC),顺序测试生成和设计调试。与最先进的技术相比,在工业电路上进行的大量实验证实了出色的运行时间和存储增益,从而促进了QBF在VLSI的CAD中的使用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号