Using Grid Computing for Constructing Ternary Covering Arrays

To continue at the forefront in this fast paced and competitive world, companies have to be highly adaptable and to suit such transforming needs customized software solutions play a key role. To support this customization, software systems must provide numerous configurable options. While this flexibility promotes customizations, it creates many potential system configurations, which may need extensive quality assurance.

[1]  J. Moscicki.  Distributed analysis environment for HEP and interdisciplinary applications , 2003 .

[2]  Jeff Yu Lei,et al.  IPOG: A General Strategy for T-Way Software Testing , 2007, 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07).

[3]  Angelo Gargantini,et al.  Building T-wise Combinatorial Interaction Test Suites by Means of Grid Computing , 2009, 2009 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises.

[4]  José Torres-Jiménez,et al.  Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach , 2010, COCOA.

[5]  D. Janaki Ram,et al.  Parallel Simulated Annealing Algorithms , 1996, J. Parallel Distributed Comput..

[6]  Yu Lei,et al.  In-parameter-order: a test generation strategy for pairwise testing , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[7]  José Torres-Jiménez,et al.  Computation of Ternary Covering Arrays Using a Grid , 2004, AACC.

[8]  Christian Mazza.  Parallel Simulated Annealing , 1992, Random Struct. Algorithms.

[9]  Alan W. Williams,et al.  Determination of Test Configurations for Pair-Wise Interaction Coverage , 2000, TestCom.

[10]  Charles J. Colbourn,et al.  Binary Covering Arrays and Existentially Closed Graphs , 2009, IWCC.

[11]  D.M. Cohen,et al.  The Combinatorial Design Approach to Automatic Test Generation , 1996, IEEE Softw..

[12]  José Torres-Jiménez,et al.  Verification of General and Cyclic Covering Arrays Using Grid Computing , 2010, Globe.

[13]  C. Colbourn.  Combinatorial aspects of covering arrays , 2006 .

[14]  José Torres-Jiménez,et al.  New bounds for binary covering arrays using simulated annealing , 2012, Inf. Sci..

[15]  Ehl Emile Aarts,et al.  Statistical cooling : a general approach to combinatorial optimization problems , 1985 .

[16]  Aiden A. Bruen,et al.  Error-correcting Codes, Finite Geometries and Cryptography , 2010 .

[17]  Kari J. Nurmela,et al.  Upper bounds for covering arrays by tabu search , 2004, Discret. Appl. Math..

[18]  José Torres-Jiménez,et al.  A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients , 2010, IBERAMIA.

[19]  G. Katona.  Two applications (for search theory and truth functions) of Sperner type theorems , 1973 .

[20]  Robert L. Probert,et al.  A practical strategy for testing pair-wise coverage of network interfaces , 1996, Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering.

[21]  Mir M. Atiqullah,et al.  An Efficient Simple Cooling Schedule for Simulated Annealing , 2004, ICCSA.

[22]  Yu-Wen Tung,et al.  Automating test case generation for the new generation mission software system , 2000, 2000 IEEE Aerospace Conference. Proceedings (Cat. No.00TH8484).

[23]  César Rego,et al.  Subgraph ejection chains and tabu search for the crew scheduling problem , 1999, J. Oper. Res. Soc..

[24]  Yang Jun,et al.  Detailed Analysis of Uphill Moves in Temperature Parallel Simulated Annealing and Enhancement of Exchange Probabilities , 2005, Complex Syst..

[25]  Nor Ashidi Mat Isa,et al.  IRPS - An Efficient Test Data Generation Strategy for Pairwise Testing , 2008, KES.

[26]  Myra B. Cohen,et al.  Augmenting simulated annealing to build interaction test suites , 2003, 14th International Symposium on Software Reliability Engineering, 2003. ISSRE 2003..

[27]  George B. Sherwood.  Optimal and near-optimal mixed covering arrays by column expansion , 2008, Discret. Math..

[28]  David F. Snelling,et al.  UNICORE: uniform access to supercomputing as an element of electronic commerce , 1999, Future Gener. Comput. Syst..

[29]  A. Rényi,et al.  Foundations of probability , 1970 .

[30]  Ian Foster,et al.  The Globus toolkit , 1998 .

[31]  B. Stevens,et al.  Covering arrays with mixed alphabet sizes , 2003 .

[32]  David De Roure,et al.  Experiences with GRIA - Industrial Applications on a Web Services Grid , 2005, e-Science.

[33]  Charles J. Colbourn,et al.  The density algorithm for pairwise interaction testing , 2007, Softw. Test. Verification Reliab..

[34]  K. A. Bush.  Orthogonal Arrays of Index Unity , 1952 .

[35]  Charles J. Colbourn,et al.  A recursive construction for perfect hash families , 2009, J. Math. Cryptol..

[36]  Dennis Shasha,et al.  Products of mixed covering arrays of strength two , 2006 .

[37]  Tatsuhiro Tsuchiya,et al.  Using artificial life techniques to generate test cases for combinatorial testing , 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004..

[38]  Hülya Bayrak,et al.  ON THE CONSTRUCTION OF ORTHOGONAL ARRAYS , 2001 .

[39]  Johannes Elmsheuser,et al.  Ganga: A tool for computational-task management and easy access to Grid resources , 2009, Comput. Phys. Commun..

[40]  Joel H. Spencer,et al.  Families of k-independent sets , 1973, Discret. Math..