A variable combinatorial test suite strategy based on modified greedy algorithm
A software should be tested before released to the market to be sure that a software has been achieved the quality assurance measurement objectives. Therefore, one of the testing sorts is the combinatorial interaction testing (CIT) which is intended to discover the faults that are happened by intera...
Saved in:
Main Authors: | Homaid, Ameen A. Ba, Alsewari, Abdulrahman A. |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
IEEE
2015
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/28044/1/A%20variable%20combinatorial%20test%20suite%20strategy%20based%20on%20modified.pdf http://umpir.ump.edu.my/id/eprint/28044/ https://doi.org/10.1109/ICSECS.2015.7333101 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
by: Bahomaid, Ameen A., et al.
Published: (2018) -
A Kidney Algorithm for Pairwise Test Suite Generation
by: Homaid, Ameen A. Ba, et al.
Published: (2018) -
ABC Algorithm for Combinatorial Testing Problem
by: Alsewari, Abdulrahman A., et al.
Published: (2017) -
Firefly combinatorial test list generator for IoT systems
by: Alsewari, Abdulrahman A., et al.
Published: (2018) -
Firefly combinatorial test list generator for IoT systems
by: Alsewari, Abdulrahman A., et al.
Published: (2018)