Coverability Analysis Using Symbolic Model Checking

  • Authors:
  • Gil Ratzaby;Shmuel Ur;Yaron Wolfsthal

  • Affiliations:
  • -;-;-

  • Venue:
  • CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In simulation based verification of hardware, as well as in software testing, one is faced with the challenge of maximizing coverage of testing while minimizing testing cost. To this end, sophisticated techniques are used to generate clever test cases, and equally sophisticated techniques are employed by engineers to determine the quality - a.k.a. coverage - attained by the tests. The latter activity is called Test Coverage Analysis. While it is an essential component of the development process, test coverage can only be analyzed late in the design cycle when the tested entity and the test harness are both stable. To address this serious restriction, we introduce the notion of coverability, which intuitively refers to the degree to which a model can be covered when subjected to testing. We also showan implementation of coverability checking using Model Checking. The notion of coverability highlights a distinction between (1) whether a model has been covered by some test suite and (2) whether the model can ever be covered by any test suite. Coverability Analysis can be performed as soon as the hardware or software are written, before the test harness has been written.