Simulation-Based Functional Test Generation for Embedded Processors
Authors:
- 2 October 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 55 (11) , 1335-1343
Abstract
Deterministic functional test pattern generation has been a long-standing open problem, which is an important problem to be solved for both design verification and manufacturing testing. One key in developing a practical functional test pattern generation approach is to avoid the exponential growth of the test generation complexity in terms of the design size. This work proposes a novel functional test generation approach where simulation results are used to guide the generation of additional tests. Our methodology avoids the complexity growth issue by converting some modules in a design into simpler and more efficient models. Then, these models are used to facilitate the actual test generation process. We develop two sets of techniques to achieve these conversions: Boolean learning for random logic and arithmetic learning for datapath modules. We demonstrate the effectiveness and discuss the. limitations of these techniques through experiments on benchmark circuits. Last, we validate the overall test generation methodology based on the OpenRISC 1200 microprocessorKeywords
This publication has 24 references indexed in Scilit:
- On testing the path delay faults of a microprocessor using its instruction set2002
- Improving the variable ordering of OBDDs is NP-completeIEEE Transactions on Computers, 1996
- Reduction of OBDDs in linear timeInformation Processing Letters, 1993
- Finding the optimal variable ordering for binary decision diagramsIEEE Transactions on Computers, 1990
- Interpolating polynomials from their valuesJournal of Symbolic Computation, 1990
- A deterministic algorithm for sparse multivariate polynomial interpolation1988
- On the learnability of Boolean formulae1987
- Recent Results on Boolean Concept Learning1987
- A theory of the learnableCommunications of the ACM, 1984
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980