We use cookies to improve your experience with our site.
Wei Lu, Xiu-Tao Yang, Tao Lv, Xiao-Wei Li. An Efficient Evaluation and Vector Generation Method for Observability-Enhanced Statement Coverage[J]. Journal of Computer Science and Technology, 2005, 20(6): 875-884.
Citation: Wei Lu, Xiu-Tao Yang, Tao Lv, Xiao-Wei Li. An Efficient Evaluation and Vector Generation Method for Observability-Enhanced Statement Coverage[J]. Journal of Computer Science and Technology, 2005, 20(6): 875-884.

An Efficient Evaluation and Vector Generation Method for Observability-Enhanced Statement Coverage

  • Coverage evaluation is indispensable for verification via simulation. As the functional complexity of modern design is increasing at a breathtaking pace, it is requisite to take observability into account. Unfortunately, nowadays coverage metrics taking observability into account are not very satisfactory. On the one hand, for the observabilityassessment algorithms proposed up to now, the overhead of computing is large, so they could not be integrated into simulation tools easily. On the other hand, the vector generation methods involving the metrics taking observability into account are not very efficient, and there exists a disconnection between these metrics and the vector generationprocess. In this paper, some original ideas for the problems above are presented. (1) Precise and concise abstract representations from HDL (Hardware Description Language) descriptions at RTL (Register Transfer Level) are presented to model observability information. (2) A novel observability evaluation method based on the proposed models is introduced. This method is more computationally efficient than prior efforts to assess observability and it could be integrated into compilers and simulators easily. (3) A new simulation vector generation procedure involving the observability-enhanced statement coverage metric is developed. The method is simulation-based and drivenby the distribution of unobserved statements. During this procedure, the proposed algorithm always tries to cover all unobserved statements, and reduce unnecessary backtracking, so it is efficient. The methods proposed have been implemented as a prototype tool for VHDL designs, and the results on benchmarks show significant benefits.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return