事务级层次结构引导且功能覆盖率驱动的演绎形式化验证
Transaction Level Hierarchy Guided and Functional Coverage Driven Deductive Formal Verification
AI总结:
本文提出以事务级层次结构替代模块层次结构,通过增强 PDVL 并结合 Coq 的 DFV 流程,将功能覆盖率转化为证明义务,实现 100% 覆盖与证明复用。
摘要:
我们展示了如何用演绎形式化验证取代动态验证(例如仿真),以及如何从符号验证的优势和验证证明的复用中获益。为此,我们将众所周知的基于模块层次结构的概念替换为基于事务级(TL)的替代方案,该方案仍允许我们像在 RTL 上一样精确地描述设计。我们增强了面向方面且面向 TL 的语言 PDVL,以支持在 TL 层次结构的所有层级定义功能覆盖率(FC)和断言。随后,我们展示了如何使用演绎形式化验证(DFV)流程,该流程将 PDVL 代码编译为 Gallina 代码,供 Coq 定理证明器使用。可以论证,FC 可被转换为证明义务,并且证明这些义务等同于 100% 覆盖率。我们还演示了在验证 TL 层次结构更高级别的方面时,如何复用较低级别的证明。我们认为,传统的基于断言的验证(ABV)方法仍得到支持,并且可以使用 DFV 证明 SVA。
英文摘要:
We demonstrate how dynamic verification (e.g. simulation) can be replaced by deductive formal verification and how to benefit from the advantages of symbolic verification and the reuse of verification proofs. To do this, we swap the well-known module-hierarchy based concept with a transaction-level (TL) based alternative, which still allows us to describe the design as precisely as on RTL. We enhance the aspect-oriented and TL oriented language PDVL to support the definition of functional coverage (FC) and assertions at all levels of a TL-hierarchy. We then show how to use a deductive formal verification (DFV) flow which compiles PDVL code into Gallina code to be used by the Coq theorem prover. It can be argued that FC can be converted into proof obligations and that proving them is equivalent to 100\% coverage. We also demonstrate how lower-level proofs can be reused when verifying aspects at higher-levels of a TL-hierarchy. We argue that the traditional assertion-based verification (ABV) methodology is still supported and SVA can be proven using DFV.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。