SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Torkar Richard 1971)
 

Sökning: WFRF:(Torkar Richard 1971) > Using exploration f...

Using exploration focused techniques to augment search-based software testing: an experimental evaluation

Marculescu, Bogdan, 1984 (författare)
Blekinge Tekniska Högskola,Institutionen för programvaruteknik
Feldt, Robert, 1972 (författare)
Blekinge Tekniska Högskola,Institutionen för programvaruteknik
Torkar, Richard, 1971 (författare)
Blekinge Tekniska Högskola,Gothenburg University,Göteborgs universitet,Institutionen för data- och informationsteknik (GU),Department of Computer Science and Engineering (GU),Institutionen för programvaruteknik
 (creator_code:org_t)
ISBN 9781509018277
IEEE, 2016
2016
Engelska.
Ingår i: 2016 IEEE International Conference on Software Testing, Verification and Validation (ICST). - : IEEE. - 2381-2834. - 9781509018277 - 9780306406157 ; , s. 69-79
  • Konferensbidrag (refereegranskat)
Abstract Ämnesord
Stäng  
  • 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 whichexploration-based algorithms can be used tocomplement 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-basedalgorithms 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.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Programvaruteknik (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Software Engineering (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Electrical & Electronic
Engineering
Software Engineering
Computer Science
search-based software testing

Publikations- och innehållstyp

kon (ämneskategori)
ref (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy