SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Neto Felix)
 

Sökning: WFRF:(Neto Felix) > Automated black-box...

Automated black-box boundary value detection

Dobslaw, Felix, 1983- (författare)
Mittuniversitetet,Institutionen för kommunikation, kvalitetsteknik och informationssystem (2023-),Software Engineering and Education
Feldt, Robert (författare)
Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Västra Götaland, Sweden
Gomes de Oliveira Neto, Francisco (författare)
Department of Computer Science and Engineering, University of Gothenburg, Gothenburg, Västra Götaland, Sweden
 (creator_code:org_t)
PeerJ, 2023
2023
Engelska.
Ingår i: PeerJ Computer Science. - : PeerJ. - 2376-5992. ; 9
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Abstract  Software systems typically have an input domain that can be subdivided into sub-domains, each of which generates similar or related outputs. Testing it on the boundaries between these sub-domains is critical to ensure high-quality software. Therefore, boundary value analysis and testing have been a fundamental part of the software testing toolbox for a long time and are typically taught early to software engineering students. Despite its many argued benefits, boundary value analysis for a given software specification or application is typically described in abstract terms. This allows for variation in how testers apply it and in the benefits they see. Additionally, its adoption has been limited since it requires a specification or model to be analysed. We propose an automated black-box boundary value detection method to support software testers in performing systematic boundary value analysis. This dynamic method can be utilized even without a specification or model. The proposed method is based on a metric referred to as the program derivative, which quantifies the level of boundariness of test inputs. By combining this metric with search algorithms, we can identify and rank pairs of inputs as good boundary candidates, i.e., inputs that are in close proximity to each other but with outputs that are far apart. We have implemented the AutoBVA approach and evaluated it on a curated dataset of example programs. Furthermore, we have applied the approach broadly to a sample of 613 functions from the base library of the Julia programming language. The approach could identify boundary candidates that highlight diverse boundary behaviours in over 70% of investigated systems under test. The results demonstrate that even a simple variant of the program derivative, combined with broad sampling and search over the input space, can identify interesting boundary candidates for a significant portion of the functions under investigation. In conclusion, we also discuss the future extension of the approach to encompass more complex systems under test cases and datatypes. 

Ämnesord

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

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Dobslaw, Felix, ...
Feldt, Robert
Gomes de Oliveir ...
Om ämnet
NATURVETENSKAP
NATURVETENSKAP
och Data och informa ...
och Programvarutekni ...
Artiklar i publikationen
PeerJ Computer S ...
Av lärosätet
Mittuniversitetet

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