Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Automated Software Test Data Generation
IEEE Transactions on Software Engineering
Software Testing Techniques
Generating Software Test Data by Evolution
IEEE Transactions on Software Engineering
An Automated Framework for Structural Test-Data Generation
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Evolutionary testing of classes
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
DART: directed automated random testing
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
CUTE: a concolic unit testing engine for C
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
A multi-objective approach to search-based test data generation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
The impact of input domain reduction on search-based test data generation
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Predictive models for the breeder genetic algorithm i. continuous parameter optimization
Evolutionary Computation
Handling dynamic data structures in search based testing
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Pex: white box test generation for .NET
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
A Theoretical and Empirical Study of Search-Based Testing: Local, Global, and Hybrid Search
IEEE Transactions on Software Engineering
It Does Matter How You Normalise the Branch Distance in Search Based Software Testing
ICST '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification and Validation
An empirical investigation into branch coverage for C programs using CUTE and AUSTIN
Journal of Systems and Software
FloPSy: search-based floating point constraint solving for symbolic execution
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
CUTE and jCUTE: concolic unit testing and explicit path model-checking tools
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Execution generated test cases: how to make systems code crash itself
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
IEEE Transactions on Software Engineering
Mutation based test case generation via a path selection strategy
Information and Software Technology
Grouping target paths for evolutionary generation of test data in parallel
Journal of Systems and Software
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Boosting search based testing by using constraint based testing
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
An orchestrated survey of methodologies for automated software test case generation
Journal of Systems and Software
Information and Software Technology
Hi-index | 0.00 |
We present an algorithm for constructing fitness functions that improve the efficiency of search-based testing when trying to generate branch adequate test data. The algorithm combines symbolic information with dynamic analysis and has two key advantages: It does not require any change in the underlying test data generation technique and it avoids many problems traditionally associated with symbolic execution, in particular the presence of loops. We have evaluated the algorithm on industrial closed source and open source systems using both local and global search-based testing techniques, demonstrating that both are statistically significantly more efficient using our approach. The test for significance was done using a one-sided, paired Wilcoxon signed rank test. On average, the local search requires 23.41% and the global search 7.78% fewer fitness evaluations when using a symbolic execution based fitness function generated by the algorithm.