Issue No. 01 - January (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.656068
<p><b>Abstract</b>—The enormous state spaces which must be searched when verifying the correctness of, or generating tests for, complex circuits precludes the use of traditional approaches. Hard-to-find abstractions are often required to simplify the circuits and make the problems tractable. This paper presents a simple and automatic method to extract the control flow of a circuit so that the resulting state space can be explored for validation coverage analysis and automatic test generation. This control flow, capturing the essential "behavior" of the circuit, is represented as a finite state machine called the ECFM (Extracted Control Flow Machine).</p><p>Simulation is currently the primary means of verifying large circuits, but the definition of a coverage measure for simulation vectors is an open problem. We define functional coverage as the amount of control behavior covered by the test suite. We then combine formal verification techniques, using BDDs as the underlying representation, with traditional ATPG techniques to automatically generate additional sequences which traverse uncovered parts of the control state graph. We also demonstrate how the same abstraction techniques can complement ATPG techniques when attacking hard-to-detect faults in the control part of the design for which conventional ATPG alone proves to be inadequate or inefficient at best. Results on large designs show significant improvement over conventional algorithms.</p>
OBDDs, testing, stuck-at-fault model, verification, abstraction, extracted control flow machine, coverage analysis.
Dinos Moundanos, Jacob A. Abraham, Yatin V. Hoskote, "Abstraction Techniques for Validation Coverage Analysis and Test Generation", IEEE Transactions on Computers, vol. 47, no. , pp. 2-14, January 1998, doi:10.1109/12.656068