Automatic test pattern generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3965 LNCS, Issue , 2006, Pages 30-55

  Drechsler, Rolf ^a   Fey, Görschwin ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; INTEGRATED CIRCUITS; NUMERICAL METHODS;

AUTOMATIC TEST PATTERN GENERATION (ATPG); INPUT STIMULI;

PATTERN RECOGNITION;

EID: 33745959970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757283_2     Document Type: Conference Paper

References (46)

1. M.F. Ali, S. Safarpour, A. Veneris, M.S. Abadir, and R. Drechsler. Post-verification debugging of hierarchical designs. In Int'l Conf. on CAD, pages 871-876, 2005.
2. 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, volume 1579 of LNCS, pages 193-207. Springer Verlag, 1999.
3. Boolean Satisfiability Research Group at Princeton University. ZCHAFF, 2004. http://www.princeton.edu/~chaff/zchaff.html.
4. D. Brand. Redundancy and don't cares in logic synthesis. IEEE Trans. on Comp., 32(10):947-952, 1983.
5. M.A. Breuer and A.D. Friedman. Diagnosis & reliable design of digital systems. Computer Science Press, 1976.
6. S.A. Cook. The complexity of theorem proving procedures. In 3. ACM Symposium on Theory of Computing, pages 151-158, 1971.
7. M. Davis, G. Logeman, and D. Loveland. A machine program for theorem proving. Comm. of the ACM, 5:394-397, 1962.
8. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:506-521, 1960.
9. R. Drechsler. Advanced Formal Verification, Kluwer Academic Publishers, 2004.
10. 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.
11. N. Eén and A. Biere. Effective preprocessing in SAT through variable and clause elimination. In SAT 2005, volume 3569 of LNCS. Springer, 2005.
12. N. Eén and N. Sörensson. An extensible SAT solver. In SAT 2003, volume 2919 of LNCS, pages 502-518, 2004.
13. E.B. Eichelberger and T.W. Williams. A logic design structure for LSI testability. In Design Automation Conf., pages 462-468, 1977.
14. 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, 2006.
15. G. Fey, J. Shi, and R. Drechsler. Efficiency of multiple-valued encoding in SAT-based ATPG. In Int'l Symp. on Multi-Valued Logic, 2006.
16. A.D. Friedman. Easily testable iterative systems. In IEEE Trans. on Comp., volume 22, pages 1061-1064, 1973.
17. H. Fujiwara and T. Shimono. On the acceleration of test generation algorithms. IEEE Trans. on Comp., 32:1137-1144, 1983.
18. P. Goel. An implicit enumeration algorithm to generate tests for combinational logic. IEEE Trans. on Comp., 30:215-222, 1981.
19. E. Goldberg and Y. Novikov. BerkMin: a fast and robust SAT-solver. In Design, Automation and Test in Europe, pages 142-149, 2002.
20. E. R. Hsieh, R. A. Rasmussen, L. J. Vidunas, and W. T. Davis. Delay test generation. In Design Automation Conf., pages 486-491, 1977.
21. N. Jha and S. Gupta. Testing of Digital Systems. Cambridge University Press, 2003.
22. H. Jin and F. Somenzi. CirCUs: A hybrid satisfiability solver. In SAT 2004, volume 3542 of LNCS, pages 211-223. Springer Verlag, 2005.
23. K. L. Kodandapani and D. K. Pradhan. Undetectability of bridging faults and validity of stuck-at fault test sets. IEEE Trans. on Comp., C-29(1):55-59, 1980.
24. A. Kuehlmann, V. Paruthi, F. Krohm, and M.K. Ganai. Robust Boolean reasoning for equivalence checking and functional property verification. IEEE Trans. on CAD, 21(12):1377-1394, 2002.
25. W. Kunz. HANNIBAL: An efficient tool for logic verification based on recursive learning. In Int'l Conf. on CAD, pages 538-543, 1993.
26. W. Kunz and D.K. Pradhan. Recursive learning: A new implication technique for efficient solutions of CAD problems: Test, verification and optimization. IEEE Trans. on CAD, 13(9):1143-1158, 1994.
27. T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on CAD, 11:4-15, 1992.
28. H.K. Lee and D.S. Ha. Atalanta: An efficient ATPG for combinational circuits. Technical Report 12, Dep. of Electrical Engineering, Virginia Polytechnic Institute and State University, 1993.
29. J.P. Marques-Silva. The impact of branching heuristics in prepositional satisfiability algorithms. In 9th Portuguese Conference on Artificial Intelligence (EPIA), 1999.
30. J.P. Marques-Silva and K.A. Sakallah. Robust search algorithms for test pattern generation. Technical Report RT/02/97, Dept. of Informatics, Technical University of Lisbon, Lisbon, Protugal, January 1997.
31. J.P. Marques-Silva and K.A. Sakallah. GRASP: A search algorithm for prepositional satisfiability. IEEE Trans. on Comp., 48(5):506-521, 1999.
32. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conf., pages 530-535, 2001.
33. T.M. Niermann and J.H. Patel. HITEC: A test generation package for sequential circuits. In European Conf. on Design Automation, pages 214-218, 1991.
34. J.P. Roth. Diagnosis of automata failures: A calculus and a method. IBM J. Res. Dev., 10:278-281, 1966.
35. M. Schulz, E. Trischler, and T. Sarfert. SOCRATES: A highly efficient automatic test pattern generation system. In Int'l Test Conf., pages 1016-1026, 1987.
36. 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.
37. J. Shi, G. Fey, R. Drechsler, A. Glowatz, F. Hapke, and J. Schlöffel. PASSAT: Effcient SAT-based test pattern generation for industrial circuits. In IEEE Annual Symposium on VLSI, pages 212-217, 2005.
38. J. Shi, G. Fey, R. Drechsler, A. Glowatz, J. Schlöffel, and F. Hapke. Experimental studies on SAT-based test pattern generation for industrial circuits. In Int'l Conf. on ASIC, pages 967-970, 2005.
39. A. Smith, A. Veneris, and A. Viglas. Design diagnosis using Boolean satisfiability. In ASP Design Automation Conf., pages 218-223, 2004.
40. G.L. Smith. Model for delay faults based upon paths. In Int'l Test Conf., pages 342-349, 1985.
41. P. Stephan, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Combinational test generation using satisfiability. IEEE Trans. on CAD, 15:1167-1176, 1996.
42. T. M. Storey and J. W. Barry. Delay test simulation. In Design Automation Conf., pages 492-494, 1977.
43. P. Tafertshofer and A. Ganz. SAT based ATPG using fast justification and propagation in the implication graph. In Int'l Conf. on CAD, pages 139-146, 1999.
44. P. Tafertshofer, A. Ganz, and M. Henftling. A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists. In Int'l Conf. on CAD, pages 648-655, 1997.
45. M. J. Y. Williams and J. B. Angell. Enhancing testability of large-scale integrated circuits via test points and additional logic. IEEE Trans. on Comp., C-22(1):46-60, 1973.
46. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Int'l Conf. on CAD, pages 279-285, 2001.