Using satisfiability solving for pairwise testing in the presence of constraints

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E95-A, Issue 9, 2012, Pages 1501-1505

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

^a OSAKA UNIVERSITY   (Japan)

^b CHUGOKU ELECTRIC POWER CO INC   (Japan)

^c OSAKA GAKUIN UNIVERSITY   (Japan)

Author keywords

Constraints; Pairwise testing; SAT; Software testing; Test set generation

Indexed keywords

FORMAL LOGIC; SOFTWARE RELIABILITY;

BOOLEAN SATISFIABILITY; CONSTRAINTS; HANDLING CONSTRAINTS; PAIR-WISE TESTING; PARAMETER CONSTRAINTS; SATISFIABILITY SOLVING; SEARCH-BASED TESTING; TEST SET GENERATION;

SOFTWARE TESTING;

EID: 84865754538     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1587/transfun.E95.A.1501     Document Type: Article

References (16)

1. R. Mandl, "Orthogonal latin squares: An application of experiment design to compiler testing", Commun. ACM, vol. 28, no. 10, pp. 1054-1058, 1985. (Pubitemid 15587965)
2. K. Tatsumi, "Test case design support system", Proc. International Conference on Quality Control (ICQC'87), pp. 615-620, 1987.
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. Softw. Eng., vol. 23, no. 7, pp. 437-444, 1997. (Pubitemid 127828305)
4. D. R. Kuhn, D. R. Wallace, and A. M. Gallo, Jr., "Software fault interactions and implications for software testing", IEEE Trans. Softw. Eng., vol. 30, no. 6, pp. 418-421, 2004.
5. 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. Softw. Eng., vol. 34, pp. 633-650, Sept. 2008.
6. B. Hnich, S. Prestwich, and E. Selensky, "Constraint-based approaches to the covering test problem", Recent Advances in Constraints, ed. B. Faltings, A. Petcu, F. Fages, and F. Rossi, Lect. Notes Comput. Sci., vol. 3419, pp. 172-186, Springer Berlin/Heidelberg, 2005.
7. M. Banbara, H. Matsunaka, N. Tamura, and K. Inoue, "Generating combinatorial test cases by efficient sat encodings suitable for cdcl sat solvers", Proc. 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'10, pp. 112-126, Springer-Verlag, Berlin, Heidelberg, 2010.
8. B. Garvin, M. Cohen, and M. Dwyer, "Evaluating improvements to a meta-heuristic search for constrained interaction testing", Empirical Software Engineering, vol. 16, no. 1, pp. 61-102, 2011.
9. T. Nanba, T. Tsuchiya, and T. Kikuno, "Constructing test sets for pair-wise testing: A SAT-based approach", Proc. 2nd International Workshop on Advances in Networking and Computing (WANC), pp. 271-274, Dec. 2011.
10. C. J. Colbourn, "Combinatorial aspects of covering arrays", Le Matematiche, vol. 59, no. 1, 2, pp. 125-172, 2004.
11. 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, Sept. 2005. (Pubitemid 41320808)
12. C. Nie and H. Leung, "A survey of combinatorial testing", ACM Computing Surveys, vol. 43, pp. 11:1-11:29, Feb. 2011.
13. M. B. Cohen, P. B. Gibbons, W. B. Mugridge, and C. J. Colbourn, "Constructing test suites for interaction testing", Proc. 25th International Conference on Software Engineering (ICSE'03), pp. 38-48, Portland, Oregon, May 2003.
14. N. Eén and N. Sorensson, "An extensible SAT-solver", Proc. 6th International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), Lect. Notes Comput. Sci., vol. 2919, pp. 333-336, 2004.
15. N. Kobayashi, T. Tsuchiya, and T. Kikuno, "A new method for constructing pair-wise covering designs for software testing", Inf. Process. Lett., vol. 81, no. 2, pp. 85-81, 2002.
16. J. Czerwonka, "Pairwise testing in real world practical extensions to test case generators", Proc. 24th Annual Pacific Northwest Software Quality Conference, pp. 419-430, Oct. 2006.