skip to main content
research-article

Symbolic-Event-Propagation-Based Minimal Test Set Generation for Robust Path Delay Faults

Published:01 October 2012Publication History
Skip Abstract Section

Abstract

We present a symbolic-event-propagation-based scheme to generate hazard-free tests for robust path delay faults. This approach identifies all robustly testable paths in a circuit and the corresponding complete set of test vectors. We address the problem of finding a minimal set of test vectors that covers all robustly testable paths. We propose greedy and simulated-annealing-based algorithms to find the same. Results on ISCAS89 benchmark circuits show a considerable reduction in test vectors for covering all robustly testable paths.

References

  1. Bhattacharya, D., Agrawal, P., and Agrawal, V. 1995. Test generation for path delay faults using binary decision diagrams. IEEE Trans. Comput. 44, 3, 434--447. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Chakraborty, D., Chakrabarti, P. P., Mondal, A., and Dasgupta, P. 2006. A framework for estimating peak power in gate level circuits. In Proceedings of the Conference on Power and Timing Modeling, Optimization and Simulation (PATMOS). 573--582. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Chen, H.-C. and Du, D. H. C. 1993. Path sensitization in critical path problem. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 12, 2, 196--207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. EggersgluB, S., Fey, G., Drechsler, R., Glowatz, A., Hapke, F., and Schloeffel, J. 2007. Combining multi-valued logics in sat-based atpg for path delay faults. In Proceedings of the 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign. 181--187. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Fuchs, K., Wittmann, H., and Antreich, K. 1993. Fast test pattern generation for all path delay faults consideringvarious test classes. In Proceedings of the 3rd European Test Conference. 89--98.Google ScholarGoogle Scholar
  6. Fuchs, K., Pabst, M., and Rössel, T. 1994. RESIST: A recursive test pattern generation algorithm for path delay faults. In Proceedings of the Conference on European Design Automation. IEEE Computer Society Press, 316--321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Gharaybeh, M., Bushnell, M., and Agrawal, V. 1997. Classification and test generation for path-delay faults using single struck-at fault tests. J. Electron. Test. Theory Appl. 11, 1, 55--67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Huh, K., Kang, Y., and Kang, S. 2003. Efficient path delay testing using scan justification. Electron. Telecomm. Res. Instit. J. 25, 3, 187.Google ScholarGoogle Scholar
  9. Jayaraman, D., Flanigan, E., and Tragoudas, S. 2008. Implicit identification of non-robustly unsensitizable paths using bounded delay model. In IEEE International Test Conference (ITC). 1--10.Google ScholarGoogle Scholar
  10. Kim, J., Whittemore, J., Marques-Silva, J., and Sakallah, K. 2000. On applying incremental satisfiability to delay fault testing. In Proceedings of the Conference on Design, Automation and Test in Europe. 380--384. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Leiserson, C., Rivest, R., Cormen, T., and Stein, C. 2001. Introduction to Algorithms. McGraw-Hill. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. McGeer, P., Saldanha, A., Stephan, P., Brayton, R., and Sangiovanni-Vincentelli, A. 1991. Timing analysis and delay-fault test generation using path-recursive functions. In Proceedings of the IEEE International Conference on Computer-Aided Design. 180--183.Google ScholarGoogle Scholar
  13. Mondal, A. and Chakrabarti, P. P. 2006. Reasoning about timing behavior of digital circuits using symbolic event propagation and temporal logic. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 25, 9, 1793--1814. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Pomeranz, I. and Reddy, S. M. 1998. Delay fault models for VLSI circuits. J. VLSI Integr. 26, 1--2, 21--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Roy, S., Chakrabarti, P. P., and Dasgupta, P. 2007. Event propagation for accurate circuit delay calculation using SAT. ACM Trans. Des. Autom. Electron. Syst. 12, 3, 36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Rudell, R. and Sangiovanni-Vincentelli, A. 1987. Multiple-Valued minimization for PLA optimization. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 6, 5, 727--750. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Saldanha, A., Brayton, R. K., and Sangiovanni-Vincentelli, A. L. 1992. Equivalence of robust delay-fault and single stuck-fault test generation. In Proceedings of the 29th ACM/IEEE Conference on Design Automation. 173--176. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Schulz, M., Fuchs, K., and Fink, F. 1989. Advanced automatic test pattern generation techniques for pathdelay faults. In Proceedings of the International Symposium on Fault-Tolerant Computing. 44--51.Google ScholarGoogle Scholar
  19. Somenzi, F. 2005. CUDD: CU Decision Diagram Package, Release 2.4.1, User’s Manual. http://vlsi.colorado.edu/~fabio/CUDD/.Google ScholarGoogle Scholar

Index Terms

  1. Symbolic-Event-Propagation-Based Minimal Test Set Generation for Robust Path Delay Faults

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Design Automation of Electronic Systems
          ACM Transactions on Design Automation of Electronic Systems  Volume 17, Issue 4
          October 2012
          347 pages
          ISSN:1084-4309
          EISSN:1557-7309
          DOI:10.1145/2348839
          Issue’s Table of Contents

          Copyright © 2012 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 October 2012
          • Accepted: 1 January 2012
          • Revised: 1 June 2011
          • Received: 1 February 2009
          Published in todaes Volume 17, Issue 4

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader