Skip to main content

Advertisement

SpringerLink
Log in

Construction of t-way covering arrays using genetic algorithm

  • Original Article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

In a component based system, interaction among components may give rise to interaction faults. Faults can be caused by the interactions of two or more than two components. Since, it is not feasible to test all possible interactions combinatorial interaction testing is being employed to generate covering arrays (CAs) that covers all t-way interactions between components. In this paper, we generalize our previous work, that uses a greedy based genetic algorithm, to generate CA from 2-way to t-way testing (2 ≤ t ≤ 4). We implement the proposed strategy by extending an open source tool PWiseGen. The main drawback of PWiseGen is the need to input the size of CA in advance. To overcome this restriction of PWiseGen, we propose a variation of binary search algorithm that generates optimal CA without knowing its size in advance. Experiments are conducted to evaluate the effectiveness of the proposed approach and it has been observed that the proposed approach performs well as compared to existing state-of-the-art algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. J. Arshem, TVG download page, 2009. http://sourceforge.net/projects/tvg.

References

  • Ahmed BS, Zamli KZ (2011) The development of a particle swarm based optimization strategy for pairwise testing. J Artif Intell 4:156–165

    Article  Google Scholar 

  • Ahmed BS, Zamli KZ, Lim CP (2012) Application of particle swarm optimization to uniform and variable strength covering array construction. Appl Soft Comput 12:1330–1347

    Article  Google Scholar 

  • Avila-George H, Torres-Jimenez J, Hernández V, Gonzalez-Hernandez L (2012) Simulated annealing for constructing mixed covering arrays. In: Proceedings of the 9th international symposium on distributed computing and artificial intelligence—DCAI, ser. Adv Intell Soft Comput, vol 151. Springer, Berlin, pp. 657–664

  • Bansal P, Sabharwal S, Malik S, Arora V, Kumar V (2013) An approach to test set generation for pair-wise testing using genetic algorithms. In: Ruhe G, Zhang Y (eds) SSBSE 2103, LNCS 8084. Springer, Berlin, Heidelberg, pp 294–299

    Google Scholar 

  • Bansal P, Mittal N, Sabharwal A, Koul S (2014), Integrating greedy based approach with genetic algorithm to generate mixed covering arrays for pair-wise testing. In: The seventh international conference on contemporary computing, Noida

  • Bryce RC, Colbourn CJ (2007) The density algorithm for pairwise interaction testing. Softw Test Verif Reliab 17:3159–3182

    Article  Google Scholar 

  • Bryce RC, Sampath S, Pedersen J, Manchester S (2011) Test suite prioritization by cost-based combinatorial interaction coverage. Int J Syst Assur Eng Manag 2(2):126–134

    Article  Google Scholar 

  • Burr K, Young W (1998) Combinatorial test techniques: table-based automation, test generation and code coverage. In: Proceedings of the international conference on software testing analysis and review, San Diego

  • Bush KA (1952) Orthogonal arrays of index unity. Ann Math Stat 23(3):426–434

    Article  MathSciNet  MATH  Google Scholar 

  • Cohen DM, Dalal SR, Kajla A, Patton GC (1994) The automatic efficient test generator. In: Proceedings of the IEEE international symposium on software reliability engineering, pp 303–309

  • Cohen DM, Dalal SR, Fredman ML, Patton GC (1996) The combinatorial design approach to automatic test generation. In: IEEE software, pp 83–87

  • Cohen DM, Dalal SR, Fredman ML, Patton GC (1997) The AETG system: an approach to testing based on combinatorial design. IEEE Trans Softw Eng 23(7):437–443

    Article  Google Scholar 

  • Cohen MB, Colbourn CJ, Gibbons PB, Mugridge WB (2003) Constructing test suites for interaction testing. In: Proceedings of the international conference on software engineering. Portland, pp 38–48

  • Czerwonka J (2006) Pairwise testing in real world: practical extension to test case generator. In: 24th pacific Northwest software quality conference, IEEE computer society. Portland, pp 419–430

  • Dalal SR, Jain A, Karunanithi N, Leaton JM, Lott CM, Patton GC, Horowitz BM (1999) Model-based testing in practice. In Proceedings of the international conference on software engineering, (ICSE’99). New York, pp 285–94

  • Deep K, Das KN (2013) A novel hybrid genetic algorithm for constrained optimization. Int J Syst Assur Eng Manag 4(1):86–93

    Article  MATH  Google Scholar 

  • Flores P (2010) PWiseGen. https://code.google.com/p/pwisegen/. Accessed 05 Jan 2013

  • Flores P, Cheon Y (2011) PWiseGen: Generating test cases for pairwise testing using genetic algorithms. In: IEEE international conference on computer science and automation engineering (CSAE), vol 2, pp 747–752

  • Garvin BJ, Cohen MB, Dwyer MB (2011) Evaluating improvements to a meta-heuristic search for constrained interaction testing. Empir Softw Eng 16:61–102

    Article  Google Scholar 

  • Ghazi SA, Ahmed MA (2003) Pair-wise test coverage using genetic algorithms. In: The 2003 congress on evolutionary computation, vol 2. IEEE Computer Society, Australia, pp 1420–1423

  • Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  • Gonzalez-Hernandez L, Rangel-Valdez N, Torres-Jimenez J (2012) Construction of mixed covering arrays of strengths 2 through 6 using a Tabu Search approach. Discrete Math Algorithms Appl 4:1–20

    Article  MathSciNet  MATH  Google Scholar 

  • Hartman A (2005) Software and hardware testing using combinatorial covering suites. In: Graph theory, combinatorics and algorithms, operations research/computer science interfaces series, vol 34. Springer, pp 237–266

  • Hedayat A, Sloane N, Stufken J (1999) Orthogonal arrays. Springer, New York

    Book  MATH  Google Scholar 

  • Jenkins B (2005) Jenny download web page, Bob Jenkin’s website. http://burtleburtle.net/bob/math/jenny.html. Accessed 14 Aug 2013

  • Kuhn R (2009) ACTS Home Page. http://csrc.nist.gov/acts/

  • Kuhn DR, Reilly MJ (2002) An investigation of the applicability of design of experiments to software testing. In Proceedings of 27th NASA/IEEE software engineering workshop, Greenbelt, pp 91–95

  • Kuhn R, Wallace D, Gallo A (2004) Software fault interactions and implications for software testing. IEEE Trans Softw Eng 30(6):418–421

    Article  Google Scholar 

  • Lei Y, Tai KC (1998) In-parameter-order: a test generation strategy for pairwise testing. In: 3rd IEEE international symposium on high-assurance systems engineering, Washington, pp 254–261

  • Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2007) IPOG: a general strategy for t-way software testing. In: Proceedings of the 14th annual IEEE international conference and work-shops on the engineering of computer-based systems-ECBS, Tuscon, IEEE computer society, pp 549–556

  • Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2008) IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing. Softw Test Verif Reliab 18(3):125–148

    Article  Google Scholar 

  • Mandl R (1985) Orthogonal latin squares: an application of experiment design to compiler testing. Commun ACM 28(10):1054–1058

    Article  Google Scholar 

  • McCaffrey JD (2009) Generation of pairwise test sets using a genetic algorithm. In: Proceedings of 33rd annual IEEE international computer software and applications conference. IEEE Press, Los Alamitos, pp 626–631

  • McCaffrey JD (2010) An empirical study of pairwise test set generation using a genetic algorithm. In: ITNG 2010: 6th International conference on information technology: new generations. IEEE computer society, Las Vegas, pp 992–997

  • Nie C, Leung H (2011) A survey of combinatorial testing. ACM Comput Surv (CSUR) 43(2):1–29

    Article  MATH  Google Scholar 

  • Nurmela KJ (2004) Upper bounds for covering arrays by tabu search. Discrete Appl Math 138(1-2):143–152

    Article  MathSciNet  MATH  Google Scholar 

  • Seroussi G, Bshouty N (1988) Vector sets for exhaustive testing of logical circuits. IEEE Trans Inf Theory 34:513–522

    Article  MATH  Google Scholar 

  • Shiba T, Tsuchiya T, Kikuno T (2004) Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th annual international computer software and applications conference. IEEE Computer Society, pp 72–77

  • Stardom J (2001) Meta-heuristic and the search for covering and packing arrays. Master’s Thesis, Simon Fraser University

  • Walker RA II, Colbourn CJ (2009) Tabu Search for covering arrays using permutation vectors. J Stat Plan Inference 139(1):69–80

    Article  MathSciNet  MATH  Google Scholar 

  • Williams AW (2000). Determination of test configurations for pair-wise interaction coverage. In: Proceedings of 13th international conference on the testing of communicating systems. Ottawa, pp 59–74

  • Yalan L, Nie C, Kauffman JM, Kapfhammer GM, Leung H (2011) Empirically identifying the best genetic algorithm for covering array generation. In: Proceedings of the third international symposium on search based software engineering, fast abstract track, Szeged

  • Younis MI, Zamli KZ, Klaib MFJ, Soh ZHC, Abdullah SAC, Isa NAM (2010) Assessing IRPS as an efficient pairwise test data generation strategy. Int J Adv Intell Paradig 2(1):90–104

    Article  Google Scholar 

  • Yuan X, Cohen MB, Memon A (2007). Covering array sampling of input event sequences for automated GUI testing. In: Proceedings of the 22nd international conference on automated software engineering, pp 405–408

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Netaji Subhas Institute of Technology, Sector-3, Dwarka, 110078, New Delhi, India

    Sangeeta Sabharwal & Priti Bansal

  2. Department of Computer Engineering, Netaji Subhas Institute of Technology, Sector-3, Dwarka, 110078, New Delhi, India

    Nitish Mittal

Authors
  1. Sangeeta Sabharwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Priti Bansal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nitish Mittal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Priti Bansal.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sabharwal, S., Bansal, P. & Mittal, N. Construction of t-way covering arrays using genetic algorithm. Int J Syst Assur Eng Manag 8, 264–274 (2017). https://doi.org/10.1007/s13198-016-0430-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-016-0430-6

Keywords

Search

Navigation