Reducing the effects of infeasible paths in branch testing
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
A Fortran language system for mutation-based software testing
Software—Practice & Experience
Constraint-Based Automatic Test Data Generation
IEEE Transactions on Software Engineering
Mutation analysis using mutant schemata
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
An experimental determination of sufficient mutant operators
ACM Transactions on Software Engineering and Methodology (TOSEM)
An experimental evaluation of data flow and mutation testing
Software—Practice & Experience
Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture
The dynamic domain reduction procedure for test data generation
Software—Practice & Experience
Symbolic execution and program testing
Communications of the ACM
Mutation 2000: uniting the orthogonal
Mutation testing for the new century
More Experience with Data Flow Testing
IEEE Transactions on Software Engineering
An Empirical Evaluation of Weak Mutation
IEEE Transactions on Software Engineering
SELECT—a formal system for testing and debugging programs by symbolic execution
Proceedings of the international conference on Reliable software
Automatic Unit Test Data Generation Using Mixed-Integer Linear Programming and Execution Trees
ICSM '99 Proceedings of the IEEE International Conference on Software Maintenance
A Unified Symbolic Execution System
AICCSA '01 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications
Search-based software test data generation: a survey: Research Articles
Software Testing, Verification & Reliability
MuJava: an automated class mutation system: Research Articles
Software Testing, Verification & Reliability
A new script language applicable to symbolic execution systems
International Journal of Computers and Applications
An objective comparison of the cost effectiveness of three testing methods
Information and Software Technology
Automatic mutation test input data generation via ant colony
Proceedings of the 9th annual conference on Genetic and evolutionary computation
On Two Problems in the Generation of Program Test Paths
IEEE Transactions on Software Engineering
On Path Cover Problems in Digraphs and Applications to Program Testing
IEEE Transactions on Software Engineering
Weak Mutation Testing and Completeness of Test Sets
IEEE Transactions on Software Engineering
Testing Programs with the Aid of a Compiler
IEEE Transactions on Software Engineering
All-Paths Test Generation for Programs with Internal Aliases
ISSRE '08 Proceedings of the 2008 19th International Symposium on Software Reliability Engineering
ICSTW '09 Proceedings of the IEEE International Conference on Software Testing, Verification, and Validation Workshops
Information and Software Technology
HAMPI: a solver for string constraints
Proceedings of the eighteenth international symposium on Software testing and analysis
Test-Suite Augmentation for Evolving Software
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
A survey of new trends in symbolic execution for software testing and analysis
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on HVC 07
An Effective Path Selection Strategy for Mutation Testing
APSEC '09 Proceedings of the 2009 16th Asia-Pacific Software Engineering Conference
An Empirical Evaluation of the First and Second Order Mutation Testing Strategies
ICSTW '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification, and Validation Workshops
A Symbolic Execution Tool Based on the Elimination of Infeasible Paths
ICSEA '10 Proceedings of the 2010 Fifth International Conference on Software Engineering Advances
Automatic Mutation Test Case Generation via Dynamic Symbolic Execution
ISSRE '10 Proceedings of the 2010 IEEE 21st International Symposium on Software Reliability Engineering
Symbolic execution for software testing in practice: preliminary assessment
Proceedings of the 33rd International Conference on Software Engineering
Symbolic execution with mixed concrete-symbolic solving
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Strong higher order mutation-based test data generation
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
An Analysis and Survey of the Development of Mutation Testing
IEEE Transactions on Software Engineering
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Mutation-Driven Generation of Unit Tests and Oracles
IEEE Transactions on Software Engineering
An investigation of 'build vs. buy' decision for software acquisition by small to medium enterprises
Information and Software Technology
Mutation-oriented test data augmentation for GUI software fault localization
Information and Software Technology
Hi-index | 0.00 |
Context: Generally, mutation analysis has been identified as a powerful testing method. Researchers have shown that its use as a testing criterion exercises quite thoroughly the system under test while it achieves to reveal more faults than standard structural testing criteria. Despite its potential, mutation fails to be adopted in a widespread practical use and its popularity falls significantly short when compared with other structural methods. This can be attributed to the lack of thorough studies dealing with the practical problems introduced by mutation and the assessment of the effort needed when applying it. Such an incident, masks the real cost involved preventing the development of easy and effective to use strategies to circumvent this problem. Objective: In this paper, a path selection strategy for selecting test cases able to effectively kill mutants when performing weak mutation testing is presented and analysed. Method: The testing effort is highly correlated with the number of attempts the tester makes in order to generate adequate test cases. Therefore, a significant influence on the efficiency associated with a test case generation strategy greatly depends on the number of candidate paths selected in order to achieve a predefined coverage goal. The effort can thus be related to the number of infeasible paths encountered during the test case generation process. Results: An experiment, investigating well over 55 million of program paths is conducted based on a strategy that alleviates the effects of infeasible paths. Strategy details, along with a prototype implementation are reported and analysed through the experimental results obtained by its employment to a set of program units. Conclusion: The results obtained suggest that the strategy used can play an important role in making the mutation testing method more appealing and practical.