Multiple Controlled Random Testing

• Autorzy: Mrozek I. , Yarmolik V.

Identyfikatory

DOI

10.3233/FI-2016-1322

• Języki publikacji: EN

Abstrakty

EN

Controlled random tests, methods of their generation, as well as their application to the testing of both hardware and software systems are discussed. Available evidences suggest that high computational complexity is one of the main drawback of these methods. Therefore we propose a technique to overcome this problem. In the paper, we introduce the concept of multiple controlled random tests (MCRT) and examine various numerical characteristics in terms of the development of those tests. We prove the effectiveness of the Euclidean distance, as well as we propose an easy computational method of its calculation, in the process of constructing MCRT. The presented approach is evaluated through the experimental study in the context of testing of Random Access Memory (RAM).

Słowa kluczowe

EN

antirandom tests; controlled random tests; multiple tests; RAM testing

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2016
• Tom: Vol. 144, nr 1
• Strony: 23--43
• Opis fizyczny: Bibliogr. 34 poz., tab., wykr.

Twórcy

autor

Mrozek I.

• Faculty of Computer Science, Bialystok University of Technology, Wiejska 45A, 15-351 Bialystok, Poland

autor

Yarmolik V.

• Faculty of Computer Science, Bialystok University of Technology, Wiejska 45A, 15-351 Bialystok, Poland

Bibliografia

