首页 | 官方网站   微博 | 高级检索  
     


Coverage metrics for formal verification
Authors:Hana Chockler  Orna Kupferman  Moshe Vardi
Affiliation:(1) IBM Research Labs, Mount Carmel, Haifa, 31905, Israel;(2) School of Engineering and Computer Science, Hebrew University, Jerusalem, 91904, Israel;(3) Department of Computer Science, Rice University, Houston, TX 77251-1892, USA
Abstract:In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complete the specification is and whether it really covers all the behaviors of the system. The challenge of making the verification process as exhaustive as possible is even more crucial in simulation-based verification, where the infeasible task of checking all input sequences is replaced by checking a test suite consisting of a finite subset of them. It is very important to measure the exhaustiveness of the test suite, and indeed there has been extensive research in the simulation-based verification community on coverage metrics, which provide such a measure. It turns out that no single measure can be absolute, leading to the development of numerous coverage metrics whose usage is determined by industrial verification methodologies. On the other hand, prior research of coverage in formal verification has focused solely on state-based coverage. In this paper we adapt the work done on coverage in simulation-based verification to the formal-verification setting in order to obtain new coverage metrics. Thus, for each of the metrics used in simulation-based verification, we present a corresponding metric that is suitable for the setting of formal verification and describe an algorithmic way to check it.
Keywords:Formal verification  Model checking  Coverage metrics  Algorithms
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号