IPO-s: Incremental generation of combinatorial interaction test data based on symmetries of covering arrays

IEEE International Conference on Software Testing, Verification, and Validation Workshops, ICSTW 2009

Volumn , Issue , 2009, Pages 10-18

  Calvagna, Andrea ^a   Gargantini, Angelo ^b  

^a UNIVERSITY OF CATANIA   (Italy)

^b UNIVERSITY OF BERGAMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL INTERACTIONS; CONFIGURABLE; COVERING ARRAYS; CUSTOMIZABLE; EXPERIMENTAL ASSESSMENT; FORMAL MODELING; NEW PARAMETERS; OPTIMAL RESULTS; PROTOTYPE IMPLEMENTATIONS; SOFTWARE SYSTEMS; SYMMETRY PROPERTIES; TEST DATA; TIME AND SPACE; VERIFICATION AND VALIDATION; WHOLE SYSTEMS;

COMPUTER SOFTWARE SELECTION AND EVALUATION; HEURISTIC METHODS; PORTALS; SOFTWARE PROTOTYPING; SOFTWARE TESTING; TECHNICAL PRESENTATIONS; TESTING; VERIFICATION;

HEURISTIC ALGORITHMS;

EID: 69949098212     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSTW.2009.7     Document Type: Conference Paper

References (37)

