首页> 外文会议>IFIP TC 10 international embedded systems symposium >Bit-Precise Formal Verification for SystemC Using Satisfiability Modulo Theories Solving
【24h】

Bit-Precise Formal Verification for SystemC Using Satisfiability Modulo Theories Solving

机译:使用可满足性模理论求解的SystemC的位精确形式验证

获取原文

摘要

Hardware/software codesigns are often modeled with the system level design language SystemC. Especially for safety critical applications, it is crucial to guarantee that such a design meets its requirement. In this paper, we present an approach to formally verify SystemC designs using the UCLID satisfiability modulo theories (SMT) solver. UCLID supports finite precision bitvector arithmetics. Thus, we can handle SystemC designs on a bit-precise level, which enables us to formally verify deeply integrated hardware/software systems that comprise detailed hardware models. At the same time, we exploit UCLID's ability to handle symbolic variables and use k-inductive invariant checking for SystemC designs. With this inductive approach, we can counteract the state space explosion problem, which model checking approaches suffer from. We demonstrate the practical applicability of our approach with a SystemC design that comprises a bit- and cycle-accurate model of a UART and software that reads data from the UART.
机译:硬件/软件代码符号通常使用系统级设计语言SystemC进行建模。特别是对于安全性至关重要的应用,至关重要的是要确保这种设计满足其要求。在本文中,我们提出了一种使用UCLID可满足性模理论(SMT)求解器来正式验证SystemC设计的方法。 UCLID支持有限精度位向量算法。因此,我们可以在位精度级别上处理SystemC设计,这使我们能够正式验证包含详细硬件模型的深度集成的硬件/软件系统。同时,我们利用UCLID处理符号变量的能力,并对SystemC设计使用k归纳不变式检查。通过这种归纳方法,我们可以解决模型检查方法所遭受的状态空间爆炸问题。我们通过SystemC设计演示了我们方法的实际适用性,该SystemC设计包括UART的位和周期精确模型以及从UART读取数据的软件。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号