{"title":"将 Bandit 算法应用于故障定位技术","authors":"Masato Nakao, Kensei Hamamoto, Masateru Tsunoda, Amjed Tahir, Koji Toda, Akito Monden, Keitaro Nakasai, Kenichi Matsumoto","doi":"arxiv-2409.06268","DOIUrl":null,"url":null,"abstract":"Developers must select a high-performance fault localization (FL) technique\nfrom available ones. A conventional approach is to try to select only one FL\ntechnique that is expected to attain high performance before debugging\nactivity. In contrast, we propose a new approach that dynamically selects\nbetter FL techniques during debugging activity.","PeriodicalId":501278,"journal":{"name":"arXiv - CS - Software Engineering","volume":"3 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Applying Bandit Algorithm to Fault Localization Techniques\",\"authors\":\"Masato Nakao, Kensei Hamamoto, Masateru Tsunoda, Amjed Tahir, Koji Toda, Akito Monden, Keitaro Nakasai, Kenichi Matsumoto\",\"doi\":\"arxiv-2409.06268\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Developers must select a high-performance fault localization (FL) technique\\nfrom available ones. A conventional approach is to try to select only one FL\\ntechnique that is expected to attain high performance before debugging\\nactivity. In contrast, we propose a new approach that dynamically selects\\nbetter FL techniques during debugging activity.\",\"PeriodicalId\":501278,\"journal\":{\"name\":\"arXiv - CS - Software Engineering\",\"volume\":\"3 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.06268\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Applying Bandit Algorithm to Fault Localization Techniques
Developers must select a high-performance fault localization (FL) technique
from available ones. A conventional approach is to try to select only one FL
technique that is expected to attain high performance before debugging
activity. In contrast, we propose a new approach that dynamically selects
better FL techniques during debugging activity.