scholarly journals A Review of Covering Arrays and Their Application to Software Testing

2011 ◽  
Vol 7 (9) ◽  
pp. 1375-1385 ◽  
Author(s):  
Ahmed
Author(s):  
Jose Torres-Jimenez ◽  
Himer Avila-George ◽  
Ezra Federico Parra-González

Software testing is an essential activity to ensure the quality of software systems. Combinatorial testing is a method that facilitates the software testing process; it is based on an empirical evidence where almost all faults in a software component are due to the interaction of very few parameters. The test generation problem for combinatorial testing can be represented as the construction of a matrix that has certain properties; typically this matrix is a covering array. Covering arrays have a small number of tests, in comparison with an exhaustive approach, and provide a level of interaction coverage among the parameters involved. This paper presents a repository that contains binary covering arrays involving many levels of interaction. Also, it discusses the importance of covering array repositories in the construction of better covering arrays. In most of the cases, the size of the covering arrays included in the repository reported here are the best upper bounds known, moreover, the files containing the matrices of these covering arrays are available to be downloaded. The final purpose of our Binary Covering Arrays Repository (BCAR) is to provide software testing practitioners the best-known binary test-suites.


10.37236/571 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Jim Lawrence ◽  
Raghu N. Kacker ◽  
Yu Lei ◽  
D. Richard Kuhn ◽  
Michael Forbes

Binary covering arrays of strength $t$ are 0–1 matrices having the property that for each $t$ columns and each of the possible $2^t$ sequences of $t$ 0's and 1's, there exists a row having that sequence in that set of $t$ columns. Covering arrays are an important tool in certain applications, for example, in software testing. In these applications, the number of columns of the matrix is dictated by the application, and it is desirable to have a covering array with a small number of rows. Here we survey some of what is known about the existence of binary covering arrays and methods of producing them, including both explicit constructions and search techniques.


Author(s):  
Jonathan Jacky ◽  
Margus Veanes ◽  
Colin Campbell ◽  
Wolfram Schulte
Keyword(s):  

Author(s):  
Rupali A. Mahajan

The aim of this qualitative study was to investigate and comprehend the conditions that impact software cost, requirement tracking as well as scheduled software testing as an online administration and inspire essential exploration issues. Interviews were led with administrators from five associations. Thestudy utilized qualitative grounded hypothesis as its exploration system. The effects show that the interest for software testing and online requirement monitoring as an online administration is on the ascent and is impacted by conditions, for example, the level of area information required to adequately test a provision, adaptability and expense adequacy as profits, security and estimating as top prerequisites, cloud computing as the project monitor mode and the need for software analyzers to sharpen their abilities. Potential e x p l o r a t i o n territories recommended incorporate requisition regions best suited for online software testing, estimating and treatment of test information among others. The key issue is to monitor client’s requirements, track those requirements and also make it bug free and to avoid requirement gold plating issue. This study will present latest i d e a a b o u t online r e q u i r e m e n t monitoring and software testing.


1992 ◽  
Author(s):  
Timothy J. Shimeall ◽  
Stephen C. Shimeall

Sign in / Sign up

Export Citation Format

Share Document