Article ID Journal Published Year Pages File Type
484531 Procedia Computer Science 2015 8 Pages PDF
Abstract

Failures of hardware and software systems are often caused due to unexpected interactions among system components. The number of tests that needs to be performed in order to test all possible combinations of interactions can be exorbitant even for medium sized projects. To bring a balance between exhaustive testing and lack of testing, researchers have adopted pairwise testing which promises the testing of all pairwise combinatorial interactions between input components. This paper enhances the previous strategy, “A Tree Based Strategy for Test Data Generation and Cost Calculation” to go beyond pairwise testing. The new strategy can support 3-way combinatorial interaction testing.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)