Efficient algorithms for generation of combinatorial covering suites

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 300-308

  Dumitrescu, Adrian ^a  

^a University of Wisconsin Milwaukee   (United States)

Author keywords

Automatic test generation; Combinatorial covering suite; Software testing

Indexed keywords

SOFTWARE TESTING;

AUTOMATIC TEST GENERATION; COMBINATORIAL COVERING SUITE; GREEDY ALGORITHMS; INPUT PARAMETER; LOWER BOUNDS; RANDOMIZED ALGORITHMS; SOFTWARE SYSTEMS; UNIFORM COVERAGE;

ALGORITHMS;

EID: 33244477213     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_32     Document Type: Article

References (17)

1. A. K. Chandra, L. T. Kou, G. Markowsky and S. Zaks, On sets of boolean n-vectors with all k-projections surjective, Acta Information, 20 (1983), 103-111.
2. C. Cheng, A. Dumitrescu and P. Schroeder, Generating small test suites for non-uniform instances, Third International Conference on Quality Software (QSIC 2003), Dallas, November 2003, accepted.
3. D. M. Cohen, S. R. Dalal, M. L. Fredman and G. C. Patton, The AETG system: an approach to testing based on combinatorial design, IEEE Transactions on Software Engineering, 23(7) (1997), 437-444.
4. D. M. Cohen, S. R. Dalai, A. Kajla and G. C. Patton, The automatic efficient test generator (AETG) system, Proceedings of the 5-th International Symposium on Software Reliability Engineering, IEEE, 1994, 303-309.
5. D. M. Cohen, S. R. Dalal, J. Parelius and G. C. Patton, The combinatorial design approach to automatic test generation, IEEE Software, 13 (1996), 83-89.
6. D. M. Cohen and M. L. Fredman, New techniques for designing qualitatively independent systems, Journal of Combinatorial Designs, 6(6) (1998), 411-416.
7. S. R. Dalal and C. M. Mallows, Factor-covering designs for testing software, Technometrics, 40(3) (1998), 234-243.
8. L. Gargano, J. Körner and U. Vaccaro, Sperner capacities, Graphs and Combinatorics, 9 (1993), 31-46.
9. A. P. Godbole, D. E. Skipper and R. A. Sunley, t-Covering arrays: upper bounds and Poisson approximations, Combinatorics, Probability and Computing, 5 (1996), 105-117.
10. A. Hartman, Software and hardware testing using combinatorial covering suites, to appear in Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms (ed. M. Golumbic), manuscript, July 2002.
11. G. O. H. Katona, Two applications (for search theory and truth functions) of Sperner type theorems, Periodica Mathematica Hungarica, 3 (1973), 19-26.
12. D. J. Kleitman and J. Spencer, Families of k-independent sets, Discrete Mathematics, 6 (1973), 255-262.
13. N. Kobayashi, T. Tsuchiya and T. Kikuno, A new method for constructing pair-wise covering designs for software testing, Information Processing Letters 81(2) (2002), 85-91.
14. M. Naor, L. J. Schulman and A. Srinivasan, Splitters and near-optimal derandomization, Proceedings of the 36-th Annual Symposium on Foundations of Computer Science (FOCS), 1995, 182-191.
15. A. Rényi, Foundations of Probability, Wiley, New york, 1971.
16. G. Seroussi and N. H. Bshouty, Vector sets for exhaustive testing of digital circuits, IEEE Transactions on Information Theory, 34(3) (1988), 513-522.
17. N. J. A. Sloane, Covering arrays and intersecting codes, Journal of Combinatorial Designs, 1 (1993), 51-63.