• Türkçe
    • English
  • Türkçe 
    • Türkçe
    • English
  • Giriş
Öğe Göster 
  •   DSpace@FSM Vakıf
  • Fakülteler / Faculties
  • Mühendislik Fakültesi / Faculty of Engineering
  • Bilgisayar Mühendisliği Bölümü
  • Öğe Göster
  •   DSpace@FSM Vakıf
  • Fakülteler / Faculties
  • Mühendislik Fakültesi / Faculty of Engineering
  • Bilgisayar Mühendisliği Bölümü
  • Öğe Göster
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Novel Metaheuristic Based Method for Software Mutation Test Using the Discretized and Modified Forrest Optimization Algorithm

Thumbnail

Göster/Aç

Ana makale (2.772Mb)

Erişim

info:eu-repo/semantics/embargoedAccess

Tarih

2023

Yazar

Arasteh, Bahman
Gharehchopogh, Farhad Soleimanian
Güneş, Peri
Kiani, Farzad
Torkamanian‑Afshar, Mahsa

Üst veri

Tüm öğe kaydını göster

Künye

ARASTEH, Bahman, Farhad Soleimanian GHAREHCHOPOGH, Peri GÜNEŞ, Farzad KİANİ & Mahsa TORKAMANİAN‑AFSHAR. "A Novel Metaheuristic Based Method for Software Mutation Test Using the Discretized and Modified Forrest Optimization Algorithm." Journal of Electronic Testing, (2023).

Özet

The number of detected bugs by software test data determines the efficacy of the test data. One of the most important topics in software engineering is software mutation testing, which is used to evaluate the efficiency of software test methods. The syntactical modifications are made to the program source code to make buggy (mutated) programs, and then the resulting mutants (buggy programs) along with the original programs are executed with the test data. Mutation testing has several drawbacks, one of which is its high computational cost. Higher execution time of mutation tests is a challenging problem in the software engineering field. The major goal of this work is to reduce the time and cost of mutation testing. Mutants are inserted in each instruction of a program using typical mutation procedures and tools. Meanwhile, in a real-world program, the likelihood of a bug occurrence in the simple and non-bug-prone sections of a program is quite low. According to the 80–20 rule, 80 percent of a program's bugs are discovered in 20% of its fault-prone code. The first stage of the suggested solution uses a discretized and modified version of the Forrest optimization algorithm to identify the program's most bug-prone paths; the second stage injects mutants just in the identified bug-prone instructions and data. In the second step, the mutation operators are only injected into the identified instructions and data that are bug-prone. Studies on standard benchmark programs have shown that the proposed method reduces about 27.63% of the created mutants when compared to existing techniques. If the number of produced mutants is decreased, the cost of mutation testing will also decrease. The proposed method is independent of the platform and testing tool. The results of the experiments confirm that the use of the proposed method in each testing tool such as Mujava, Muclipse, Jester, and Jumble makes a considerable mutant reduction.

Kaynak

Journal of Electronic Testing

Bağlantı

https://hdl.handle.net/11352/4592

Koleksiyonlar

  • Bilgisayar Mühendisliği Bölümü [214]
  • Scopus İndeksli Yayınlar / Scopus Indexed Publications [756]
  • WOS İndeksli Yayınlar / WOS Indexed Publications [661]



DSpace software copyright © 2002-2015  DuraSpace
İletişim | Geri Bildirim
Theme by 
@mire NV
 

 




| Politika | Rehber | İletişim |

DSpace@FSM

by OpenAIRE
Gelişmiş Arama

sherpa/romeo

Göz at

Tüm DSpaceBölümler & KoleksiyonlarTarihe GöreYazara GöreBaşlığa GöreKonuya GöreTüre GöreDile GöreBölüme GöreKategoriye GöreYayıncıya GöreErişim ŞekliKurum Yazarına GöreBu KoleksiyonTarihe GöreYazara GöreBaşlığa GöreKonuya GöreTüre GöreDile GöreBölüme GöreKategoriye GöreYayıncıya GöreErişim ŞekliKurum Yazarına Göre

Hesabım

GirişKayıt

İstatistikler

Google Analitik İstatistiklerini Görüntüle

DSpace software copyright © 2002-2015  DuraSpace
İletişim | Geri Bildirim
Theme by 
@mire NV
 

 


|| Politika || Rehber || Kütüphane || FSM Vakıf Üniversitesi || OAI-PMH ||

FSM Vakıf Üniversitesi, İstanbul, Türkiye
İçerikte herhangi bir hata görürseniz, lütfen bildiriniz:

Creative Commons License
FSM Vakıf Üniversitesi Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace@FSM:


DSpace 6.2

tarafından İdeal DSpace hizmetleri çerçevesinde özelleştirilerek kurulmuştur.