T-Tuple Reallocation: An Algorithm to Create Mixed-Level Covering Arrays to Support Software Test Case Generation

详细信息    查看全文

• 刊名：Lecture Notes in Computer Science
• 出版年：2015
• 出版时间：2015
• 年：2015
• 卷：9158
• 期：1
• 页码：503-517
• 全文大小：303 KB
• 参考文献：1. Bracho-Rios, J., Torres-Jimenez, J., Rodriguez-Tello, E.: A new backtracking algorithm for constructing binary covering arrays of variable strength. In: Aguirre, A.H., Borja, R.M., Garci谩, C.A.R. (eds.) MICAI 2009. LNCS, vol. 5845, pp. 397鈥?07. Springer, Heidelberg (2009) View Article
  2.Cohen, M.B., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J.: Constructing test suites for interaction testing. In: Proceedings of the 25th International Conference on Software Engineering, May 3鈥?0, 2003, Portland, Oregon, USA, pp. 38鈥?8 (2003)
  3.Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. Journal of Research of the National Institute of Standards and Technology 113(5), 287鈥?97 (2008)View Article
  4. Gonzalez-Hernandez, L., Rangel-Valdez, N., Torres-Jimenez, J.: Construction of mixed covering arrays of variable strength using a tabu search approach. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol. 6508, pp. 51鈥?4. Springer, Heidelberg (2010) View Article
  5.Jenkins, B.: jenny: a pairwise testing tool (2005). http://鈥媌urtleburtle.鈥媙et/鈥媌ob/鈥媘ath/鈥媕enny.鈥媓tml.鈥?/span> (accessed February 20, 2015)
  6.Kuhn, D.R., Wallace, D.R., Gallo, A.M.: Software fault interactions and implications for software testing. IEEE Trans. Software Eng. 30(6), 418鈥?21 (2004)View Article
  7.Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: a general strategy for t-way software testing. In: Proceedings of the Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS), pp. 549鈥?56. IEEE Computer Society, Washington, DC (2007)
  8.Lei, Y., Tai, K.-C.: In-parameter-order: a test generation strategy for pairwise testing. In: Proceedings of the IEEE International Symposium on High-Assurance Systems Engineering (HASE), pp. 254鈥?61. IEEE Computer Society, Washington, DC (1998)
  9. Lopez-Escogido, D., Torres-Jimenez, J., Rodriguez-Tello, E., Rangel-Valdez, N.: Strength two covering arrays construction using a SAT representation. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 44鈥?3. Springer, Heidelberg (2008) View Article
  10.Mathur, A.P.: Foundations of software testing, 689 p. Dorling Kindersley (India), Pearson Education in South Asia, Delhi, India (2008)
  11.Myers, G.J.: The art of software testing, 2nd edn., 234 p. John Wiley & Sons, Hoboken (2004)
  12.Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics 138, 143鈥?52 (2004)MATH MathSciNet View Article
  13.Santiago, V., Silva, W.P., Vijaykumar, N.L.: Shortening test case execution time for embedded software. In: Proceedings of the 2nd IEEE International Conference SSIRI, pp. 81鈥?8 (2008)
  14.Santiago J煤nior, V.A., Vijaykumar, N.L.: Generating model-based test cases from natural language requirements for space application software. Software Quality Journal 20(1), 77鈥?43 (2012). doi:10.鈥?007/鈥媠11219-011-9155-6 View Article
  15.Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques to generatetest cases for combinatorial testing. In: Proceedings of 28th Annual International Computer Software and Applications Conference (COMPSAC 2004), pp. 1鈥? (2004)
  16.Williams, A.W.: Determination of test configurations for pair-wise interaction coverage. In: Ural, H., Probert, R.L., Bochmann, G.V. (eds.) Testing of Communicating Systems. IFIP AICT, pp. 59鈥?4. Springer, Heidelberg (2000)View Article
  
• 作者单位：Juliana Marino Balera (21)
  Valdivino Alexandre de Santiago J煤nior (21)
  
  21. Instituto Nacional de Pesquisas Espaciais (INPE), Av. dos Astronautas, 1758 S茫o Jos茅 dos Campos, S茫o Paulo, Brazil
  
• 丛书名：Computational Science and Its Applications -- ICCSA 2015
• ISBN：978-3-319-21410-8
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

A fact that is known both by researchers and by industry professionals is that exhaustive software testing is impractical. Therefore, one of the most studied activities of software testing process is the generation/selection of test cases. However, selecting test cases that reveal the greatest number of defects within a software is a challenging task, due to the significantly high amount of entries that the system can receive, and even due to the different characteristics of software products in several application domains. This work presents a new algorithm, called T-Tuple Reallocation (TTR), to generate Mixed-Level Covering Array (MCA) which is one of the techniques of combinatorial designs that aims at test case generation. After studying various algorithms/techniques to generate combinatorial designs, starting with pairwise design, TTR was proposed aiming at decreasing the amount of test cases produced to test a software product. The new algorithm was able to create shorter sets of test cases in comparison with classical algorithms/tools proposed in the literature. Although TTR, in general, demanded longer time to generate the sets of test cases, this rise in time can be compensated by a smaller number of test cases so that less time is required for executing them. In the end, this may imply less time for accomplishing the testing process as a whole.