DocumentCode
2088848
Title
Common Patterns in Combinatorial Models
Author
Segall, Itai ; Tzoref-Brill, Rachel ; Zlotnick, Aviad
Author_Institution
Haifa Res. Lab., Haifa Univ. Campus, Haifa, Israel
fYear
2012
fDate
17-21 April 2012
Firstpage
624
Lastpage
629
Abstract
Combinatorial test design (CTD) is an effective test planning technique that systematically exercises interactions between parameters of the test space. The test space is manually modeled by a set of parameters, their respective values, and restrictions on the value combinations. A subset of the test space is then automatically constructed so that it covers all valid value combinations of every t parameters, where t is a user input. This paper describes patterns that we have found to be recurring in combinatorial models, i.e., recurring properties of the modeled test spaces. These patterns are often hard to identify and capture correctly in a model, thus are common pitfalls in combinatorial modeling. We describe these patterns, supply methods for identifying them, and suggest simple yet effective solutions for them.
Keywords
combinatorial mathematics; program testing; combinatorial models; combinatorial test design; common patterns; recurring properties; test planning technique; test space; Algorithm design and analysis; Computer bugs; Electronic mail; Marine animals; Redundancy; Software; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Testing, Verification and Validation (ICST), 2012 IEEE Fifth International Conference on
Conference_Location
Montreal, QC
Print_ISBN
978-1-4577-1906-6
Type
conf
DOI
10.1109/ICST.2012.150
Filename
6200162
Link To Document