[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing

  • Published:
Journal of Electronic Testing Aims and scope Submit manuscript

Abstract

Software testing is the most crucial stage in the software development process. Structural testing, functional testing and models that even support hybrid testing are different software testing techniques. Basic path testing, the most significant structural testing approach, is focused on evaluating software source code. The method emphasizes developing test data inputs to produce all feasible and efficient test paths that connect to all nodes and edges of the graph. The objective is to define the number of independent paths that can define the number of test cases needed to maximize test coverage. It ensured the execution of every statement and condition at least once. A nature-inspired Smell Detection Agent (SDA) algorithm is proposed in this paper to select all paths and prioritize the feasible solution. This algorithm is an optimization algorithm suitable for identifying optimal paths with priority. The concept is derived from the natural behaviour of canines that identified optimal path from source to the destination. The SDA algorithm is based on the evaporation of smell molecules in the form of gas and the perception capability of a smelling agent. The number of linearly independent paths through a programme module is measured by creating a Control Flow Graph of the code, which measures cyclomatic complexity. SDA algorithm gives significant increases in performance while considering the cyclomatic complexity. Complexity analysis of SDA trends to be in the O(E+V log V), while the competitor algorithms have an exponential growth of O(n\(^2\)). Various experiments were also carried out to emphasis the relevance of the proposed method. Ten different benchmarked applications has been taken for experimental analysis and it was observed to have an increased path coverage of 8% when SDA was used over the traditional methods. Also, the time complexity was reduced by 22%, which shows the powerfulness of the proposed SDA algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Data Availability

Supplementary materials are available in http://www.mirworks.in/downloads.php.

References

  1. Abed-Alguni H. Bilal, Alawad Noor Aldeen (2021) Distributed Grey Wolf Optimizer for scheduling of workflow applications in cloud environments. Appl Soft Comput 102:107–113

    Article  Google Scholar 

  2. Abualigah L, Yousri D, Abd Elaziz M, Ewees AA, Al-Qaness MA, Gandomi AH (2021) Aquila Optimizer: A novel meta-heuristic optimization algorithm. Comput Ind Eng 157:107–250

  3. Abualigah Laith, Diabat Ali, Mirjalili Seyedali, Elaziz Mohamed Abd, Amir Gandomi H (2021) The Arithmetic Optimization Algorithm. Comput Methods Appl Mech Eng 76:113609

    Article  MATH  Google Scholar 

  4. Abualigah Laith, Elaziz Mohamed Abd, Sumari Putra, Geem Zong Woo, Amir Gandomi H (2022) Reptile Search Algorithm (RSA): A nature-inspired meta-heuristic optimizer. Expert Syst Appl 191:116–158

    Article  Google Scholar 

  5. Alawad NA, Abed-alguni BH (2021) Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem. J Supercomputing 78:3517–3538

    Article  Google Scholar 

  6. Alawad NA, Abed-alguni BH (2021) Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments. Arab J Sci Eng 46:3213–3233

    Article  Google Scholar 

  7. Ananthalakshmi Ammal R, Sajimon PC, Vinod Chandra SS (2020) Canine algorithm for node disjoint paths. Lect Notes Comput Sci 12145

  8. Colorni A, Dorigo M, Maniezzo V, Trubian M (1999) Ant System for Job-Shop Scheduling. Belg J Oper Res Stat Comput Sci 34(1):39–53

    MATH  Google Scholar 

  9. Doerner K, Gutjahr WJ (2003) Extracting test sequences from a markov software usage model by ACO. Lect Notes Comput Sci 2724:2465–2476

    Article  MATH  Google Scholar 

  10. Dorigo M, Maniezzo V, Colorni A (1996) Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans Syst Man Cybern - Part B Cybern 26(1):29–41

    Article  Google Scholar 

  11. Laith Abualigah (2020) Feature Selection and Enhanced Krill Herd Algorithm for Text Document Clustering. Studies in Computational Intelligence book series 816:105746

    Google Scholar 

  12. Li K,  Zhang Z, Liu W (2009) Automatic test data generation based on ant colony optimization. Proc. of Fifth International Conference on Natural Computation 216-219

  13. Parpinelli RS, Lopes HS, Freitas AA (2002) Data mining with an ant colony optimization algorithm. IEEE Trans Evol Comput 6(4):321–332

    Article  MATH  Google Scholar 

  14. Reimann M, Ulrich H (2006) Comparing backhauling strategies in vehicle routing using Ant Colony Optimization. CEJOR 14(2):105

    Article  MATH  Google Scholar 

  15. Saju Sankar S, Vinod Chandra SS (2020) A multi-agent ACO algorithm for effective vehicular traffic management system. Lect Notes Comput Sci 12145:640–647

    Article  Google Scholar 

  16. Saju Sankar S, Vinod Chandra SS (2020) A Structural Testing Model using SDA Algorithm. Lect Notes Comput Sci 12145:405–412

    Article  Google Scholar 

  17. Saritha R, Vinod Chandra SS (2016) An approach using Particle Swarm Optimization and Rational Kernel for variable length data sequence optimization. Lect Notes Comput Sci 9712:401–409

    Article  Google Scholar 

  18. Saritha R, Vinod Chandra SS (2017) Multi dimensional honey bee foraging algorithm based on optimal energy consumption. Journal of The Institution of Engineers (India): Series B 98(5), 527-531

  19. Saritha R, Vinod Chandra SS (2018) Multi modal foraging by honey bees toward optimizing profits at multiple colonies. IEEE Intell Syst 34(1):14–22

    Article  Google Scholar 

  20. Sharma B, Girdhar I, Taneja M, Basia P, Vadla S, Srivastava PR (2011) Software coverage : A testing approach through ant colony optimization. Lect Notes Comput Sci 7076

  21. Singh Y, Kaur A, Suri B (2010) Test case prioritization using ant colony optimization. ACM SIGSOFT Software Engineering Notes: 35(4)

  22. Srivastava P (2012) Optimal test sequence generation: an approach using ant colony optimisation. Int J Comput Syst Eng 1:91–99

    Article  Google Scholar 

  23. Vinod Chandra SS (2015) Smell Detection Agent Based Optimization Algorithm. J Inst Eng: Series B 97(3):431–436

    Google Scholar 

  24. Vinod Chandra SS, Anand HS (2022) Nature inspired meta heuristic algorithms for optimization problems. Computing 104:251–269

    Article  MATH  Google Scholar 

  25. Vinod Chandra SS, Anand Hareendran S (2021) Phototropic algorithm for global optimisation problems. Appl Intell 51:5965–5977

    Article  Google Scholar 

  26. Vinod Chandra SS, Anand HS, Saju Sankar S (2020) Optimal Reservoir Optimization Using Multiobjective Genetic Algorithm. Lect Notes Comput Sci 12145:445–454

    Article  Google Scholar 

  27. Wegener J, Baresel A, Sthamer H (2001) Evolutionary test environment for automatic structural testing. J Inf Softw Technol 43:841–854

    Article  Google Scholar 

  28. Yang S, Man T, Xu J (2014) Improved ant algorithms for software testing cases generation. Sci World J

Download references

Acknowledgments

Authors would like to thank, Government of India for issuing Copyright for the algorithm Smell Detection Agent based Optimization Algorithm and Indian Patent to the work Bio-inspired Controller for Finding Disjoint Paths in Software Defined Networks, which were the basic concepts used in the development of the proposed work. The authors would also like to extend gratitude to all researchers affiliated with the Machine Intelligence Research(MIR) Laboratory for their support during each phase of this work.

Funding

Authors confirm that there is no funding received for this work.

Author information

Authors and Affiliations

  1. Department of Computer Science, Thiruvananthapuram, University of Kerala, Thiruvananthapuram, India

    S. S. Vinod Chandra

  2. Department of Computer Engineering, Government Polytechnic College, Punalur, India

    S. Saju Sankar

  3. Department of Computer Science and Engineering, Muthoot Institute of Technology and Science, Kochi, India

    H. S. Anand

Authors
  1. S. S. Vinod Chandra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Saju Sankar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. S. Anand
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Vinod developed the problem statement, conceptualized this study and developed the methodology. Anand has curated the data and was involved in the methodology implementation. Saju implemented and wrote the initial manuscript along with curation.

Corresponding author

Correspondence to S. S. Vinod Chandra.

Ethics declarations

Ethical Approval and Consent to Participate

The work was done by following all ethical methods and authors declare the consent to participate in the work.

Consent for Publication

All authors here by give consent for the publication of the article. There are no other person with competing interest.

Research Involving Human Participants and/or Animals

The authors declare that this project does not involve Human Participants and/or animals in any capacity.

Informed Consent

The authors declare that this research does not involve any surveys or participants in any capacity.

Competing Interests

The authors have no competing interest to declare that are relevant to the work or content of this article.

Conflict of Interest

Authors certify that this article has no actual or potential conflict of interest.

Additional information

Responsible Editor: V. D. Agrawal

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chandra, S.S.V., Sankar, S.S. & Anand, H.S. Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing. J Electron Test 38, 623–636 (2022). https://doi.org/10.1007/s10836-022-06033-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10836-022-06033-8

Keywords

Search

Navigation