Software and hardware testing using combinatorial covering suites

Operations Research/ Computer Science Interfaces Series

Volumn 34, Issue , 2005, Pages 237-266

  Hartman, Alan ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888608902     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-25036-0_10     Document Type: Article

References (45)

1. Azar J., Motwani R., and Naor J., Approximating probability distributions using small sample spaces. Combinatorica 18: 151-171 (1998).
2. Boroday S. Y., Determining essential arguments of Boolean functions. (in Russian), in Proceedings of the Conference on Industrial Mathematics, Taganrog (1998), 59-61. The translation is a personal communication from the author.
3. Boroday S. Y. and Grunskii I. S., Recursive generation of locally complete tests. Cybernetics and Systems Analysis 28: 20-25 (1992).
4. Bose R. C., Parker E. T., and Shrikhande S., Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture. Can. J. Math. 12: 189-203 (1960).
5. Bush K.A., A generalization of the theorem due to MacNeish. Ann. Math. Stat.23: 293-295 (1952).
6. Bush K. A., Orthogonal arrays of index unity. Annals of Mathematical Statistics 23: 426-434 (1952).
7. Chandra A. K., Kou L. T., Markowsky G., and Zaks S., On sets of Boolean n-vectors with all k-projections surjective. Acta Inform. 20: 103-111 (1983).
8. Chateauneuf M. A. and Kreher D. L., On the state of strength 3 covering arrays. J. Combinatorial Designs, Journal of Combinatorial Designs 10 (2002), no. 4, 217-238. Available at http://www.math.mtu.edu/kreher/.
9. Chateauneuf M. A., Colbourn C. J., and Kreher D. L., Covering arrays of strength 3. Designs, Codes, and Cryptography, 16: 235-242 (1999).
10. Chowla S., Erdös P., and Straus E. G., On the maximal number of pairwise orthogonal Latin squares of a given order. Canad. J. Math. 13: 204-208 (1960).
11. Cohen D.M., Dalal S.R., Fredman M.L., and Patton G.C., The AETG System:Anapproach to Testing Based on Combinatorial Design. IEEE Transactions on Software Engineering, 23: 437-444 (1997).
12. Colbourn C. J. and Dinitz J. H., The CRC Handbook of Combinatorial Designs. CRC Press (1996).
13. Dill D., Murφ Description Language and Verifier. http://sprout.stanford.edu/dill/murphi.html.
14. Edelman A., The mathematics of the Pentium division bug. SIAM Review 39: 54-67 (1997).
15. Erdös P., Ko C., and Rado R., Intersection theorems for systems of finite sets. Quart. J. Math. Oxford 12: 313-318 (1961).
16. Farchi E., Hartman A., and Pinter S. S., Using a model-based test generator to test for standards conformance. IBM Systems Journal 41: 89-110 (2002).
17. Fisher R. A., An examination of the different possible solutions of a problem in incomplete blocks. Ann. Eugenics 10: 52-75 (1940).
18. Gal S., Rendezvous search on a line. Operations Research 47: 974-976 (1999).
19. Gargano L., Körner J., and Vaccaro U., Capacities: from information theory to extremal set theory. J. Comb. Theory, Ser. A. 68: 296-316 (1994).
20. Gargano L., Körner J., and Vaccaro U., Sperner capacities. Graphs and Combinatorics, 9: 31-46 (1993).
21. Godbole A. P., Skipper D. E., and Sunley R. A., T-Covering arrays: Upper bounds and Poisson approximations. Combinatorics, Probability, and Computing 5: 105-117 (1996).
22. Greene C., Sperner families and partitions of a partially ordered set. In Combinatorics (ed. M. Hall Jr. and J. van Lint) Dordrecht, Holland, (1975) pp. 277-290.
23. Harborth H. and Kemnitz A., Calculations for Bertrand's Postulate. Math. Magazine 54: 33-34 (1981).
24. Katona G. O. H., Two applications (for search theory and truth functions) of Sperner type theorems. Periodica Math. Hung. 3: 19-26 (1973).
25. Kleitman D. J. and Spencer J., Families of k-independent sets. Discrete Math. 6: 255-262 (1973).
26. rd IEEE High Assurance Systems Engineering Symposium, (1998) pp. 254-261.
27. Leveson N. and Turner C. S. An investigation of the Therac-25 accidents. IEEE Computer, 26: 18-41 (1993).
28. Lim W. S. and Alpern S., Minimax rendezvous on the line. SIAM J. Control and Optim. 34: 1650-1665 (1996).
29. Lions J. L., Ariane 5 Flight 501 failure, Report by the Inquiry Board. http://sunnyday.mit.edu/accidents/Ariane5accidentreport.html.
30. Metsch K., ImprovementofBruck's completion theorem. Designs,Codes andCryptography 1: 99-116 (1991).
31. Naor J. and Naor M., Small-bias probability spaces: efficient constructions and applications. SIAM J. Computing, 22: 838-856 (1993).
32. Naor M., Schulman L. J., and Srinvasan A., Splitters and near-optimal randomization. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), (1996), pp. 182-191.
33. Nurmela K., Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics, 138: 143-152 (2004).
34. Peled D. A., Software reliability methods. Springer, New York (2001).
35. Rényi A., Foundations of probability. Wiley, New York, (1971).
36. Roux G., K-propriétés dans les tableaux de n colonnes; cas particulier de la k-surjectivité et de la k-permutativité. Ph. D. Dissertation, University of Paris 6, (1987).
37. Seroussi G. and Bshouty N. H., Vector sets for exhaustive testing of logic circuits. IEEE Trans. Information Theory, 34: 513-522 (1988).
38. Sloane N. J. A., Covering arrays and intersecting codes. J. Combinatorial Designs 1: 51-63 (1993).
39. Stevens B., Ling A., and Mendelsohn E., A direct construction of transversal covers using group divisible designs. Ars Combin. 63: 145-159 (2002).
40. Stevens B., Moura L., and Mendelsohn E., Lower bounds for transversal covers. Designs, Codes, and Cryptography, 15: 279-299 (1998).
41. Tang D. T. and Chen C. L., Iterative exhaustive pattern generation for logic testing. IBM J. Res. Develop. 28: 212-219 (1984).
42. Tang D. T. and Woo L. S., Exhaustive test pattern generation with constant weight vectors. IEEE Trans. Computers 32: 1145-1150 (1983).
43. Web W. W., The Vandermonde determinant, http://www.webeq.com/WebEQ/2.3/docs/tour/determinant.html
44. West D. B., Introduction to Graph Theory. Prentice Hall NJ, (1996).
45. Williams A. W., Determination of Test Configurations for Pair-Wise Interaction Coverage. in Proceedings of the 13th International Conference on the Testing of Communicating Systems (TestCom 2000), Ottawa Canada, (2000) pp. 59-74.