Coarse Hierarchical Delta Debugging

This paper introduces the Coarse Hierarchical Delta Debugging algorithm for efficient test case reduction. It can be used as a test case simplification algorithm in its own right if theoretical minimality is not a strict requirement, or it can act as a preprocessing step to the original Hierarchical...

Full description

Saved in:
Bibliographic Details
Published in:ICSME 2017 : proceedings : 2017 IEEE International Conference on Software Maintenance and Evolution : 19-22 September 2017, Shanghai, China pp. 194 - 203
Main Authors: Hodovan, Renata, Kiss, Akos, Gyimothy, Tibor
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2017
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces the Coarse Hierarchical Delta Debugging algorithm for efficient test case reduction. It can be used as a test case simplification algorithm in its own right if theoretical minimality is not a strict requirement, or it can act as a preprocessing step to the original Hierarchical Delta Debugging algorithm. Evaluation of artificial and real test cases shows that a coarse variant can produce reduced test cases with significantly fewer testing steps than the original algorithm (58% gain on average, 79% maximum), while still keeping the outputs acceptably small (never increasing the reduced test cases by more than 0.36% of the input).
DOI:10.1109/ICSME.2017.26