Test Case Prioritization Using Lexicographical Ordering
| Autor: | Sepehr Eghbali, Ladan Tahvildari |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Computer science
business.industry Heuristic (computer science) Feature extraction 020207 software engineering 02 engineering and technology computer.software_genre Lexicographical order Fault detection and isolation Software Test case Fault coverage Regression testing 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Data mining business computer |
| Zdroj: | IEEE Transactions on Software Engineering. 42:1178-1195 |
| ISSN: | 1939-3520 0098-5589 |
| Popis: | Test case prioritization aims at ordering test cases to increase the rate of fault detection , which quantifies how fast faults are detected during the testing phase. A common approach for test case prioritization is to use the information of previously executed test cases, such as coverage information, resulting in an iterative (greedy) prioritization algorithm. Current research in this area validates the fact that using coverage information can improve the rate of fault detection in prioritization algorithms. The performance of such iterative prioritization schemes degrade as the number of ties encountered in prioritization steps increases. In this paper, using the notion of lexicographical ordering, we propose a new heuristic for breaking ties in coverage based techniques. Performance of the proposed technique in terms of the rate of fault detection is empirically evaluated using a wide range of programs. Results indicate that the proposed technique can resolve ties and in turn noticeably increases the rate of fault detection. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|