File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Precise propagation of fault-failure correlations in program flow graphs

TitlePrecise propagation of fault-failure correlations in program flow graphs
Authors
KeywordsFault localization
Graph
Social network analysis
Electric network analysis
Tracking (position)
Issue Date2011
PublisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000143
Citation
Proceedings of the 35th IEEE Annual International Computer Software and Applications Conference (COMPSAC 2011), Munich, Germany, 18-22 July 2011, p. 58-67 How to Cite?
AbstractStatistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such techniques can be promising in locating program faults. However, coincidental correctness and execution crashes may make program entities indistinguishable in the execution spectra under study, or cause inaccurate counting, thus severely affecting the precision of existing fault localization techniques. In this paper, we propose a BlockRank technique, which calculates, contrasts, and propagates the mean edge profiles between passed and failed executions to alleviate the impact of coincidental correctness. To address the issue of execution crashes, Block-Rank identifies suspicious basic blocks by modeling how each basic block contributes to failures by apportioning their fault relevance to surrounding basic blocks in terms of the rate of successful transition observed from passed and failed executions. BlockRank is empirically shown to be more effective than nine representative techniques on four real-life medium-sized programs. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/152015
ISSN
2020 SCImago Journal Rankings: 0.216
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Zen_HK
dc.contributor.authorChan, WKen_HK
dc.contributor.authorTse, THen_HK
dc.contributor.authorJiang, Ben_HK
dc.date.accessioned2012-06-26T06:32:27Z-
dc.date.available2012-06-26T06:32:27Z-
dc.date.issued2011en_HK
dc.identifier.citationProceedings of the 35th IEEE Annual International Computer Software and Applications Conference (COMPSAC 2011), Munich, Germany, 18-22 July 2011, p. 58-67en_US
dc.identifier.issn0730-3157en_HK
dc.identifier.urihttp://hdl.handle.net/10722/152015-
dc.description.abstractStatistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such techniques can be promising in locating program faults. However, coincidental correctness and execution crashes may make program entities indistinguishable in the execution spectra under study, or cause inaccurate counting, thus severely affecting the precision of existing fault localization techniques. In this paper, we propose a BlockRank technique, which calculates, contrasts, and propagates the mean edge profiles between passed and failed executions to alleviate the impact of coincidental correctness. To address the issue of execution crashes, Block-Rank identifies suspicious basic blocks by modeling how each basic block contributes to failures by apportioning their fault relevance to surrounding basic blocks in terms of the rate of successful transition observed from passed and failed executions. BlockRank is empirically shown to be more effective than nine representative techniques on four real-life medium-sized programs. © 2011 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000143-
dc.relation.ispartofProceedings of IEEE Annual International Computer Software and Applications Conferenceen_HK
dc.subjectFault localizationen_HK
dc.subjectGraphen_HK
dc.subjectSocial network analysisen_HK
dc.subjectElectric network analysis-
dc.subjectTracking (position)-
dc.titlePrecise propagation of fault-failure correlations in program flow graphsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChan, WK: wkchan@cs.hku.hken_HK
dc.identifier.emailTse, TH: thtse@cs.hku.hk-
dc.identifier.emailJiang, B: bjiang@cs.hku.hk-
dc.identifier.authorityTse, TH=rp00546en_HK
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/COMPSAC.2011.16en_HK
dc.identifier.scopuseid_2-s2.0-80054967652en_HK
dc.identifier.hkuros184859-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80054967652&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage58en_HK
dc.identifier.epage67en_HK
dc.identifier.isiWOS:000297149600011-
dc.publisher.placeUnited Statesen_HK
dc.description.otherProceedings of the 35th IEEE Annual International Computer Software and Applications Conference (COMPSAC 2011), Munich, Germany, 18-22 July 2011, p. 58-67-
dc.identifier.scopusauthoridTse, TH=7005496974en_HK
dc.identifier.scopusauthoridChan, WK=23967779900en_HK
dc.identifier.scopusauthoridZhang, Z=36198974100en_HK
dc.identifier.scopusauthoridJiang, B=35199818000-
dc.identifier.issnl0730-3157-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats