Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Using Exploration Focused Techniques to Augment Search-Based Software Testing: An Experimental Evaluation
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.ORCID-id: 0000-0002-5179-4205
Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
2016 (engelsk)Inngår i: Proceedings - 2016 IEEE International Conference on Software Testing, Verification and Validation, ICST 2016, IEEE Computer Society, 2016, s. 69-79, artikkel-id 7515460Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
IEEE Computer Society, 2016. s. 69-79, artikkel-id 7515460
Serie
IEEE International Conference on Software Testing Verification and Validation, ISSN 2381-2834
Emneord [en]
Algorithms; Verification, Computational resources; Controlled experiment; Diverse solutions; Experimental evaluation; High dimensional spaces; High-dimensional; Limited information; Search-based software testing, Software testing
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-13094DOI: 10.1109/ICST.2016.26ISI: 000391252900007Scopus ID: 2-s2.0-84983246859ISBN: 9780306406157 (tryckt)OAI: oai:DiVA.org:bth-13094DiVA, id: diva2:1033182
Konferanse
9th IEEE International Conference on Software Testing, Verification and Validation, ICST 2016; Chicago
Tilgjengelig fra: 2016-10-06 Laget: 2016-10-03 Sist oppdatert: 2023-06-30bibliografisk kontrollert
Inngår i avhandling
1. Interactive Search-Based Software Testing: Development, Evaluation, and Deployment
Åpne denne publikasjonen i ny fane eller vindu >>Interactive Search-Based Software Testing: Development, Evaluation, and Deployment
2017 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
sted, utgiver, år, opplag, sider
Karlskrona: Blekinge Tekniska Högskola, 2017. s. 235
Serie
Blekinge Institute of Technology Doctoral Dissertation Series, ISSN 1653-2090 ; 8
Emneord
Interactive Search-Based Software Testing, Search-Based Software Testing, Search-Based Software Engineering, Industrial Validation
HSV kategori
Identifikatorer
urn:nbn:se:bth-15083 (URN)978-91-7295-341-3 (ISBN)
Disputas
2017-10-04, G340, Karlskrona, 13:15 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2017-08-31 Laget: 2017-08-30 Sist oppdatert: 2017-11-01bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Marculescu, BogdanFeldt, RobertTorkar, Rickard

Søk i DiVA

Av forfatter/redaktør
Marculescu, BogdanFeldt, RobertTorkar, Rickard
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 162 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf