DocumentCode :
556779
Title :
Implementation and covering analysis for the T-way combinatorial testing strategy
Author :
Varvara, G. ; Sandu, V.
Author_Institution :
Tech. Univ. Gheorghe Asachi from Iasi, Iasi, Romania
fYear :
2011
fDate :
14-16 Oct. 2011
Firstpage :
1
Lastpage :
6
Abstract :
The paper stands from the general concepts of combinatorial testing in order to point out the benefits of the automatically generated tests based on the t-way combinatorial techniques. Then it implements an optimal strategy that reduce the necessary number of test cases and analysis its effectiveness on practical examples that involves a reduce number of correlated input parameters. Some remarks on the proposed implementations cost and test covering advantages conclude this work.
Keywords :
combinatorial mathematics; program testing; automatic generated tests; covering analysis; implementations cost; software systems; t-way combinatorial testing strategy; test cases; test covering advantages; Algorithm design and analysis; Generators; Greedy algorithms; Measurement; Software; Testing; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Theory, Control, and Computing (ICSTCC), 2011 15th International Conference on
Conference_Location :
Sinaia
Print_ISBN :
978-1-4577-1173-2
Type :
conf
Filename :
6085739
Link To Document :
بازگشت