Constructing test sets for pairwise testing: A SAT-based approach

Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

Volumn , Issue , 2011, Pages 271-274

  Nanba, Toru ^a   Tsuchiya, Tatsuhiro ^a   Kikuno, Tohru ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

constraints; pairwise testing; SAT; software testing; test set generation

Indexed keywords

AUTOMATIC TEST GENERATION; BOOLEAN SATISFIABILITY; CONSTRAINTS; HIDDEN CONSTRAINTS; PAIRWISE TESTING; PROBLEM INSTANCES; SAT; SAT SOLVERS; TEST SET GENERATION; TEST SETS; TESTING METHOD;

FORMAL LOGIC; SOFTWARE TESTING;

DECISION THEORY;

EID: 84856836447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2011.49     Document Type: Conference Paper

References (12)

1. R. Mandl, "Orthogonal latin squares: An application of experiment design to compiler testing," Communications of the ACM, vol. 28, no. 10, pp. 1054-1058, 1985. (Pubitemid 15587965)
2. K. Tatsumi, "Test case design support system," in Proc. of International Conference on Quality Control (ICQC'87), 1987, pp. 615-620.
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 Trans. on Software Engineering, vol. 23, no. 7, pp. 437-444, 1997.
4. M. B. Cohen, M. B. Dwyer, and J. Shi, "Constructing interaction test suites for highly-configurable systems in the presence of constraints: A greedy approach," IEEE Trans. on Software Engineering, vol. 34, pp. 633-650, Sep. 2008. [Online]. Available: http://portal.acm.org/citation.cfm?id=1439185. 1439210
5. K. J. Nurmela, "Upper bounds for covering arrays by tabu search,"Discrete Appl. Math., vol. 138, pp. 143-152, March 2004. [Online]. Available: http://dx.doi.org/10.1016/S0166-218X(03)00291-9
6. M. Banbara, H. Matsunaka, N. Tamura, and K. Inoue, "Generating combinatorial test cases by efficient sat encodings suitable for cdcl sat solvers," in Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning, ser. LPAR'10. Berlin, Heidelberg: Springer-Verlag, 2010, pp. 112-126. [Online]. Available: http://portal.acm.org/citation.cfm?id=1928380.1928389
7. C. J. Colbourn, "Combinatorial aspects of covering arrays," Le Matematiche, 2005.
8. M. Grindal, J. Offutt, and S. F. Andler, "Combination testing strategies: A survey," Software Testing, Verification and Reliability, vol. 15, no. 3, pp. 167-199, Mar. 2005.
9. C. Nie and H. Leung, "A survey of combinatorial testing," ACM Computing Surveys, vol. 43, pp. 11:1-11:29, Feb. 2011. [Online]. Available: http://doi.acm.org/10.1145/1883612.1883618
10. M. B. Cohen, P. B. Gibbons, W. B. Mugridge, and C. J. Colbourn, "Constructing test suites for interaction testing," in Proc. of 25th International Conference on Software Engineering (ICSE '03), Portland, Oregon, May 2003, pp. 38-48.
11. N. Eén and N. Sorensson, "An extensible SAT-solver," in Proc. 6th International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), ser. Lecture Notes in Computer Science, vol. 2919, 2004, pp. 333-336.
12. J. Czerwonka, "Pairwise testing in real world. practical extensions to test case generators," in Proceedings of the 24th Annual Pacific Northwest Software Quality Conference, Oct. 2006, pp. 419-430.