Constraint-based heuristic algorithms for software test generation

Basit Öğe Kaydı
dc.authorscopusidBahman Arasteh / 39861139000
dc.authorwosidBahman Arasteh / AAN-9555-2021
dc.contributor.authorArasteh, Bahman
dc.contributor.authorAghaei, Babak
dc.contributor.authorGhanbarzadeh, Reza
dc.contributor.authorKalan, Reza
dc.date.accessioned2025-04-18T10:29:53Z
dc.date.available2025-04-18T10:29:53Z
dc.date.issued2024
dc.departmentİstinye Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Yazılım Mühendisliği Bölümü
dc.description.abstractWhile software testing is essential for enhancing a software system's quality, it can be time-consuming and costly during developing software. Automation of software testing can help solve this problem, streamlining time-consuming testing tasks. However, generating automated test data that maximally covers program branches is a complex optimization problem referred to as NP-complete and should be addressed appropriately. Although a variety of heuristic algorithms have already been suggested to create test suites with the greatest coverage, they have issues such as insufficient branch coverage, low rate of success in generating test data with high coverage, and unstable results. The main objective of the current chapter is to investigate and compare the coverage, success rate (SR), and stability of various heuristic algorithms in software structural test generation. To achieve this, the effectiveness of seven algorithms, genetic algorithm (GA), simulated annealing (SA), ant colony optimizer (ACO), particle swarm optimizer (PSO), artificial bee colony (ABC), shuffle frog leaping algorithm (SFLA), and imperialist competitive algorithm (ICA), are examined in automatically generating test data, and their performance is compared on the basis of various criteria. The experiment results demonstrate the superiority of the SFLA, ABC, and ICA to other examined algorithms. Overall, SFLA outperforms all other algorithms in coverage, SR, and stability. © 2024 Elsevier Inc. All rights reserved.
dc.identifier.citationArasteh, B., Aghaei, B., Ghanbarzadeh, R., & Kalan, R. (2024). Constraint-based heuristic algorithms for software test generation. In Decision-Making Models (pp. 111-123). Academic Press.
dc.identifier.doi10.1016/B978-0-443-16147-6.00022-0
dc.identifier.endpage123
dc.identifier.isbn978-044316147-6, 978-044316148-3
dc.identifier.scopus2-s2.0-85202797415
dc.identifier.scopusqualityN/A
dc.identifier.startpage111
dc.identifier.urihttps://hdl.handle.net/20.500.12713/7091
dc.indekslendigikaynakScopus
dc.institutionauthorArasteh, Bahman
dc.institutionauthoridBahman Arasteh / 0000-0001-5202-6315
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofDecision-Making Models: A Perspective of Fuzzy Logic and Machine Learning
dc.relation.publicationcategoryKitap Bölümü - Uluslararası
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectAutomated Test Data Generation
dc.subjectBranch Coverage
dc.subjectConstraint-Based Heuristic Algorithms
dc.subjectSoftware Testing
dc.titleConstraint-based heuristic algorithms for software test generation
dc.typeBook Chapter

Dosyalar

Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.17 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Yazılım Mühendisliği Bölümü Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu