IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v11y2020i2d10.1007_s13198-019-00862-1.html
   My bibliography  Save this article

Artificial bee colony algorithm in data flow testing for optimal test suite generation

Author

Listed:
  • Snehlata Sheoran

    (Amity University Uttar Pradesh)

  • Neetu Mittal

    (Amity University Uttar Pradesh)

  • Alexander Gelbukh

    (Instituto Politécnico Nacional [IPN])

Abstract

Meta-heuristic Artificial Bee Colony Algorithm finds its applications in the optimization of numerical problems. The intelligent searching behaviour of honey bees forms the base of this algorithm. The Artificial Bee Colony Algorithm is responsible for performing a global search along with a local search. One of the major usage areas of Artificial Bee Colony Algorithm is software testing, such as in structural testing and test suite optimization. The implementation of Artificial Bee Colony Algorithm in the field of data flow testing is still unexplored. In data flow testing, the definition-use paths which are not definition-clear paths are the potential trouble spots. The main aim of this paper is to present a simple and novel algorithm by making use of artificial bee colony algorithm in the field of data flow testing to find out and prioritize the definition-use paths which are not definition-clear paths.

Suggested Citation

  • Snehlata Sheoran & Neetu Mittal & Alexander Gelbukh, 2020. "Artificial bee colony algorithm in data flow testing for optimal test suite generation," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(2), pages 340-349, April.
    • Handle: RePEc:spr:ijsaem:v:11:y:2020:i:2:d:10.1007_s13198-019-00862-1
    DOI: 10.1007/s13198-019-00862-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-019-00862-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-019-00862-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ramin Danehchin, 2022. "Enhancing fault tolerance in vehicular ad-hoc networks using artificial bee colony algorithm-based spanning trees," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(4), pages 1722-1732, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:11:y:2020:i:2:d:10.1007_s13198-019-00862-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.