IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v3y2012i3p17-32.html
   My bibliography  Save this article

Optimal Test Sequence Generation in State Based Testing Using Cuckoo Search

Author

Listed:
  • Praveen Ranjan Srivastava

    (Birla Institute of Technology & Science, Pilani, India)

  • Ashish Kumar Singh

    (Birla Institute of Technology & Science, Pilani, India)

  • Hemraj Kumhar

    (Birla Institute of Technology & Science, Pilani, India)

  • Mohit Jain

    (Birla Institute of Technology & Science, Pilani, India)

Abstract

The present work describes a method for increasing software testing efficiency by identifying the optimal test sequences in the state machine diagram. The method employs a Meta-heuristic algorithm called Cuckoo Search to investigate best paths in the diagram. It tries to provide a technique for exhaustive coverage with minimal repetition which ensures all transitions coverage and all paths coverage at least once with minimal number of repetitions of states as well as transitions. The algorithm works by maximising an objective function which focuses on most error prone parts of the program so that critical portions can be tested first. State machine diagram is given as input, and Cuckoo Search is performed to generate a list of test sequences as output.

Suggested Citation

  • Praveen Ranjan Srivastava & Ashish Kumar Singh & Hemraj Kumhar & Mohit Jain, 2012. "Optimal Test Sequence Generation in State Based Testing Using Cuckoo Search," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 3(3), pages 17-32, July.
    • Handle: RePEc:igg:jaec00:v:3:y:2012:i:3:p:17-32
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaec.2012070102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jaec00:v:3:y:2012:i:3:p:17-32. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.