diplomsko delo
Jure Cetina (Author), Igor Rožanc (Mentor)

Abstract

Diplomska naloga zajema področje testiranja programske opreme z izvajanjem mutacijske analize. Mutacijska analiza oziroma testiranje se uporablja za ustvarjanje novih ali za ovrednotenje že obstoječih programskih testov. Kakovost testov se določi na način, da se v program vstavijo vnaprej definirane napake. V kolikor testi v programu odkrijejo vse napake, so učinkoviti, v nasprotnem primeru pa so testi neučinkoviti in jih je potrebno ustrezno dopolniti. V diplomski nalogi je tako podrobneje predstavljen koncept mutacijskega testiranja, postopek generiranja in testiranja mutantov z uporabo sistema MuJava in eksperiment, ki se osredotoča na aritmetični mutacijski operator. Eksperiment naslavlja problem časovne zahtevnosti mutacijskega testiranja in s pomočjo analize učinkovitosti posameznih mutacij mutacijskega operatorja AOR predlaga možne rešitve na področju optimizacije postopka generiranja mutantov.

Keywords

mutacijsko testiranje;MuJava;mutanti;mutacije;mutacijski operator;AOR;računalništvo;visokošolski strokovni študij;računalništvo in informatika;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [J. Cetina]
UDC: 004.4.05(043.2)
COBISS: 1536250563 Link will open in a new window
Views: 928
Downloads: 180
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: The efficency analysis of AOR mutation operator mutations
Secondary abstract: The thesis covers the field of software testing with the use of mutation testing. Mutation testing or mutation analysis is used to create new software tests or to evaluate the efficiency of preexisting tests. The quality of a given test is determined by injecting predefined faults into a program's source code. If the test detects faults in the program it is considered to be adequate. In contrast, if the test does not detect any inappropriate behavior it is considered to be inadequate and must therefore be adjusted. The thesis describes the concept of mutation testing in detail, demonstrates the process of generating and testing mutants with the use of the mutation testing system called MuJava and carries out an experiment that focuses on the arithmetic mutation operator. The experiment addresses the problem of runtime complexity of mutation testing and proposes possible optimization solutions in the process of generating mutants. The solutions are based on the analysis that determines the efficiency of individual mutations that are applied as part of the AOR mutation operator.
Secondary keywords: mutation testing;MuJava;mutants;mutations;mutation operator;AOR;computer science;computer and information science;diploma;
File type: application/pdf
Type (COBISS): Bachelor thesis/paper
Study programme: 1000470
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 123 str.
ID: 8739674