Tree Preprocessing and Test Outcome Caching for Efficient Hierarchical Delta Debugging

Test case reduction has been automated since the introduction of the minimizing Delta Debugging algorithm, but improving the efficiency of reduction is still the focus of research. This paper focuses on Hierarchical Delta Debugging, already an improvement over the original technique, and describes h...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2017 IEEE/ACM 12th International Workshop on Automation of Software Testing (AST) s. 23 - 29
Hlavní autoři: Hodovan, Renata, Kiss, Akos, Gyimothy, Tibor
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2017
Témata:
caching
Debugging
Grammar
HDD
Minimization
Optimization
preprocessing
Syntactics
Testing
tree
Vegetation
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Test case reduction has been automated since the introduction of the minimizing Delta Debugging algorithm, but improving the efficiency of reduction is still the focus of research. This paper focuses on Hierarchical Delta Debugging, already an improvement over the original technique, and describes how its input tree and caching approach can be changed for higher efficiency. The proposed optimizations were evaluated on artificial and real test cases of 6 different input formats, and achieved an average 45% drop in the number of testing steps needed to reach the minimized results - with the best improvement being as high as 82%, giving a more than 5-fold speedup.
DOI:10.1109/AST.2017.4