3-way Interaction Testing Using the Tree Strategy | Zendy

Mohammad F. J. Klaib | Zendy; Mohammad Subhi Al-Batah | Zendy; Rashad J. Rasras | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

3-way Interaction Testing Using the Tree Strategy

Author(s) -

Mohammad F. J. Klaib,

Mohammad Subhi Al-Batah,

Rashad J. Rasras

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.09.040

Subject(s) - computer science , pairwise comparison , test strategy , orthogonal array testing , tree (set theory) , white box testing , integration testing , software , software performance testing , machine learning , data mining , theoretical computer science , artificial intelligence , software system , programming language , software construction , mathematical analysis , mathematics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research