Accurate QBF-based test pattern generation in presence of unknown values
Abstract
Unknown (X) values may emerge during the design process as well as during system operation and test application. Sources of X-values are for example black boxes, clock-domain boundaries, analog-to-digital converters, or uncontrolled or uninitialized sequential elements.
To compute a detecting pattern for a given stuck-at fault, well defined logic values are required both for fault activation as well as for fault effect propagation to observing outputs. In presence of X-values, classical test generation algorithms, based on topological algorithms or formal Boolean satisfiability (SAT) or BDD-based reasoning, may fail to generate testing patterns or to prove faults untestable.
This work proposes the first efficient stuck-at fault ATPG algorithm able to prove testability or untestability of faults in presence of X-values. It overcomes the principal inaccuracy and pessimism of classical algorithms when X-values are considered. This accuracy is achieved by mapping the test generation problem to an instance of quantified Boolean formula (QBF) satisfiability. The resulting fault coverage improvement is shown by experimental results on ISCAS benchmark and larger industrial circuits.
References
[1]
J. P. Roth, "Diagnosis of automata failures: A calculus and a method," IBM J. Res. Dev., vol. 10, no. 4, pp. 278--291, july 1966.
[2]
P. Goel, "An implicit enumeration algorithm to generate tests for combinational logic circuits," in Proc. Fault Tolerant Computing Symposium, 1980, pp. 145--151.
[3]
H. Fujiwara and T. Shimono, "On the acceleration of test generation algorithms," IEEE Transactions on Computers, vol. C-32, no. 12, pp. 1137--1144, 1983.
[4]
T. Larrabee, "Test pattern generation using boolean satisfiability," IEEE Trans. CAD, vol. 11, no. 1, pp. 4--15, jan 1992.
[5]
P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli, "Combinational test generation using satisfiability," IEEE Trans. CAD of Integrated Circuits and Systems, vol. 15, no. 9, pp. 1167--1176, sep 1996.
[6]
P. Muth, "A nine-valued circuit model for test generation," IEEE Transactions on Computers, vol. C-25, no. 6, pp. 630--636, june 1976.
[7]
P. Flores, H. Neto, and J. Marques Silva, "An exact solution to the minimum size test pattern problem," in Proc. International Conference on Computer Design (ICCD), 1998, pp. 510--515.
[8]
A. Jain, V. Boppana et al., "Testing, verification, and diagnosis in the presence of unknowns," in Proc. IEEE VLSI Test Symposium (VTS), 2000, pp. 263--268.
[9]
J. Carter, B. Rosen et al., "Restricted symbolic evaluation is fast and useful," in Proc. IEEE International Conference on Computer-Aided Design (ICCAD), 1989, pp. 38--41.
[10]
S. Kundu, I. Nair et al., "Symbolic implication in test generation," in Proc. Conference on European Design Automation, 1991, pp. 492--496.
[11]
M. Elm, M. A. Kochte, and H.-J. Wunderlich, "On determining the real output Xs by SAT-based reasoning," in Proc. IEEE Asian Test Symposium, 2010, pp. 39--44.
[12]
H.-Z. Chou, K.-H. Chang, and S.-Y. Kuo, "Accurately handle don't-care conditions in high-level designs and application for reducing initialized registers," IEEE Trans. CAD, vol. 29, no. 4, pp. 646--651, 2010.
[13]
C. Wilson, D. Dill, and R. Bryant, "Symbolic simulation with approximate values," in Formal Methods in Computer-Aided Design, ser. LNCS, W. Hunt and S. Johnson, Eds. Springer, 2000, vol. 1954, pp. 507--522.
[14]
S. Hillebrecht, M. A. Kochte et al., "Exact stuck-at fault classification in presence of unknowns," in Proc. IEEE European Test Symposium (ETS), 2012, pp. 1--6.
[15]
H. K. Büning and U. Bubeck, Handbook of Satisfiability, ser. Frontiers in Artificial Intelligence and Applications 185. IOS Press, 2009, ch. Theory of quantified Boolean formulas.
[16]
L. Zhang and S. Malik, "Conflict driven learning in a quantified Boolean satisfiability solver," in Proc. IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2002, pp. 442--449.
[17]
A. Biere, "Resolve and expand," in Proc. 7th Int'l Conf. on Theory and Applications of Satisfiability Testing (Selected Papers), ser. Lecture Notes in Computer Science, vol. 3542. Springer, 2005, pp. 59--70.
[18]
E. Giunchiglia, P. Marin, and M. Narizzano, "sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning," in Theory and Applications of Satisfiability Testing, ser. LNCS. Springer, 2010, vol. 6175, pp. 85--98.
[19]
A. Sülflow, G. Fey, and R. Drechsler, "Using QBF to increase accuracy of SAT-based debugging," in Proc. IEEE International Symposium on Circuits and Systems (ISCAS), 2010, pp. 641--644.
[20]
G. Tseitin, "On the complexity of derivation in propositional calculus," Studies in constructive mathematics and mathematical logic, vol. 2, no. 115--125, pp. 10--13, 1968.
[21]
T. Schubert, M. Lewis, and B. Becker, "Antom---solver description," SAT Race, 2010.
[22]
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA, 1979.
[23]
E. Giunchiglia, P. Marin, and M. Narizzano, "QuBE7.0 System Description," JSAT, vol. 7, no. 2--3, pp. 83--88, 2010.
Index Terms
- Accurate QBF-based test pattern generation in presence of unknown values
Recommendations
Accurate QBF-Based Test Pattern Generation in Presence of Unknown Values
Unknown (X) values emerge during the design process as well as during system operation and test application. X-sources are for instance black boxes in design models, clock-domain boundaries, analog-to-digital converters, or uncontrolled or uninitialized ...
Accurate Multi-cycle ATPG in Presence of X-Values
ATS '13: Proceedings of the 2013 22nd Asian Test SymposiumUnknown (X) values in a circuit impair test quality and increase test costs. Classical n-valued algorithms for fault simulation and ATPG, which typically use a three- or four-valued logic for the good and faulty circuit, are in principle pessimistic in ...
Accurate CEGAR-based ATPG in presence of unknown values for large industrial designs
DATE '16: Proceedings of the 2016 Conference on Design, Automation & Test in EuropeUnknown values emerge during the design and test generation process as well as during later test application and system operation. They adversely affect the test quality by reducing the controllability and observability of internal circuit structures -- ...
Comments
Information & Contributors
Information
Published In
Sponsors
- EDAA: European Design Automation Association
- ECSI
- EDAC: Electronic Design Automation Consortium
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE CEDA
- The Russian Academy of Sciences: The Russian Academy of Sciences
Publisher
EDA Consortium
San Jose, CA, United States
Publication History
Published: 18 March 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
DATE 13
Sponsor:
- EDAA
- EDAC
- SIGDA
- The Russian Academy of Sciences
Acceptance Rates
Overall Acceptance Rate 518 of 1,794 submissions, 29%
Upcoming Conference
DATE '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 71Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in