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.
|
