Universiti Teknologi Malaysia Institutional Repository

A review on search-based mutation testing

Abdul Rahman, Nor Ashila and Hassan, Rohayanti and Ahmad, Johanna and Zakaria, Noor Hidayah and Sim, Hiew Moi and Sa'adon, Nor Azizah (2022) A review on search-based mutation testing. Academia of Information Computing Research, 3 (1). pp. 1-9. ISSN 2716-6465

Full text not available from this repository.

Official URL: https://excelligentacademia.com/journal/index.php/...

Abstract

Big Data is a larger and more complex collection of datasets that exceeds the processing. In order to improve the productivity of non-testable Big Data, machine learning is able to determine various types of high volume, velocity and variety of data that need to be processed. Search-based mutation testing works by formulating the test data generation/optimization and mutant optimization problems as search problems and by applying meta-heuristic techniques to solve them. This paper aims to present the researches carried out in mutation testing particularly in search-based approaches. 205 papers were reviewed and analyzed from 2014-2018. This paper later on proceeds to elaborate on SBMT functions, First and Higher Order Mutant as well as multi-objective optimization.

Item Type:Article
Uncontrolled Keywords:Mutation Testing, Search-Based, First Order Mutant, Higher Order Mutant, Multi-objective
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computing
ID Code:104738
Deposited By: Widya Wahid
Deposited On:25 Feb 2024 04:53
Last Modified:25 Feb 2024 04:53

Repository Staff Only: item control page