| 000 | 03504ntm a2200373 i 4500 | ||
|---|---|---|---|
| 001 | vtls000103106 | ||
| 003 | KUKTEM | ||
| 005 | 20251117113342.0 | ||
| 008 | 180312s2017 my da f am 000 0 eng d | ||
| 020 | _aTHE0001288(Local) | ||
| 039 | 9 |
_a201905271615 _batie _y201803121520 _zsaini |
|
| 040 |
_aUMP _beng _cUMP _erda |
||
| 090 | _aFSKKP .Y39 2017 r Thesis | ||
| 100 | 1 |
_aAhmad, Yazan Sadeq Al Sariera, _eauthor. |
|
| 245 | 1 | 2 |
_aA bat-inspired t-way strategy for mixed-strength test suite generation / _cYazan Ahmad Sadeq Al Sariera |
| 264 | 1 |
_aKuantan, Pahang : _bUMP, _c2017 |
|
| 264 | 4 | _c© 2017 | |
| 300 |
_axiv, 162 pages : _billustrations (some color), chart ; _c30 cm. + _e1 CD-ROM |
||
| 336 |
_atext _2rdacontent |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aunmediated _2rdamedia |
||
| 337 |
_acomputer _2rdamedia |
||
| 338 |
_avolume _2rdacarrier |
||
| 338 |
_acomputer disc _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 500 | _aFaculty of Computer Systems and Software Engineering | ||
| 502 | _aThesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2017 | ||
| 504 | _aIncludes bibliographical references | ||
| 520 | 3 | _aSoftware testing is essential part of software development life cycle. Yet, exhaustive testing of highly configurable software is impractical owing to the limited time and resources. Furthermore, exhaustive testing leads to a combinatorial explosion problem whereby the test cases grow exponentially with the increase of software inputs. Owing to its effectiveness for bug finding, many researchers are turning to the sampling strategies based on input interaction, called t-way testing, where t indicates the interaction strength. Known to be an NP-complete (i.e. Non-deterministic Polynomial-time) problem, the process of minimizing t-way test cases is challenging owing to the potentially large generated search space when dealing with large input values. To date, many t-way strategies have been proposed in the literature. Recently, researchers have advocated the adoption of meta-heuristic based t-way strategies in line with the emergence of the new field called Search Based Software Engineering (SBSE). Although helpful, no single meta-heuristic based t-way strategies can claim dominance over their other counterparts. For this reason, the search for a new meta-heuristic based t-way strategy is still a useful endeavor. This thesis presents the design and implementation of a new meta-heuristic based t-way strategy, called Bat-inspired t-way Strategy (BTS), for generating a mixed-strength t-way test suite. BTS is the first t-way strategy that adopts the Bat-inspired algorithm as its core implementation and adopts the Hamming distance as the final selection criteria to enhance the exploration of new solution. The experimental results supported by non-parametric statistical analysis demonstrate that BTS gives competitive performance over its counterparts. Specifically, BTS has achieved and matched 68.181% of the best sizes from the published benchmark results with 32.575 % new known best sizes. This finding contributes to the field of software testing by minimizing the number of test cases for test execution. | |
| 610 | 2 | 0 |
_aFaculty of Computer Systems and Software Engineering _xDissertations |
| 650 | 0 |
_aUniversities and colleges _xDisertations |
|
| 650 | 0 | _aTheses | |
| 999 |
_aVIRTUA40 _c7207 _d7213 |
||
| 999 | _aVTLSSORT0080*0200*0400*0900*1000*2450*2640*2641*3000*3360*3361*3370*3371*3380*3381*3470*5000*5020*5040*5200*6100*6500*6501*9992 | ||