| Presentation | 2015-10-13 Improving the greedy approach to constructing combinatorial test suites Teru Ohashi, Tatsuhiro Tsuchiya, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper discusses an optimization of the greedy approach for constructing test suites for combinatorial interaction testing. The greedy approach constructs a complete test suite by repeatedly adding a test case to the test suite. Usually each test case is selected from a set of candidate test cases that are generated using a randomized algorithm. The proposed optimization is based on the observation that in an early stage of test suite generation it is easy to find a good test case, whereas it is difficult in a later stage because there remain fewer combinations that needs to be covered. Based on the observation the proposed optimization changes the number of generated test case candidates, starting with a smaller number and switching it with a higher one at a later stage. The experimental results show that with the proposed optimization a small test suite can be obtained with a shorter generation time than without using the optimization. end{eabstract} begin{ekeyword}Combinatorial testing, greedy approach, pair-wise testing, test set |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Combinatorial testing / greedy approach / pair-wise testing / test set |
| Paper # | SS2015-37,DC2015-27 |
| Date of Issue | 2015-10-06 (SS, DC) |
| Conference Information | |
| Committee | DC / SS |
|---|---|
| Conference Date | 2015/10/13(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Todaiji Culture Center (Nara) |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Software System, Dependability in Network |
| Chair | Nobuyasu Kanekawa(Hitachi) / Shoji Yuen(Nagoya Univ.) |
| Vice Chair | Michiko Inoue(NAIST) / Kazuhiro Ogata(JAIST) |
| Secretary | Michiko Inoue(RTRI) / Kazuhiro Ogata(Kyoto Sangyo Univ.) |
| Assistant | / Yoshiki Higo(Osaka Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Dependable Computing / Technical Committee on Software Science |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Improving the greedy approach to constructing combinatorial test suites |
| Sub Title (in English) | |
| Keyword(1) | Combinatorial testing |
| Keyword(2) | greedy approach |
| Keyword(3) | pair-wise testing |
| Keyword(4) | test set |
| 1st Author's Name | Teru Ohashi |
| 1st Author's Affiliation | Osaka University(Osaka Univ.) |
| 2nd Author's Name | Tatsuhiro Tsuchiya |
| 2nd Author's Affiliation | Osaka University(Osaka Univ.) |
| Date | 2015-10-13 |
| Paper # | SS2015-37,DC2015-27 |
| Volume (vol) | vol.115 |
| Number (no) | SS-248,DC-249 |
| Page | pp.pp.13-15(SS), pp.13-15(DC), |
| #Pages | 3 |
| Date of Issue | 2015-10-06 (SS, DC) |