Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
8-2013
Abstract
Automated random testing has been shown to be effective at finding faults in a variety of contexts and is deployed in several testing frameworks. AutoTest is one such framework, targeting programs written in Eiffel, an object-oriented language natively supporting executable pre- and postconditions; these respectively serving as test filters and test oracles. In this paper, we propose the integration of search-based techniques—along the lines of Tracey—to try and guide the tool towards input data that leads to violations of the postconditions present in the code; input data that random testing alone might miss, or take longer to find. Furthermore, we propose to minimise the performance impact of this extension by applying GPU programming to amenable parts of the computation.
Discipline
Theory and Algorithms
Research Areas
Software and Cyber-Physical Systems
Publication
Search Based Software Engineering: 5th International Symposium, SSBSE 2013, St. Petersburg, Russia, August 24-26, Proceedings
Volume
8084
First Page
318
Last Page
323
ISBN
9783642397424
Identifier
10.1007/978-3-642-39742-4_31
Publisher
Springer
City or Country
Berlin
Citation
KOLESNICHENKO, Alexey; POSKITT, Christopher M.; and MEYER, Bertrand.
Applying search in an automatic contract-based testing tool. (2013). Search Based Software Engineering: 5th International Symposium, SSBSE 2013, St. Petersburg, Russia, August 24-26, Proceedings. 8084, 318-323.
Available at: https://ink.library.smu.edu.sg/sis_research/4915
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/978-3-642-39742-4_31