Proceedings of the 5th International Workshop on Software Mining最新文献

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2990476

A. Zeller

引用次数: 1

Automatic prediction of bug fixing effort measured by code churn size 通过代码变动大小来自动预测bug修复工作

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2975964

Ferdian Thung

{"title":"Automatic prediction of bug fixing effort measured by code churn size","authors":"Ferdian Thung","doi":"10.1145/2975961.2975964","DOIUrl":"https://doi.org/10.1145/2975961.2975964","url":null,"abstract":"During software maintenance, developers often receive many bug reports. Project managers often need to manage limited resources to resolve the many bugs that a project receives. To help project managers perform their job, past studies have proposed techniques that predict the amount of time that passes between a bug report being submitted and it being resolved. However, this time period might not be representative of the actual development effort, as developers might not work on the bug right away or all the time. In the open source development setting, developers are only volunteers and might not devote their full working hours to fix a bug in a particular open source project. In the industrial setting, developers might be asked to perform various tasks aside from fixing a particular bug. In this work, we estimate bug fixing effort in terms of code churn size. Code churn size is the number of lines of code that is either added, deleted, or modified to fix the bug. Lines of code has traditionally been used to estimate effort. However, no past studies have proposed techniques to automatically predict code churn size. In this work, using code churn size as estimation for bug fixing effort, we propose a classification-based approach that predicts, given a bug report, whether the bug fixing effort would be high or low. We have evaluated our approach on 1,029 bug reports from hadoop-common and struts2. The result is promising; we can achieve an Area Under the Receiver Operating Curve (AUC) of 0.612 to predict bug fixing effort in terms of lines of code churned, which is a 22.4% improvement over a baseline.","PeriodicalId":106703,"journal":{"name":"Proceedings of the 5th International Workshop on Software Mining","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115279714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Duplicate issue detection for the Android open source project Android开源项目的重复问题检测

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2975965

Kasthuri Jayarajah, Meera Radhakrishnan, Camellia Zakaria

引用次数: 1

Mining testing questions on stack overflow 在堆栈溢出上挖掘测试问题

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2975966

Pavneet Singh Kochhar

引用次数: 16

On the feasibility of detecting cross-platform code clones via identifier similarity 基于识别码相似度检测跨平台代码克隆的可行性研究

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2975967

Xiao Cheng, Lingxiao Jiang, Hao Zhong, Haibo Yu, Jianjun Zhao

{"title":"On the feasibility of detecting cross-platform code clones via identifier similarity","authors":"Xiao Cheng, Lingxiao Jiang, Hao Zhong, Haibo Yu, Jianjun Zhao","doi":"10.1145/2975961.2975967","DOIUrl":"https://doi.org/10.1145/2975961.2975967","url":null,"abstract":"More and more mobile applications run on multiple mobile operating systems to attract more users of different platforms. Although versions on different platforms are implemented in different programming languages (e.g., Java and Objective-C), there must be many code snippets that implement the similar business logic on different platforms. Such code snippets are called cross-platform clones. It is challenging but essential to detect such clones for software maintenance. Due to the practice that developers usually use some common identifiers when implementing the same business logic on different platforms, in this paper, we investigate the identifier similarity of the same mobile application on different platforms and provide insights about the feasibility of cross-platform clone detection via identifier similarity. In our experiment, we have analyzed the source code of 18 open-source cross-platform applications which are implemented on Android, iOS and Windows Phone, and find that the smaller KL-Divergence the application has, the more accurate the clones detected by identifiers will be.","PeriodicalId":106703,"journal":{"name":"Proceedings of the 5th International Workshop on Software Mining","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115797423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Code migration with statistical machine translation 代码迁移与统计机器翻译

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2990477

T. Nguyen

引用次数: 2

Mining timed regular expressions from system traces 从系统跟踪中挖掘定时正则表达式

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2975962

Greta Cutulenco, Yogi Joshi, Apurva Narayan, S. Fischmeister

{"title":"Mining timed regular expressions from system traces","authors":"Greta Cutulenco, Yogi Joshi, Apurva Narayan, S. Fischmeister","doi":"10.1145/2975961.2975962","DOIUrl":"https://doi.org/10.1145/2975961.2975962","url":null,"abstract":"Dynamic behavior of a program can be assessed through examination of events emitted by the program during execution. Temporal properties define the order of occurrence and timing constraints on event occurrence. Such specifications are important for safety-critical real-time systems for which a delayed response to an emitted event may lead to a fault in the system. Since temporal properties are rarely specified for programs and due to the complexity of the formalisms, it is desirable to suggest properties by extracting them from traces of program execution for testing, verification, anomaly detection, and debugging purposes. We propose a framework for automatically mining properties that are in the form of timed regular expressions (TREs) from system traces. Using an abstract structure of the property, the framework constructs a finite state machine to serve as an acceptor. As part of the framework, we propose two novel algorithms optimized for mining general TREs and a fragment without negation. The framework is evaluated on industrial strength safety-critical real-time applications (a deployed autonomous hexacopter system and a commercial vehicle in operation) using traces with more than 1 Million entries. Our framework is open source and available online:https://bitbucket.org/sfischme/tre-mining","PeriodicalId":106703,"journal":{"name":"Proceedings of the 5th International Workshop on Software Mining","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131250246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

By the power of SMT! mining function contracts to better bounded model checking 凭借SMT的力量!挖掘函数可以更好地进行有界模型检查

Proceedings of the 5th International Workshop on Software Mining Pub Date : 2016-09-03 DOI: 10.1145/2975961.2975963

A. Abdullin, M. Akhin

引用次数: 0

Proceedings of the 5th International Workshop on Software Mining 第五届软件挖掘国际研讨会论文集

Proceedings of the 5th International Workshop on Software Mining Pub Date : 1900-01-01 DOI: 10.1145/2975961

引用次数: 0