DocumentCode
626380
Title
Applications of Combinatorial Testing Methods for Breakthrough Results in Software Testing
Author
Mehta, Manav ; Philip, Riya
Author_Institution
Organizational Excellence Group, iGATE Corp., Mumbai, India
fYear
2013
fDate
18-22 March 2013
Firstpage
348
Lastpage
351
Abstract
In last three decades, lot of research work has been done by statisticians and academicians (D. Richard Kuhn, Raghu N. Kacker, Vu Lei, Ljubomir Lazic, Sloane, Neil J. A., Madhav Phadke, D. M. Cohen, James Bach and others) in the field of Combinatorial testing (CT) and its use in software testing. However, its tremendous potential in terms of test optimization and fault detection is yet to be exploited to its fullest. This paper showcases some of the real-world examples from iGATE Corporation, where CT has been used successfully to achieve breakthrough results in software testing. The paper, through three case studies taken from different domains describes the challenges faced by testing teams in terms of test scenario complexities, schedule and budget constraints; and how CT helped resolve those challenges successfully. Our experience shows 60 to 70 percent benefits in terms of optimization of test efforts while enhancing test case coverage. In the end, the paper highlights some learnings from our experiences in implementing CT approach which may be of help to fellow practitioners.
Keywords
combinatorial mathematics; program testing; software fault tolerance; CT approach; budget constraint; combinatorial testing method; fault detection; iGATE Corporation; software testing; test case coverage; test optimization; test scenario complexity; test schedule; Complexity theory; Insurance; NIST; Schedules; Software testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Testing, Verification and Validation Workshops (ICSTW), 2013 IEEE Sixth International Conference on
Conference_Location
Luxembourg
Print_ISBN
978-1-4799-1324-4
Type
conf
DOI
10.1109/ICSTW.2013.46
Filename
6571652
Link To Document