• DocumentCode
    2744876
  • Title

    An Effective Path Selection Strategy for Mutation Testing

  • Author

    Papadakis, Mike ; Malevris, Nicos

  • Author_Institution
    Dept. of Inf., Athens Univ. of E.B., Athens, Greece
  • fYear
    2009
  • fDate
    1-3 Dec. 2009
  • Firstpage
    422
  • Lastpage
    429
  • Abstract
    Mutation testing has been identified as one of the most effective techniques, in detecting faults. However, because of the large number of test elements that it introduces, it is regarded as rather expensive for practical use. Therefore, there is a need for testing strategies that will alleviate this drawback by selecting effective test data that will make the technique more practical. Such a strategy based on path selection is reported in this paper. A significant influence on the efficiency associated with path selection strategies is the number of test paths that must be generated in order to achieve a specified level of coverage, and it is determined by the number of paths that are found to be feasible. Specifically, a path selection strategy is proposed that aims at reducing the effects of infeasible paths and conversely developing effective and efficient mutation based tests. The results obtained from applying the method to a set of program units are reported and analysed presenting the flexibility, feasibility and practicality of the proposed approach.
  • Keywords
    program testing; software selection; mutation testing; path selection strategy; program unit sets; test data; test paths generation; Automatic testing; Costs; Fault detection; Fault diagnosis; Genetic mutations; Informatics; Performance evaluation; Programming; Software engineering; Software testing; adequacy criterion; infeasible paths; mutation testing; path testing; software testing; unit testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering Conference, 2009. APSEC '09. Asia-Pacific
  • Conference_Location
    Penang
  • ISSN
    1530-1362
  • Print_ISBN
    978-0-7695-3909-6
  • Type

    conf

  • DOI
    10.1109/APSEC.2009.68
  • Filename
    5358804