1. Joanne M. Atlee and Michael A. Buckley. A logic-model semantics for SCR software requirements. In International Symposium on Software Testing and Analysis. ACM, 1996.
2. R. C. Bose and K. A. Bush. Orthogonal arrays of strength two and three. The Annals of Mathematical Statistics, 23(4):508-524, 1952.
3. R. Brownlie, J.Prowse, and M.S. Phadke. Robust testing of AT&T PMX/starMAIL using OATS. AT&T Technical Journal, 71(3):41-47, 1992.
4. Reńee C. Bryce, Charles J. Colbourn, and Myra B. Cohen. A framework of greedy methods for constructing interaction test suites. In ICSE '05: Proceedings of the 27th international conference on Software engineering, pages 146-155, New York, NY, USA, 2005. ACM.
5. K. Burr and W. Young. Combinatorial test techniques: Table-based automation, test generation, and code coverage. In Proceedings of the Intl. Conf. on Software Testing Analysis and Review, pages 503-513, October 1998.
6. Andrea Calvagna and Angelo Gargantini. A logic-based approach to combinatorial testing with constraints. In Bernhard Beckert and Reiner Hähnle, editors, Tests and Proofs, Second International Conference, TAP 2008, Prato, Italy, April 9-11, 2008. Proceedings, volume 4966 of Lecture Notes in Computer Science, pages 66-83. Springer, 2008.
7. Andrea Calvagna and Angelo Gargantini. Using SRI SAL model checker for combinatorial tests generation in the presence of temporal constraints. In John Rushby and Natarajan Shankar, editors, AFM'08: Third Workshop on Automated Formal Methods (satellite of CAV), pages 43-52, 2008.
8. 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):437-444, 1997.
9. M. B. Cohen, C. J. Colbourn, P. B. Gibbons, and W. B. Mugridge. Constructing test suites for interaction testing. In ICSE, pages 38-48, 2003.
10. Myra B. Cohen, Matthew B. Dwyer, and Jiangfan Shi. Interaction testing of highly-configurable systems in the presence of constraints. In ISSTA International symposium on Software testing and analysis, pages 129-139, New York, NY, USA, 2007. ACM Press.
11. C. J. Colbourn, M.B. Cohen, and R.Turban. A deterministic density algorithm for pairwise interaction coverage. In Proc. of the IASTED Intl. Conference on Software Engineering, pages 242-252, 2004.
12. Charles J. Colbourn, Sosina S. Martirosyan, Gary L. Mullen, Dennis Shasha, George B. Sherwood, and Joseph L. Yucas. Products of mixed covering arrays of strength two. Journal of Combinatorial Designs, 14(2):124-138, 2006.
13. J. Czerwonka. Pairwise testing in real world. In 24th Pacific Northwest Software Quality Conference, 2006.
14. S. Dalal, A. Jain, N. Karunanithi, J. Leaton, and C. Lott. Model-based testing of a highly programmable system. issre, 00:174, 1998.
15. S. R. Dalal, A. Jain, N. Karunanithi, J. M. Leaton, C. M. Lott, G. C. Patton, and B. M. Horowitz. Model-based testing in practice. In International Conference on Software Engineering ICSE, pages 285-295, New York, May 1999. Association for Computing Machinery.
16. I. S. Dunietz, W. K. Ehrlich, B.D. Szablak, C.L. Mallows, and A. Iannino. Applying design of experiments to software testing. In IEEE/Computer Society, editor, Proc. Int'l Conf. Software Eng. (ICSE), pages 205-215, 1997.
17. Mats Grindal, Jeff Offutt, and Sten F. Andler. Combination testing strategies: a survey. Softw. Test, Verif. Reliab, 15(3):167-199, 2005.
18. Alan Hartman. Ibm intelligent test case handler: Whitch, http://www.alphaworks.ibm.com/tech/whitch.
19. Alan Hartman and Leonid Raskin. Problems and algorithms for covering arrays. DMATH: Discrete Mathematics, 284(1-3):149-156, 2004.
20. Gerard J. Holzmann. The model checker SPIN. Software Engineering, 23(5):279-295, 1997.
21. Jenny Combinatorial Tool. http://www.burtleburtle.net/bob/math/jenny. html.
22. Noritaka Kobayashi, Tatsuhiro Tsuchiya, and Tohru Kikuno. Non-specification-based approaches to logic testing for software. Journal of Information and Software Technology, 44(2):113-121, February 2002.
23. D. R. Kuhn and M. J. Reilly. An investigation of the applicability of design of experiments to software testing. In IEEE/Computer Society, editor, 27th NASA/IEEE Software Engineering workshop, pages 91-95, 2002.
24. D. Richard Kuhn and Vadim Okum. Pseudo-exhaustive testing for software. In SEW '06: IEEE/NASA Software Engineering Workshop, volume 0, pages 153-158, Los Alamitos, CA, USA, 2006. IEEE Computer Society.
25. D. Richard Kuhn, Dolores R. Wallace, and Albert M. Gallo. Software fault interactions and implications for software testing. IEEE Trans. Software Eng, 30(6):418-421, 2004.
26. Yu Lei and Kuo-Chung Tai. In-parameter-order: A test generation strategy for pairwise testing. In 3rd IEEE International Symposium on High-Assurance Systems Engineering (HASE '98), 13-14 November 1998, Washington, D.C, USA, Proceedings, pages 254-261. IEEE Computer Society, 1998.
27. C. Lott, A. Jain, and S. Dalal. Modeling requirements for combinatorial software testing. In A-MOST '05: Proceedings of the 1st international workshop on Advances in model-based testing, pages 1-7, New York, NY, USA, 2005. ACM Press.
28. A. McDowell. All-pairs testing, http://www.mcdowella.demon.co.uk/ allpairs.html.
29. K. Nurmela. Upper bounds for covering arrays by tabu. Discrete Applied Mathematics, 138(1-2):143-152, 2004.
30. Pairwise web site. http://www.pairwise.org/.
31. Gadiel Seroussi and Nader H. Bshouty. Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory, 34(3):513-522, 1988.
32. George B. Sherwood. Optimal and near-optimal mixed covering arrays by column expansion. Discrete Mathematics, In Press, Corrected Proof:-.
33. B. D. Smith, M. S. Feather, and N. Muscettola. Challenges and methods in validating the remote agent planner. In CO Breckenridge, editor, Proceedings of the Fifth International conference on Artificial Intelligence Planning Systems (AIPS), 2000.
34. TestCover tool. http://www.testcover.com/.
35. Alan W. Williams and Robert L. Probert. Formulation of the interaction test coverage problem as an integer program. In Proceedings of the 14th International Conference on the Testing of Communicating Systems (TestCom) Berlin, Germany, pages 283-298, march 2002.
36. A.W. Williams. Determination of test configurations for pair-wise interaction coverage. In Proceedings of the 13th International Conference on the Testing of Communicating Systems (TestCom 2000), pages 59-74, August 2000.
37. Cemal Yilmaz, Myra B. Cohen, and Adam A. Porter. Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Trans. Software Eng, 32(1):20-34, 2006.