Distributed T-Way Test Generation Strategies Using Tuple Space Approach
dc.contributor.author | Che Soh, Zainal Hisham | |
dc.date.accessioned | 2019-03-06T06:43:22Z | |
dc.date.available | 2019-03-06T06:43:22Z | |
dc.date.issued | 2013-07 | |
dc.description.abstract | When generating a t-way (where t indicates the interaction strength) test suite for large and complex software systems, the number of interaction between software components to be covered for higher order t-way is likely to be huge and potentially leads towards a combinatorial explosion problem. Apart from being an NP complete problem, the computational complexity for t-way test suite generation also grows rapidly as the value of t increases. The resultant test case number in test suite also increases exponentially as the value of interaction strength, t is increases. In this manner, t-way test suite generation with large input parameter and high interaction strength require significantly high computational power and memory spaces. A myriad of useful t-way test suite generation strategies have been implemented recently using the sequential algorithm on standalone machines. Although helpful, the computational power and memory space of a standalone machine is arguably insufficient especially when dealing with large input parameters and high interaction strength. Furthermore, most of available strategies on t-way test suite generation cannot extend the computing work from standalone machines into a multiple machine environment. | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/7839 | |
dc.language.iso | en | en_US |
dc.publisher | Universiti Sains Malaysia | en_US |
dc.subject | T-Way Test Generation Strategies | en_US |
dc.subject | Tuple Space Approach | en_US |
dc.title | Distributed T-Way Test Generation Strategies Using Tuple Space Approach | en_US |
dc.type | Thesis | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: