Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Using Exploration Focused Techniques to Augment Search-Based Software Testing: An Experimental Evaluation
Blekinge Institute of Technology, Faculty of Computing, Department of Software Engineering.
Blekinge Institute of Technology, Faculty of Computing, Department of Software Engineering.
Blekinge Institute of Technology, Faculty of Computing, Department of Software Engineering.
2016 (English)In: Proceedings - 2016 IEEE International Conference on Software Testing, Verification and Validation, ICST 2016, IEEE Computer Society, 2016, 69-79 p., 7515460Conference paper, Published paper (Refereed)
Abstract [en]

Search-based software testing (SBST) often uses objective-based approaches to solve testing problems. There are, however, situations where the validity and completeness of objectives cannot be ascertained, or where there is insufficient information to define objectives at all. Incomplete or incorrect objectives may steer the search away from interesting behavior of the software under test (SUT) and from potentially useful test cases. This papers investigates the degree to which exploration-based algorithms can be used to complement an objective-based tool we have previously developed and evaluated in industry. In particular, we would like to assess how exploration-based algorithms perform in situations where little information on the behavior space is available a priori. We have conducted an experiment comparing the performance of an exploration-based algorithm with an objective-based one on a problem with a high-dimensional behavior space. In addition, we evaluate to what extent that performance degrades in situations where computational resources are limited. Our experiment shows that exploration-based algorithms are useful in covering a larger area of the behavior space and result in a more diverse solution population. Typically, of the candidate solutions that exploration-based algorithms propose, more than 80% were not covered by their objective-based counterpart. This increased diversity is present in the resulting population even when computational resources are limited. We conclude that exploration-focused algorithms are a useful means of investigating high-dimensional spaces, even in situations where limited information and limited resources are available.

Place, publisher, year, edition, pages
IEEE Computer Society, 2016. 69-79 p., 7515460
Series
IEEE International Conference on Software Testing Verification and Validation, ISSN 2381-2834
Keyword [en]
Algorithms; Verification, Computational resources; Controlled experiment; Diverse solutions; Experimental evaluation; High dimensional spaces; High-dimensional; Limited information; Search-based software testing, Software testing
National Category
Software Engineering
Identifiers
URN: urn:nbn:se:bth-13094DOI: 10.1109/ICST.2016.26ISI: 000391252900007Scopus ID: 2-s2.0-84983246859ISBN: 9780306406157 (print)OAI: oai:DiVA.org:bth-13094DiVA: diva2:1033182
Conference
9th IEEE International Conference on Software Testing, Verification and Validation, ICST 2016; Chicago
Available from: 2016-10-06 Created: 2016-10-03 Last updated: 2017-08-30Bibliographically approved
In thesis
1. Interactive Search-Based Software Testing: Development, Evaluation, and Deployment
Open this publication in new window or tab >>Interactive Search-Based Software Testing: Development, Evaluation, and Deployment
2017 (English)Doctoral thesis, comprehensive summary (Other academic)
Place, publisher, year, edition, pages
Karlskrona: Blekinge Tekniska Högskola, 2017. 235 p.
Series
Blekinge Institute of Technology Doctoral Dissertation Series, ISSN 1653-2090 ; 8
Keyword
Interactive Search-Based Software Testing, Search-Based Software Testing, Search-Based Software Engineering, Industrial Validation
National Category
Computer Systems
Identifiers
urn:nbn:se:bth-15083 (URN)978-91-7295-341-3 (ISBN)
Public defence
2017-10-04, G340, Karlskrona, 13:15 (English)
Opponent
Supervisors
Available from: 2017-08-31 Created: 2017-08-30 Last updated: 2017-09-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Marculescu, BogdanFeldt, RobertTorkar, Rickard
By organisation
Department of Software Engineering
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 66 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf