Reduce First, Debug Later

Alexander Elyasov, I.S.W.B. Prasetya, J Hage, A. Nikas

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    The delta debugging minimization algorithm ddmin provides an efficient procedure for the simplification of failing test-cases. Despite its contribution towards the automation of debugging, ddmin still requires a significant number of iterations to complete. The delta debugging (DD) search space can be narrowed down by providing the test-case circumstances that are most likely relevant to the occurred failure. This paper proposes a novel approach to the problem of failure simplification consisting of two consecutive phases: 1) failure reduction by rewriting (performed offline), and 2) DD invocation (performed online). In the best case scenario, the reduction phase may already deliver a simplified failure, otherwise, it potentially supplies DD with extra information about where to look for the failure. The proposed solution has been prototyped as a web application debugging tool, which was evaluated on a shopping cart web application - Flex Store. The evaluation shows an improvement of the DD execution time if the offline reduction over-approximates the failure.
    Original languageEnglish
    Title of host publication9th International Workshop on Automation of Software Test,
    PublisherAssociation for Computing Machinery
    Pages57-63
    Number of pages7
    DOIs
    Publication statusPublished - 2014

    Bibliographical note

    Conference



    ICSE '14 36th International Conference on Software Engineering



    Hyderabad, India — May 31 - June 07, 2014

    Fingerprint

    Dive into the research topics of 'Reduce First, Debug Later'. Together they form a unique fingerprint.

    Cite this