Test pattern generation using boolean proof engines

Test Pattern Generation using Boolean Proof Engines

Volumn , Issue , 2009, Pages 1-192

  Drechsler, Rolf ^a   Eggersglüß, Stephan ^a   Fey, Görschwin ^a   Tille, Daniel ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891385074     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-90-481-2360-5     Document Type: Book

References (112)

1. M. Abramovici, P. R. Menon, and D. T. Miller. Critical path tracing - An alternative to fault simulation. In Design Automation Conference (DAC), pages 214-220, 1983.
2. M. F. Ali, S. Safarpour, A. Veneris, M. S. Abadir, and R. Drechsler. Post-verification debugging of hierarchical designs. In International Conference on Computer Aided Design (ICCAD), pages 871-876, 2005.
3. F. A. Aloul, I. L. Markov, and K. A. Sakallah. Shatter: Efficient symmetry-breaking for Boolean satisfiability. In Design Automation Conference (DAC), pages 836-839, 2003.
4. D. B. Armstrong. A deductive method for simulating faults in logic circuits. IEEE Transactions on Computers, 21(5):464-471, 1972.
5. D. Bhattacharya, P. Agrawal, and V. D. Agrawal. Delay fault test generation for scan/hold circuits using Boolean expressions. In Design Automation Conference (DAC), pages 159-164, 1992.
6. A. Biere. Adaptive restart strategies for conflict driven SAT solvers. In International Conference on Theory and Applications of Satisfiability Testing (SAT), volume 4996 of LNCS, pages 28-33, 2008.
7. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 1579 of LNCS, pages 193-207, 1999.
8. @8. Boolean Satisfiability Research Group at Princeton University. zChaff, 15 Dec. 2008. http://www.princeton. edu/~chaff/zchaff.html.
9. D. Brand. Redundancy and don't cares in logic synthesis. IEEE Transactions on Computers, 32(10):947-952, 1983.
10. M. A. Breuer and A. D. Friedman. Diagnosis & Reliable Design of Digital Systems. Computer Science Press, 1976.
11. F. Brglez, D. Bryan, and K. Kozminski. Combinational profiles of sequential benchmark circuits. In IEEE International Symposium on Circuits and Systems (ISCAS), pages 1929-1934, 1989.
12. F. Brglez and H. Fujiwara. A neutral netlist of 10 combinational circuits and a target translator in fortran. In IEEE International Symposium on Circuits and Systems (ISCAS), pages 663-698, 1985.
13. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
14. M. L. Bushnell and V. D. Agrawal. Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits. Springer, 2005.
15. C.-A. Wu, T.-H. Lin, C.-C. Lee, and C.-Y. Huang. QuteSAT: A robust circuit-based SAT solver for complex circuit structure. In Design, Automation and Test in Europe (DATE), pages 1313-1318, 2007.
16. K. Chandrasekar and M. S. Hsiao. Integration of learning techniques into incremental satisfiability for efficient path-delay fault test generation. In Design, Automation and Test in Europe (DATE), pages 1002-1007, 2005.
17. C. Chen and S. K. Gupta. A satisfiability-based test generator for path delay faults in combinational circuits. In Design Automation Conference (DAC), pages 209-214, 1996.
18. K. Cheng and H. Chen. Classification and identification of nonrobust untestable path delay faults. IEEE Transactions on Computer Aided Design of Circuits and Systems, 15(8):845-853, 1996.
19. S. A. Cook. The complexity of theorem proving procedures. In 3. ACM Symposium on Theory of Computing, pages 151-158, 1971.
20. F. Corno, M. Reorda, and G. Squillero. RT-level ITC 99 benchmarks and first ATPG results. In IEEE Design & Test of Computers, pages 44-53, 2000.
21. M. Davis, G. Logeman, and D. Loveland. A machine program for theorem proving. Communication of the ACM, 5:394-397, 1962.
22. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:506-521, 1960.
23. S. Disch and C. Scholl. Combinational equivalence checking using incremental SAT solving, output ordering, and resets. In ASP Design Automation Conference (ASPDAC), pages 938-943, 2007.
24. R. Drechsler. BiTeS: A BDD based test pattern generator for strong robust path delay faults. In European Design Automation Conference (EuroDAC), pages 322-327, 1994.
25. R. Drechsler. Using synthesis techniques in SAT solvers. In ITG/GI/GMM-Workshop "Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen", pages 165-173, 2004.
26. R. Drechsler, S. Eggersglüß, G. Fey, A. Glowatz, F. Hapke, J. Schloeffel, and D. Tille. On acceleration of SAT-based ATPG for industrial designs. IEEE Transactions on Computer Aided Design of Circuits and Systems, 27(7):1329-1333, 2008.
27. N. Eén and A. Biere. Effective preprocessing in SAT through variable and clause elimination. In International Conference on Theory and Applications of Satisfiability Testing (SAT), volume 3569 of LNCS, pages 61-75, 2005.
28. N. Eén and N. Sörensson. The MiniSat page, 15 Dec. 2008. http://minisat.se/.
29. N. Eén and N. Sörensson. An extensible SAT solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT), volume 2919 of LNCS, pages 502-518, 2003.
30. S. Eggersglüß and R. Drechsler. Improving test pattern compactness in SAT-based ATPG. In Asian Test Symposium (ATS), pages 445-450, 2007.
31. S. Eggersglüß and R. Drechsler. On the influence of Boolean encodings in SAT-based ATPG for path delay faults. In International Symposium on Multiple-Valued Logic (ISMVL), pages 94-99, 2008.
32. S. Eggersglüß, G. Fey, R. Drechsler, A. Glowatz, F. Hapke, and J. Schloeffel. Combining multi-valued logics in SAT-based ATPG for path delay faults. In ACM & IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE), pages 181-187, 2007.
33. S. Eggersglüß, D. Tille, G. Fey, R. Drechsler, A. Glowatz, F. Hapke, and J. Schloeffel. Experimental studies on SAT-based ATPG for gate delay faults. In International Symposium on Multiple-Valued Logic (ISMVL), 2007.
34. E. B. Eichelberger and T. W. Williams. A logic design structure for LSI testability. In Design Automation Conference (DAC), pages 462-468, 1977.
35. G. Fey, S. Safarpour, A. Veneris, and R. Drechsler. On the relation between simulation-based and SAT-based diagnosis. In Design, Automation and Test in Europe (DATE), pages 1139-1144, 2006.
36. G. Fey, J. Shi, and R. Drechsler. Efficiency of multi-valued encoding in SAT-based ATPG. In International Symposium on Multiple-Valued Logic (ISMVL), pages 25-30, 2006.
37. G. Fey, T. Warode, and R. Drechsler. Using structural learning techniques in SAT-based ATPG. In International Conference on VLSI Design (VLSID), pages 69-76, 2007.
38. K. Fink, F. Fuchs, and M. H. Schulz. Robust and nonrobust path delay fault simulation by parallel processing of patterns. IEEE Transactions on Computers, 41(12):1527-1536, 1992.
39. A. D. Friedman. Easily testable iterative systems. IEEE Transactions on Computers, 22:1061-1064, 1973.
40. Z. Fu, Y. Yu, and S. Malik. Considering circuit observability don't cares in CNF satisfiability. In Design, Automation and Test in Europe (DATE), pages 1108-1113, 2005.
41. K. Fuchs, F. Fink, and M. H. Schulz. DYNAMITE: An efficient automatic test pattern generation system for path delay faults. IEEE Transactions on Computer Aided Design of Circuits and Systems, 10(10):1323-1335, 1991.
42. K. Fuchs, M. Pabst, and T. Rössel. RESIST: A recursive test pattern generation algorithm for path delay faults. In European Design Automation Conference (EuroDAC), pages 316-321, 1994.
43. K. Fuchs, H. C. Wittmann, and K. J. Antreich. Fast test pattern generation for all path delay faults considering various tset classes. In European Test Conference (ETC), pages 89-98, 1993.
44. H. Fujiwara and T. Shimono. On the acceleration of test generation algorithms. IEEE Transactions on Computers, 32:1137-1144, 1983.
45. M. K. Ganai, L. Zhang, P. Ashar, A. Gupta, and S. Malik. Combining strengths of circuit-based and CNF-based algorithms for a highperformance SAT solver. In Design Automation Conference (DAC), pages 747-750, 2002.
46. M. A. Gharaybeh, M. L. Bushnell, and V. D. Agrawal. Classification and test generation for path-delay faults using single stuck-fault tests. In International Test Conference (ITC), pages 139-147, 1995.
47. E. Gizdarski and H. Fujiwara. SPIRIT: A highly robust combinational test generation algorithm. IEEE Transactions on Computer Aided Design of Circuits and Systems, 21(12):1446-1458, 2002.
48. P. Goel. An implicit enumeration algorithm to generate tests for combinational logic. IEEE Transactions on Computers, 30:215-222, 1981.
49. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation and Test in Europe (DATE), pages 142-149, 2002.
50. E. Goldberg and Y. Novikov. Verification of proofs of unsatisfiability for CNF formulas. In Design, Automation and Test in Europe (DATE), pages 886-891, 2003.
51. L. H. Goldstein and E. L. Thigpen. SCOAP: Sandia controllability/ observability analysis program. In Design Automation Conference (DAC), pages 190-196, 1980.
52. D. Große and R. Drechsler. Acceleration of SAT-based iterative property checking. In Correct Hardware Design and Verification Methods (CHARME), volume 3725 of LNCS, pages 349-353, 2005.
53. A. Gupta, A. Gupta, Z. Yang, and P. Ashar. Dynamic detection and removal of inactive clauses in SAT with application in image computation. In Design Automation Conference (DAC), pages 536-541, 2001.
54. P. Gupta and M. Hsiao. ALAPTF: A new transition fault model and the ATPG algorithm. In International Test Conference (ITC), pages 1053-1060, 2004.
55. J. N. Hooker. Solving the incremental satisfiability problem. Journal of Logic Programming, 15(1-2):177-186, 1993.
56. I. D. Huang and S. K. Gupta. Selection of paths for delay testing. In Asian Test Symposium (ATS), pages 208-215, 2005.
57. F. Hutter, D. Babić, H. H. Hoos, and A. J. Hu. Boosting verification by automatic tuning of decision procedures. In International Conference on Formal Methods in CAD (FMCAD), pages 27-34, 2007.
58. M. K. Iyer, G. Parthasarathy, and K.-T. Cheng. SATORI - A fast sequential SAT engine for circuits. In International Conference on Computer Aided Design (ICCAD), pages 320-325, 2003.
59. N. Jha and S. Gupta. Testing of Digital Systems. Cambridge University Press, 2003.
60. H. Jin and F. Somenzi. CirCUs: A hybrid satisfiability solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT), volume 3542 of LNCS, pages 211-223, 2005.
61. J. Kim, J. Whittemore, J. P. Marques-Silva, and K. A. Sakallah. On applying incremental satisfiability to delay fault testing. In Design, Automation and Test in Europe (DATE), pages 380-384, 2000.
62. K. L. Kodandapani and D. K. Pradhan. Undetectability of bridging faults and validity of stuck-at fault test sets. IEEE Transactions on Computers, C-29(1):55-59, 1980.
63. A. Krstić and K.-T. Cheng. Delay Fault Testing for VLSI Circuits. Kluwer, Boston, MA, 1998.
64. A. Kuehlmann, V. Paruthi, F. Krohm, and M. K. Ganai. Robust Boolean reasoning for equivalence checking and functional property verification. IEEE Transactions on Computer Aided Design of Circuits and Systems, 21(12):1377-1394, 2002.
65. W. Kunz. HANNIBAL: An efficient tool for logic verification based on recursive learning. In International Conference on Computer Aided Design (ICCAD), pages 538-543, 1993.
66. W. Kunz and D. K. Pradhan. Recursive learning: A new implication technique for efficient solutions of CAD problems: Test, verification and optimization. IEEE Transactions on Computer Aided Design of Circuits and Systems, 13(9):1143-1158, 1994.
67. T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Transactions on Computer Aided Design of Circuits and Systems, 11:4-15, 1992.
68. H. K. Lee and D. S. Ha. HOPE: An efficient parallel fault simulator for synchronous sequential circuits. In Design Automation Conference (DAC), pages 336-340, 1992.
69. H. K. Lee and D. S. Ha. Atalanta: An efficient ATPG for combinational circuits. Technical Report 12, Department of Electrical Engineering, Virginia Polytechnic Institute and State University, 1993.
70. M. Liffiton, M. Mneimneh, I. Lynce, Z. Andraus, J. Marques-Silva, and K. Sakallah. A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints: An International Journal, to appear in 2009.
71. C.-J. Lin and S. M. Reddy. On delay fault testing in logic circuits. IEEE Transactions on Computer Aided Design of Circuits and Systems, 6(5):694-703, 1987.
72. X. Lin, K.-H. Tsai, C. Wang, M. Kassab, J. Rajski, T. Kobayashi, R. Klingenberg, Y. Sato, S. Hamada, and T. Aikyo. Timing-aware ATPG for high quality at-speed testing of small delay defects. In Asian Test Symposium (ATS), 2006.
73. F. Lu. UCSB circuit SAT solver - A circuit SAT solver based upon signal correlation guided learning, 15 Dec. 2008. http://cadlab.ece. ucsb.edu/downloads/CSAT.htm.
74. F. Lu, L.-C. Wang, K.-T. Cheng, and R. Huang. A circuit SAT solver with signal correlation guided learning. In Design, Automation and Test in Europe (DATE), pages 892-897, 2003.
75. F. Lu, L.-C. Wang, K.-T. Cheng, J. Moondanos, and Z. Hanna. A signal correlation guided atpg solver and its applications for solving difficult industrial cases. In Design Automation Conference (DAC), pages 436-441, 2003.
76. J. P. Marques-Silva. The impact of branching heuristics in propositional satisfiability algorithms. In 9th Portuguese Conference on Artificial Intelligence (EPIA), pages 62-74, 1999.
77. J. P. Marques-Silva and K. A. Sakallah. Robust search algorithms for test pattern generation. In International Symposium on Fault-Tolerant Computing (FTCS), pages 152-161, 1997.
78. J. P. Marques-Silva and K. A. Sakallah. Robust search algorithms for test pattern generation. Technical Report RT/02/97, Department of Informatics, Technical University of Lisbon, January 1997.
79. J. P. Marques-Silva and K. A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
80. P. M. Maurer. Efficient event-driven simulation by exploiting the output observability of gate clusters. IEEE Transactions on Computer Aided Design of Circuits and Systems, 22(11):1471-1486, 2003.
81. K. Miyase and S. Kajihara. XID: Don't care identification of test patterns for combinational circuits. IEEE Transactions on Computer Aided Design of Circuits and Systems, 23(2):321-326, 2004.
82. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference (DAC), pages 530-535, 2001.
83. T. M. Niermann and J. H. Patel. HITEC: A test generation package for sequential circuits. In European Conference on Design Automation (EDAC), pages 214-218, 1991.
84. M. Panagiotis and D. Vroon. Efficient circuit to CNF conversion. In International Conference on Theory and Applications of Satisfiability Testing (SAT), volume 4501 of LNCS, pages 4-9, 2007.
85. I. Pomeranz, S. M. Reddy, and P. Uppaluri. NEST: A nonenumerative test generation method for path delay faults in combinational circuits. IEEE Transactions on Computer Aided Design of Circuits and Systems, 14(12):1505-1515, 1995.
86. J. P. Roth. Diagnosis of automata failures: A calculus and a method. IBM Journal Research and Development, 10:278-281, 1966.
87. S. Safarpour, A. Veneris, R. Drechsler, and J. Lee. Managing don't cares in Boolean satisfiability. In Design, Automation and Test in Europe (DATE), pages 260-265, 2004.
88. M. Schulz, E. Trischler, and T. Sarfert. SOCRATES: A highly efficient automatic test pattern generation system. IEEE Transactions on Computer Aided Design of Circuits and Systems, 7(1):126-137, 1988.
89. E. Sentovich, K. Singh, L. Lavagno, Ch. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli. SIS: A system for sequential circuit synthesis. Technical Report, University of Berkeley, 1992.
90. O. Shacham and K. Yorav. On-the-fly resolve trace minimization. In Design Automation Conference (DAC), pages 594-599, 2007.
91. J. Shi, G. Fey, R. Drechsler, A. Glowatz, F. Hapke, and J. Schlöffel. PASSAT: Efficient SAT-based test pattern generation for industrial circuits. In IEEE Annual Symposium on VLSI (ISVLSI), pages 212-217, 2005.
92. O. Shtrichman. Pruning techniques for the SAT-based bounded model checking problem. In Correct Hardware Design and Verification Methods (CHARME), volume 2144 of LNCS, pages 58-70, 2001.
93. A. Smith, A. Veneris, and A. Viglas. Design diagnosis using Boolean satisfiability. In ASP Design Automation Conference (ASPDAC), pages 218-223, 2004.
94. G. L. Smith. Model for delay faults based upon paths. In International Test Conference (ITC), pages 342-349, 1985.
95. P. Stephan, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Combinational test generation using satisfiability. IEEE Transactions on Computer Aided Design of Circuits and Systems, 15:1167-1176, 1996.
96. P. Tafertshofer and A. Ganz. SAT based ATPG using fast justification and propagation in the implication graph. In International Conference on Computer Aided Design (ICCAD), pages 139-146, 1999.
97. P. Tafertshofer, A. Ganz, and K. Antreich. Igraine - An implication graph based engine for fast implication, justification, and propagation. IEEE Transactions on Computer Aided Design of Circuits and Systems, 19(8):907-927, 2000.
98. P. Tafertshofer, A. Ganz, and M. Henftling. A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists. In International Conference on Computer Aided Design (IC-CAD), pages 648-655, 1997.
99. D. Tille and R. Drechsler. Incremental SAT instance generation for SAT-based ATPG. In IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems (DDECS), pages 68-73, 2008.
100. D. Tille, G. Fey, and R. Drechsler. Instance generation for SAT-based ATPG. In IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems (DDECS), pages 153-156, 2007.
101. S. Tragoudas and D. Karayiannis. A fast nonenumerative automatic test pattern generator for path delay faults. IEEE Transactions on Computer Aided Design of Circuits and Systems, 18(7):1050-1057, 1999.
102. G. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2, pages 115-125, 1968
103. @ (Reprinted in: J. Siekmann, G. Wrightson (Ed.), Automation of Reasoning, Vol. 2, Springer, Berlin, 1983, pp. 466-483).
104. J. T. van der Linden. Automatic Test Pattern Generation for Three-State Circuits. Ph. D. thesis, Technical University Delft, The Netherlands, 1996.
105. J. A. Waicukauski, E. Lindbloom, B. K. Rosen, and V. S. Iyengar. Transition fault simulation. IEEE Design & Test of Computers, 4(2):32-38, 1987.
106. L.-C. Wang, J.-J. Liou, and K.-T. Cheng. Critical path selection for delay fault testing based upon a statistical timing model. IEEE Transactions on Computer Aided Design of Circuits and Systems, 23(11):1550-1565, 2004.
107. T. Warode. Strukturelles Lernen in der erfüllbarkeits-basierten Testmustergenerierung (Structural learning for test pattern generation based on satisfiability). Master's thesis, University of Bremen, Germany, 2006.
108. J. Whittemore, J. Kim, and K. Sakallah. SATIRE: A new incremental satisfiability engine. In Design Automation Conference (DAC), pages 542-545, 2001.
109. M. J. Y. Williams and J. B. Angell. Enhancing testability of large-scale integrated circuits via test points and additional logic. IEEE Transactions on Computers, C-22(1):46-60, 1973.
110. K. Yang, K.-T. Cheng, and L.-C. Wang. Trangen: A SAT-based ATPG for path-oriented transition faults. In ASP Design Automation Conference (ASPDAC), pages 92-97, 2004.
111. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In International Conference on Computer Aided Design (ICCAD), pages 279-285, 2001.
112. L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Design, Automation and Test in Europe (DATE), pages 880-885, 2003.