Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1109/ICGEC.2012.124guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Reducing the Cost of Regression Testing by Identifying Irreplaceable Test Cases

Published: 25 August 2012 Publication History

Abstract

Test suite reduction techniques decrease the cost of software testing by removing the redundant test cases from the test suite while still producing a reduced set of tests that yields the same level of code coverage as the original suite. Most of the existing approaches to reduction aim to decrease the size of the test suite. Yet, the difference in the execution cost of the tests is often significant and it may be costly to use a test suite consisting of a few long-running test cases. Thus, this paper proposes an algorithm, based on the concept of test irreplaceability, which creates a reduced test suite with a decreased execution cost. Leveraging widely used benchmark programs, the empirical study shows that, in comparison to existing techniques, the presented algorithm is the most effective at reducing the cost of running a test suite.

Cited By

View all
  • (2017)Empirically evaluating Greedy-based test suite reduction methods at different levels of test suite complexityScience of Computer Programming10.1016/j.scico.2017.05.004150:C(1-25)Online publication date: 15-Dec-2017
  • (2014)FLOWER: optimal test suite reduction as a network maximum flowProceedings of the 2014 International Symposium on Software Testing and Analysis10.1145/2610384.2610416(171-180)Online publication date: 21-Jul-2014
  1. Reducing the Cost of Regression Testing by Identifying Irreplaceable Test Cases

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    ICGEC '12: Proceedings of the 2012 Sixth International Conference on Genetic and Evolutionary Computing
    August 2012
    599 pages
    ISBN:9780769547633

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 25 August 2012

    Author Tags

    1. code coverage
    2. regression testing
    3. test suite reduction

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 14 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)Empirically evaluating Greedy-based test suite reduction methods at different levels of test suite complexityScience of Computer Programming10.1016/j.scico.2017.05.004150:C(1-25)Online publication date: 15-Dec-2017
    • (2014)FLOWER: optimal test suite reduction as a network maximum flowProceedings of the 2014 International Symposium on Software Testing and Analysis10.1145/2610384.2610416(171-180)Online publication date: 21-Jul-2014

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media