Advertisement

Pseudo-Exhaustive Testing Based on March Tests

  • Ireneusz Mrozek
Chapter

Abstract

The chapter deeply analyzes the pseudo-exhaustive tests based on march tests. The main advantage of pseudo-exhaustive testing is its high fault coverage and lower complexity compared with exhaustive testing. The investigation is based on the idea of orbits defined as sets of patterns received as a result of the run of march tests with one read and one write operation. The problem of pseudo-exhaustive tests based on multi-run memory testing with background changing and/or address order variation is regarded as the coupon-collector’s problem which is a classical problem in combinatorial probability. Finally, the complexity of pseudo-exhaustive tests formed on the reordering of address sequences and tests based on background changing is compared.

References

  1. 28.
    Flajolet, P., Gardy, D., and Thimonier, L. Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Applied Mathematics 39, 3 (Nov. 1992), 207–229.MathSciNetCrossRefGoogle Scholar
  2. 42.
    Karpovsky, M. G., Goor, A. J. v. d., and Yarmolik, V. N. Pseudo-exhaustive word-oriented DRAM testing. In Proceedings of the European conference on Design and Test (Washington, DC, USA, 1995), EDTC’95, IEEE Computer Society, p. 126.Google Scholar
  3. 43.
    Karpovsky, M. G., and Yarmolik, V. N. Transparent memory testing for pattern-sensitive faults. In Proceedings of the IEEE International Test Conference on TEST: The Next 25 Years (1994), ITC’94, IEEE Computer Society, pp. 860–869.Google Scholar
  4. 48.
    Levitin, L. B., and Karpovsky, M. G. Exhaustive testing of almost all devices with outputs depending on limited number of inputs. Open Systems & Information Dynamics 2, 3 (Oct. 1994), 303–318.CrossRefGoogle Scholar
  5. 64.
    Mrozek, I., and Yarmolik, V. Two-run RAM march testing with address decimation. Journal of Circuits, Systems, and Computers 26, 2 (2017), 1750031.CrossRefGoogle Scholar
  6. 65.
    Mrozek, I., and Yarmolik, V. N. Antirandom test vectors for BIST in hardware/software systems. Fundamenta Informaticae 119, 2 (2012), 163–185.Google Scholar
  7. 71.
    Niggemeyer, D., Otterstedt, J., and Redeker, M. Detection of non classical memory faults using degrees of freedom in march testing. In Proceedings of the 11th IEEE International Workshop on Memory Technology, Design and Testing (Potsdam, 1999), pp. 111–119.Google Scholar
  8. 73.
    Pandey, P., and Kapse, V. A BIST circuit for fault detection using pseudo exhaustive two pattern generator. International Journal of Engineering Research & Technology 1, 5 (July 2012), 380–385.Google Scholar
  9. 81.
    Sokol, B., Mrozek, I., and Yarmolik, V. N. Impact of the address changing on the detection of pattern sensitive faults. Information Processing and Security Systems (2005), 217–255.Google Scholar
  10. 83.
    Sokol, B., and Yarmolik, V. N. Wpływ zmian porz ądku adresów i zawartości na efektywność testów pamieci. In Materiały konferencyjne V Krajowej Konferencji Naukowej ,,Reprogramowalne Układy Cyfrowe” (Szczecin, 13–14 maja 2004), RUC’04, pp. 163–171.Google Scholar
  11. 93.
    van de Goor, A. J. Testing Semiconductor Memories: Theory and Practice. John Wiley & Sons, Chichester, England, 1991.Google Scholar
  12. 100.
    Voyiatzis, I., Gizopoulos, D., and Paschalis, A. M. Recursive pseudo-exhaustive two-pattern generation. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 18, 1 (2010), 142–152.CrossRefGoogle Scholar
  13. 108.
    Yarmolik, S. Address sequences and backgrounds with different hamming distances for multiple run march tests. International Journal of Applied Mathematics and Computer Science 18, 3 (2008), 329–339.CrossRefGoogle Scholar
  14. 110.
    Yarmolik, S. V., and Mrozek, I. Multi background memory testing. In Proceedings of the 14 th International Conference Mixed design of integrated circuits and systems (Ciechocinek, Poland, June 2007), MIXDES’07, IEEE Computer Society, pp. 511–516.Google Scholar
  15. 114.
    Yarmolik, V., Mrozek, I., and Levancevich, W. Psevdoyscerpyvajusee testirovaniye OZU (in Russian). Informatika, 5 (2017), 58–69.Google Scholar
  16. 116.
    Yarmolik, V., and Yarmolik, S. Address sequences for multiple run march tests. Automatic Control and Computer Sciences, 5 (2006), 59–68.zbMATHGoogle Scholar
  17. 117.
    Yarmolik, V., and Yarmolik, S. The repeated nondestructive march tests with variable address sequences. Automation and Remote Control 68, 4 (2007), 688–698.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2019

Authors and Affiliations

  • Ireneusz Mrozek
    • 1
  1. 1.Bialystok University of TechnologyBialystokPoland

Personalised recommendations