An Efficient Observability Evaluation Algorithm Based on Factored Use-Def Chains

摘要

Coverage evaluation is indispensable for simulate modern designs. In this paper, we present an efficient algorithm to evaluate observability coverage, which is based on Factored Use-Def chains (FUD chains), a data-flow analysis technique in compilers. With the strategy of enhanced FUD chains and event-driven analysis, this method has three advantages. First, it is stignificantly more computationally efficient than prior efforts to assess observability information. Secondly, it could be easily integrated into hardware description language (HDL) compilers or simulators. Finally, it is universal, and can be combined with controllability metries, such as statement coverage metric (SCM).