An Optimal Solution for Test Case Generation Using ROBDD Graph and PSO Algorithm

被引:15
|
作者
Kalaee, Akram [1 ]
Rafe, Vahid [1 ]
机构
[1] Arak Univ, Dept Comp Engn, Fac Engn, Arak 3815688349, Iran
关键词
test case generation; specification-based testing; cause-effect graph testing; reduced ordered binary decision diagram; COVERING ARRAYS; STRATEGY; BOUNDS;
D O I
10.1002/qre.1934
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Software testing is one of the most important techniques to examine the behavior of the software products to assure their quality. An effective and efficient testing approach must balance two important but conflicting requirements. One of them is the accuracy that needs a large number of test cases for testing, and the second one is reducing the time and cost, which requires a few test cases. Even for small software, the number of possible test cases is typically very large, and exhaustive testing is impractical. Hence, selecting appropriate test suite is necessary. Cause-effect graph testing is a common black-box testing technique, which is equivalently representing Boolean relations between input parameters. However, the other traditional black-box strategies cannot identify the relations that it may result in loss of some of the important test cases. Although the cause-effect graph is regarded very promising in specification testing, it is observed that most of the proposed approaches using the graph are complex or generate impossible and a large number of test cases. This observation has motivated our research to propose an efficient strategy to generate minimal test suite that simultaneously achieves high coverage of input parameters. To do so, at first, we identify major effects from the cause-effect graph using reduced ordered binary decision diagram (ROBDD). ROBDD makes the related Boolean expression of the graph concise and obtains a unique representation of the expression. Using the ROBDD, it is possible to reduce the size of the generated test suite and to perform testing faster. After that, our proposed method utilizes particle swarm optimization (PSO) algorithm to select the optimal test suite, which covers all pairwise combinations of input parameters. The experimental results show that our approach simultaneously achieves high efficacy and reduces cost of testing by selecting appropriate test cases, respectively, to both test size and coverage size. Also, it outperforms some existing state-of-the-art strategies in the black-box testing. Copyright (c) 2015 John Wiley & Sons, Ltd.
引用
收藏
页码:2263 / 2279
页数:17
相关论文
共 50 条
  • [31] Optimal PMUs Placement Using Hybrid PSO-GSA Algorithm
    Laouid, Abdelkader Azzeddine
    Rezaoui, Mohamed Mounir
    Kouzou, Abdellah
    Mohammedi, Ridha Djamel
    2019 4TH INTERNATIONAL CONFERENCE ON POWER ELECTRONICS AND THEIR APPLICATIONS (ICPEA), 2019,
  • [32] Test Case Generation and Optimization for Critical Path Testing Using Genetic Algorithm
    Mishra, Deepti Bala
    Mishra, Rajashree
    Das, Kedar Nath
    Acharya, Arup Abhinna
    SOFT COMPUTING FOR PROBLEM SOLVING, 2019, 817 : 67 - 80
  • [33] Optimal placement of wind turbines using NSC-PSO algorithm
    Anescu, George
    PROCEEDINGS OF THE 2016 INTERNATIONAL SYMPOSIUM ON INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (INISTA), 2016,
  • [34] Cuckoo Search in Test Case Generation and Conforming Optimality Using Firefly Algorithm
    Choudhary, Kavita
    Gigras, Yogita
    Shilpa
    Rani, Payal
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION TECHNOLOGIES, IC3T 2015, VOL 2, 2016, 380 : 781 - 791
  • [35] Optimal DG Allocations in the Distribution Networks using an Improved PSO Algorithm
    M'dioud, Meriem
    Bannari, Rachid
    Elkafazi, Ismail
    INTERNATIONAL JOURNAL OF RENEWABLE ENERGY RESEARCH, 2022, 12 (03): : 1520 - 1531
  • [36] A Solution to Graph Coloring Problem Using Genetic Algorithm
    Malhotra, Karan
    Vasa, Karan D.
    Chaudhary, Neha
    Vishnoi, Ankit
    Sapra, Varun
    EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS, 2024, 11 (06):
  • [37] A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition
    Beresnev V.L.
    Melnikov A.A.
    Journal of Applied and Industrial Mathematics, 2019, 13 (02): : 194 - 207
  • [38] Optimal Protocol Interoperability Test Generation via Heuristic Algorithm
    Zhong, Ning
    He, Zunwen
    Kuang, Jingming
    Zhuo, Zhihai
    ICICSE: 2008 INTERNATIONAL CONFERENCE ON INTERNET COMPUTING IN SCIENCE AND ENGINEERING, PROCEEDINGS, 2008, : 278 - 281
  • [39] Graph based test case generation for TLM functional verification
    Kakoee, Mohammad Reza
    Neishaburi, M. H.
    Mohammadi, Siamak
    MICROPROCESSORS AND MICROSYSTEMS, 2008, 32 (5-6) : 288 - 295
  • [40] Biped Robot Joint Trajectory Generation Using PSO Evolutionary Algorithm
    Aghaabbasloo, Mohammad
    Azarkaman, Mostafa
    Salehi, Mostafa E.
    2013 3RD JOINT CONFERENCE OF AI & ROBOTICS AND 5TH ROBOCUP IRAN OPEN INTERNATIONAL SYMPOSIUM (RIOS), 2013, : 121 - 126