• [1] Anand S, Burke EK, Chen TY, Clark J, Cohen MB, Grieskamp W, et al. An Orchestrated Survey of Methodologies for Automated Software Test Case Generation. J Syst Softw. 2013 Aug;86(8):1978–2001. ISSN: 0164-1212. Available from: http://dx.doi.org/10.1016/j.jss.2013.02.061. doi:10.1016/j.jss.2013.02.061.
• [2] Chen TY, Merkel RG. Quasi-Random Testing. IEEE Transactions on Reliability. 2007;56(3):562–568. ISSN: 0018-9529. doi:10.1109/TR.2007.903293. Available from: http://www.scopus.com/inward/record.url?eid=2-s2.0-34548652643&partnerID=MN8TOARS.
• [3] Junpeng L, Hai H, Kai-Yuan C, Chen TY. Adaptive and Random Partition Software Testing. IEEE T Systems, Man, and Cybernetics: Systems. 2014;44(12):1649–1664. ISSN: 2168-2216. doi:10.1109/TSMC.2014.2318019.
• [4] Malaiya YK, Yang S. The Coverage Problem for Random Testing. In: Proceedings of the 1994 IEEE International Test Conference. ITC ’84; 1984. p. 237–245. Available from: http://www.cs.colostate.edu/~malaiya/p/random.pdf.
• [5] Shahbazi A, Tappenden AF, Miller J. Centroidal Voronoi Tessellations – A New Approach to Random Testing. IEEE Transactions on Software Engineering. 2013;39(2):163–183. doi:10.1109/TSE.2012.18.
• [6] Sosnowski J, Wabia T, Bech T. Path Delay Fault Testability Analysis. In: 15th IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2000), 25-27 October 2000, Yamanashi, Japan, Proceedings; 2000. p. 338. ISSN: 1063-6722. doi:10.1109/DFTVS.2000.887174.
• [7] Yarmolik SV, Yarmolik VN. Controlled random tests. Automation and Remote Control. 2012;73(10):1704–1714. ISSN: 0005-1179. doi:10.1134/S0005117912100104.
• [8] Kuo FC. An Indepth Study of Mirror Adaptive Random Testing. In: Choi B, editor. Proceedings of the Ninth International Conference on Quality Software, QSIC 2009, Jeju, Korea, August 24-25, 2009. IEEE Computer Society; 2009. p. 51–58. Available from: http://dx.doi.org/10.1109/QSIC.2009.15. doi:10.1109/QSIC.2009.15.
• [9] Tappenden AF, Miller J. A Novel Evolutionary Approach for Adaptive Random Testing. IEEE Transactions on Reliability. 2009 Dec;58(4):619–633. ISSN: 0018-9529. doi:10.1109/TR.2009.2034288.
• [10] Wu SH, Jandhyala S, Malaiya YK, Jayasumana AP. Antirandom testing: a distance-based approach. VLSI Design. 2008 January; 2008:1–2. Available from: http://dx.doi.org/10.1155/2008/165709. doi:10.1155/2008/165709.
• [11] Xu S. Orderly Random Testing for Both Hardware and Software. In: Proceedings of the 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing. Washington, DC, USA: IEEE Computer Society; 2008. p. 160–167. ISBN: 978-0-7695-3448-0. doi:10.1109/PRDC.2008.7.
• [12] Zhou ZQ. Using Coverage Information to Guide Test Case Selection in Adaptive Random Testing. Computer Software and Applications Conference Workshops. 2010;0:208–213. ISBN: 978-1-4244-8089-0. doi:10.1109/COMPSACW.2010.43.
• [13] Malaiya YK. Antirandom Testing: Getting The Most Out Of Black-Box Testing. In: Proceedings of 6th IEEE International Symposium on Software Reliability Engineering. ISSRE ’95. IEEE Computer Society; 1995. p. 86–95. Available from: http://www.cs.colostate.edu. doi:10.1109/ISSRE.1995.497647.
• [14] Mrozek I, Yarmolik VN. Iterative Antirandom Testing. J Electron Test. 2012 Jun;28(3):301–315. Available from: http://dx.doi.org/10.1007/s10836-011-5272-1. doi:10.1007/s10836-011-5272-1.
• [15] Das D, Karpovsky MG. Exhaustive and Near-Exhaustive Memory Testing Techniques and their BIST Implementations. Journal of Electronic Testing. 1997;10(3):215–229. Available from: http://dx.doi.org/10.1023/A:1008215624768. doi:10.1023/A:1008215624768.
• [16] Perrouin G, Sen S, Klein J, Baudry B, le Traon Y. Automated and Scalable T-wise Test Case Generation Strategies for Software Product Lines. In: Proceedings of the 2010 Third International Conference on Software Testing, Verification and Validation. ICST ’10. Washington, DC, USA: IEEE Computer Society; 2010. p. 459–468. ISBN: 978-0-7695-3990-4. Available from: http://dx.doi.org/10.1109/ICST.2010.43. doi:10.1109/ICST.2010.43.
• [17] Segall I, Tzoref-Brill R, Farchi E. Using Binary Decision Diagrams for Combinatorial Test Design. In: Proceedings of the 2011 International Symposium on Software Testing and Analysis. ISSTA ’11. New York, NY, USA: ACM; 2011. p. 254–264. ISBN:978-1-4503-0562-4. Available from: http://doi.acm.org/10.1145/2001420.2001451. doi:10.1145/2001420.2001451.
• [18] Yarmolik SV. Iterative Near Pseudoexhaustive Random Testing. Informatics. 2010;2(26):66–75.
• [19] Yarmolik SN, Yarmolik VN. The synthesis of probability tests with a small number of kits. Automatic Control and Computer Sciences. 2011; 45(3):133–141. doi:10.3103/S0146411611030072.
• [20] Yarmolik SV, Yarmolik VN. Quasi-random testing of computer systems. Informatics. 2013;3(39):92–103.
• [21] Nicolaidis M. Transparent BIST for RAMs. In: Proceedings IEEE. International Test Conference 1992, Discover the New World of Test and Design, Baltimore, Maryland, USA, September 20-24, 1992. IEEE Computer Society; 1992. p. 598–607. ISBN: 0-7803-0760-7. Available from: http://dl.acm.org/citation.cfm?id=648014.745406.
• [22] Karpovsky MG, van de Goor AJ, Yarmolik VN. Pseudo-exhaustive word-oriented DRAM testing. In: Proceedings of the 1995 European Conference on Design and Test. EDTC ’95. Washington, DC, USA: IEEE Computer Society; 1995. p. 126. Available from: http://doi.ieeecomputersociety.org/10.1109/EDTC.1995.470409. doi:10.1109/EDTC.1995.470409.
• [23] Yarmolik S. Address sequences and backgrounds with different Hamming distances for multiple run March tests. International Journal of Applied Mathematics and Computer Science. 2008;18(3):329–339. doi:10.2478/v10006-008-0030-y.
• [24] Yarmolik VN, Yarmolik SV. Address sequences. Automatic Control and Computer Sciences. 2014;48(4): 207–213. Available from: http://dx.doi.org/10.3103/S0146411614040099. doi:10.3103/S0146411614040099.
• [25] Mrozek I, Yarmolik VN. Antirandom Test Vectors for BIST in Hardware/Software Systems. Fundam Inform. 2012;119(2):163–185. ISSN: 0169-2968. Available from: http://dblp.uni-trier.de/db/journals/fuin/fuin119.html#MrozekY12. doi:10.3233/FI-2012-732.
• [26] Breu H, Gil J, Kirkpatrick D, Werman M. Linear Time Euclidean Distance Transform Algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence. 1995;17(5):529–533. ISSN: 0162-8828. doi:10.1109/34.391389.
• [27] Yarmolik SV, Zankovich AP, Ivanyuk AA. Marshevye testy dlya samotestirovaniya OZU (March Tests for RAM Self-testing). Minsk: Beloruss. Gos. Univ.; 2009.
• [28] Sahari MS, Aain AK, Grout IA. Scalable Antirandom Testing (SAT). International Journal of Innovative Science and Modern Engineering (IJISME). 2015;3(4):33–35. ISSN: 2319-6386.
• [29] Chen TY, Leung H, Mak IK. Adaptive Random Testing. In: Proceedings of the 9th Asian Computing Science Conference. Dedicated to Jean-Louis Lassez on the Occasion of His 5th Birthday. Chiang Mai, Thailand, December 8-10, 2004. ASIAN’04; 2004. p. 320–329. ISBN: 978-3-540-30502-6. Available from: http://dx.doi.org/10.1007/978-3-540-30502-6_23. doi:10.1007/978-3-540-30502-6 23.
• [30] Chen TY, Kuo FC, Merkel RG, Tse TH. Adaptive Random Testing: The ART of test case diversity. Journal of Systems and Software. 2010 January;83:60–66. ISSN: 0164-1212. Available from: http://www.sciencedirect.com/science/article/pii/S0164121209000405. doi:10.1016/j.jss.2009.02.022.
• [31] Yiunn DBY, A’ain AKB, Khor JG. Scalable test pattern generation (STPG). In: Proceedings of the Industrial Electronics Applications (ISIEA), 2010 IEEE Symposium on. ISIEA ’2010; 2010. p. 433–435. ISBN: 978-1-4244-7645-9. Available from: http://dx.doi.org/10.1109/ISIEA.2010.5679428. doi:10.1109/ISIEA.2010.5679428.
• [32] Mrozek I. Analysis of multibackground memory testing techniques. International Journal of Applied Mathematics and Computer Science. 2010 Mar; 20(1):191–205. doi:10.2478/v10006-010-0014-6.
• [33] Mrozek I, Yarmolik S. Analyses of two run march tests with address decimation for BIST procedure. In: EWDTS. IEEE; 2013. p. 1–4. Available from: http://dx.doi.org/10.1109/EWDTS.2013.6673190. doi:10.1109/EWDTS.2013.6673190.
• [34] Yarmolik VN, Yarmolik SV. The repeated nondestructive march tests with variable address sequences. Automation and Remote Control. 2007;68(4):688–698. Available from: http://dx.doi.org/10.1134/S000511790704011X. doi:10.1134/S000511790704011X.