Handling Constraints in Combinatorial Interaction Testing in the Presence of Multi Objective Particle Swarm and Multithreading
Combinatorial testing strategies have lately received a lot of attention as a result of their diverse applications. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set based on their interaction (or combination). In practice,...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Elsevier Ltd
2017
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/14240/2/Handling%20constraints%20in%20combinatorial%20interaction%20testing%20in%20the%20presence%20of%20multi%20objective%20particle%20swarm%20and%20multithreading%201.pdf http://umpir.ump.edu.my/id/eprint/14240/ http://doi.org/10.1016/j.infsof.2017.02.004 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Combinatorial testing strategies have lately received a lot of attention as a result of their diverse applications. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set based on their interaction (or combination). In practice, the input configurations of software systems are subjected to constraints, especially in case of highly configurable systems. To implement this feature within a strategy, many difficulties arise for construction. While there are many combinatorial interaction testing strategies nowadays, few of them support constraints. |
|---|