- Program Chairs:
- Gregory Gay,
- Giuliano Antoniol
There is a growing realization that optimization can be applied to many aspects of the software development process - a research area known as Search- Based Software Engineering (SBSE). Search- Based Software Testing - one of the largest research areas within SBSE - is the process of using searchbased optimization algorithms to specifically address problems in software testing. SBST has been applied to a wide variety of testing goals including structural, functional, non-functional and state-based properties. Many approaches to testing and a wide diverse range of development domains have been addressed, including exceptions, interactions, integration, mutation, regression, and web applications.
Work in SBST has developed to the point at which it is now ripe for combination with other areas of software engineering. The common "lingua franca" that makes these combinations possible is the definition of the fitness function that guides a search algorithm. A fitness function is merely a form of metric, and metrics exist across the entire software engineering spectrum. Therefore, the central objective of this workshop is to bring together researchers and industrial practitioners from SBST and the wider software engineering community to share experience and provide directions for future research, and to encourage the use of search techniques to combine aspects of testing with other aspects of the software engineering lifecycle.
Proceeding Downloads
Broadening the search in search-based software testing: it need not be evolutionary
Search-based software testing (SBST) can potentially help software practitioners create better test suites using less time and resources by employing powerful methods for search and optimization. However, research on SBST has typically focused on only a ...
An empirical analysis of providing assurance for self-adaptive systems at different levels of abstraction in the face of uncertainty
Self-adaptive systems (SAS) must frequently continue to deliver acceptable behavior at run time even in the face of uncertainty. Particularly, SAS applications can self-reconfigure in response to changing or unexpected environmental conditions and must ...
Hyperheuristic search for SBST
This paper argues that incorporating hyperheuristic techniques into existing SBST approaches could help to increase their applicability and generality. We propose a general two layer selective hyperheuristic approach for SBST and provide an example of ...
Constraints: the future of combinatorial interaction testing
Combinatorial Interaction Testing (CIT) has gained a lot of attention in the area of software engineering in the last few years. CIT problems have their roots in combinatorics. Mathematicians have been concerned with the NP-complete problem of finding ...
Unit testing tool competition: round three
This paper describes the third round of the Java Unit Testing Tool Competition. This edition of the contest evaluates no less than seven automated testing tools! And, like during the second round, test suites written by human testers are also used for ...
EvoSuite at the SBST 2015 tool competition
EvoSuite is a mature research prototype that automatically generates unit tests for Java code. This paper summarizes the results and experiences of EvoSuite's participation at the third unit testing competition at SBST 2015. An unfortunate issue of ...
Results for EvoSuite-MOSA at the third unit testing tool competition
EvoSuite-MOSA is a unit test data generation tool that employs a novel many-objective optimization algorithm suitably developed for branch coverage. It was implemented by extending the EvoSuite test data generation tool. In this paper we present the ...
Using dynamic symbolic execution to generate inputs in search-based GUI testing
Search-based testing has been successfully applied to generate complex sequences of events for graphical user interfaces (GUIs), but typically relies on simple heuristics or random values for data widgets like text boxes. This may greatly reduce the ...
Meta-heuristic generation of robust XPath locators for web testing
Test scripts used for web testing rely on DOM locators, often expressed as XPaths, to identify the active web page elements and the web page data to be used in assertions. When the web application evolves, the major cost incurred for the evolution of ...
A novelty search approach for automatic test data generation
In search-based structural testing, metaheuristic search techniques have been frequently used to automate the test data generation. In Genetic Algorithms (GAs) for example, test data are rewarded on the basis of an objective function that represents ...
T3: benchmarking at third unit testing tool contest
T3 is a light weight automated unit testing tool for Java. This paper presents the result of benchmarking of T3 at the 3rd Java Unit Testing Tool Contest organized at the 8th International Workshop on Search-Based Software Testing (SBST) in 2015.
GRT at the SBST 2015 tool competition
GRT (Guided Random Testing) is an automatic test generation tool for Java code, which leverages static and dynamic program analysis to guide run-time test generation. In this paper, we summarize competition results and experiences of GRT in ...
JTExpert at the third unit testing tool competition
JTExpert is a software testing tool that automatically generates a whole test suite to satisfy the branch-coverage criterion on a given Java source code. It takes as inputs a Java source code and its dependencies and automatically produces a test-case ...
Recommendations
8th international workshop on search-based software testing (SBST 2015)
ICSE '15: Proceedings of the 37th International Conference on Software Engineering - Volume 2This paper is a report on the 8th International Workshop on Search-Based Software Testing at the 37th International Conference on Sofrware Engineering (ICSE). Search-Based Software Testing (SBST) is a form of Search-Based Software Engineering (SBSE) ...