Forest Optimization-Based Test Case Generation for Multiple Paths With Metamorphic Relations

In general multiple paths are covered by multiple runs which is a time consuming task. Now a days, metaheuristic techniques are widely used for path coverage. In order to reduce the time, an efficient method is proposed based on Forest Optimization Algorithm (FOA) with Metamorphic Relations (MRs) th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of applied metaheuristic computing 2022-01, Vol.13 (1), p.1-18
Hauptverfasser: Sahoo, Rashmi Rekha, Ray, Mitrabinda
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In general multiple paths are covered by multiple runs which is a time consuming task. Now a days, metaheuristic techniques are widely used for path coverage. In order to reduce the time, an efficient method is proposed based on Forest Optimization Algorithm (FOA) with Metamorphic Relations (MRs) that cover multiple paths at a time in one run unlike the traditional search based testing. In the proposed approach, initial test case is generated using FOA, the successive test cases are generated using MRs without undergoing several runs. The motive of using FOA is that the searching mechanism of this algorithm having resemblance with the branch / path coverage techniques of testing. To the best of our knowledge, FOA has not been implemented in software testing. The experimental results are compared with three existing work. The efficiency of simply FOA is also shown how it able to cover multiple paths. The results show that FOA with MRs is more efficient in terms of time consumption and number of paths covered.
ISSN:1947-8283
1947-8291
DOI:10.4018/IJAMC.292503