{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:12:25Z","timestamp":1648591945934},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Soft. Eng. Knowl. Eng."],"published-print":{"date-parts":[[2017,10]]},"abstract":"<jats:p> We introduce a novel application of feature ranking methods to the fault localization problem. We envision the problem of localizing causes of failures as instances of ranking program\u2019s elements where elements are conceptualized as features. In this paper, we define features as program\u2019s statements. However, in its fine-grained definition, the idea of program\u2019s features can refer to any traits of programs. This paper proposes feature ranking-based algorithms. The algorithms analyze execution traces of both passing and failing test cases, and extract the bug signatures from the failing test cases. The proposed procedure extracts possible combinations of program\u2019s elements when executed together from bug signatures. The feature ranking-based algorithms then order statements according to the suspiciousness of the combinations. When viewed as sequences, the combination of program\u2019s elements produced and traced in bug signatures can be utilized to reason about the common longest subsequence. The common longest subsequence of bug signatures represents the common statements executed by all failing test cases and thus provides a means for identifying statements that contain possible faults. Our evaluation indicates that the proposed feature-based fault localization outperforms existing fault localization ranking schemes. <\/jats:p>","DOI":"10.1142\/s0218194017500474","type":"journal-article","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T23:35:33Z","timestamp":1508801733000},"page":"1269-1289","source":"Crossref","is-referenced-by-count":0,"title":["Fault Localizations Through Feature Selections"],"prefix":"10.1142","volume":"27","author":[{"given":"Yulei","family":"Pang","sequence":"first","affiliation":[{"name":"Department of Mathematics, Southern Connecticut State University, New Haven, Connecticut 06514, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhen","family":"Xue","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Texas Tech University, Lubbock, Texas 79413, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akbar Siami","family":"Namin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Texas Tech University, Lubbock, Texas 79413, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"key":"S0218194017500474BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38601-5_8"},{"key":"S0218194017500474BIB010","doi-asserted-by":"publisher","DOI":"10.1136\/bmj.320.7247.1468"},{"key":"S0218194017500474BIB011","first-page":"1157","volume":"3","author":"Guyon I.","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"S0218194017500474BIB012","volume-title":"Computational Methods of Feature Selection","author":"Liu H.","year":"2008"},{"key":"S0218194017500474BIB014","doi-asserted-by":"publisher","DOI":"10.1214\/09-SS051"},{"key":"S0218194017500474BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-005-3861-2"},{"key":"S0218194017500474BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/32.988498"},{"key":"S0218194017500474BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2008.66"},{"issue":"1","key":"S0218194017500474BIB030","first-page":"71","volume":"32","author":"Kotsiantis S.","year":"2006","journal-title":"GESTS Int. Trans. Comput. Sci. Eng."}],"container-title":["International Journal of Software Engineering and Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218194017500474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:13:57Z","timestamp":1565079237000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218194017500474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":9,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2017,10,23]]},"published-print":{"date-parts":[[2017,10]]}},"alternative-id":["10.1142\/S0218194017500474"],"URL":"https:\/\/doi.org\/10.1142\/s0218194017500474","relation":{},"ISSN":["0218-1940","1793-6403"],"issn-type":[{"value":"0218-1940","type":"print"},{"value":"1793-6403","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}