IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v26y2015i09ns0129183115501016.html
   My bibliography  Save this article

An algorithm to find critical execution paths of software based on complex network

Author

Listed:
  • Guoyan Huang

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
    The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China)

  • Bing Zhang

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
    The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China)

  • Rong Ren

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
    The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China)

  • Jiadong Ren

    (College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
    The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China)

Abstract

The critical execution paths play an important role in software system in terms of reducing the numbers of test date, detecting the vulnerabilities of software structure and analyzing software reliability. However, there are no efficient methods to discover them so far. Thus in this paper, a complex network-based software algorithm is put forward to find critical execution paths (FCEP) in software execution network. First, by analyzing the number of sources and sinks in FCEP, software execution network is divided into AOE subgraphs, and meanwhile, a Software Execution Network Serialization (SENS) approach is designed to generate execution path set in each AOE subgraph, which not only reduces ring structure's influence on path generation, but also guarantees the nodes' integrity in network. Second, according to a novel path similarity metric, similarity matrix is created to calculate the similarity among sets of path sequences. Third, an efficient method is taken to cluster paths through similarity matrices, and the maximum-length path in each cluster is extracted as the critical execution path. At last, a set of critical execution paths is derived. The experimental results show that the FCEP algorithm is efficient in mining critical execution path under software complex network.

Suggested Citation

  • Guoyan Huang & Bing Zhang & Rong Ren & Jiadong Ren, 2015. "An algorithm to find critical execution paths of software based on complex network," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 26(09), pages 1-16.
    • Handle: RePEc:wsi:ijmpcx:v:26:y:2015:i:09:n:s0129183115501016
    DOI: 10.1142/S0129183115501016
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183115501016
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183115501016?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.

    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:wsi:ijmpcx:v:26:y:2015:i:09:n:s0129183115501016. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.