2012 28th IEEE International Conference on Software Maintenance (ICSM)最新文献_第7页

Inferring weak references for fixing Java memory leaks 推断用于修复Java内存泄漏的弱引用

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405323

Ju Qian, Xiaoyu Zhou

引用次数: 9

Time-leverage point detection for time sensitive software maintenance 时间杠杆点检测时间敏感的软件维护

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405322

Enyi Tang, Linzhang Wang, Jianhua Zhao, Xuandong Li

{"title":"Time-leverage point detection for time sensitive software maintenance","authors":"Enyi Tang, Linzhang Wang, Jianhua Zhao, Xuandong Li","doi":"10.1109/ICSM.2012.6405322","DOIUrl":"https://doi.org/10.1109/ICSM.2012.6405322","url":null,"abstract":"Correct real-time behavior is an important aspect for time sensitive software, but it is difficult to get right. Time faults can be introduced not just during software development but also maintenance. So software maintainers without time information tend to have more chances to introduce unintended time behaviors. In this paper, we propose time change impact analysis to help maintainers estimate the potential influence of time changes on programs before the software evolves. Our main insight is that by being reminded and warned that a small-time change at some places in the source code will largely affect the whole task execution time, maintainers can be more cautious when updating such places. Because these places have a leverage effect that multiplies the task execution time in a subtle way, we call them time-leverage points. We give an approach to detect the time-leverage points based on a dynamic testing method, which instruments the program at a point for introducing a small delay and observes its impact on the task execution time. We implement a prototype tool and empirically evaluate the approach.","PeriodicalId":348790,"journal":{"name":"2012 28th IEEE International Conference on Software Maintenance (ICSM)","volume":"13 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124529326","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}

引用次数: 1

Relating requirements to implementation via topic analysis: Do topics extracted from requirements make sense to managers and developers? 通过主题分析将需求与实现联系起来:从需求中提取的主题对管理人员和开发人员有意义吗?

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405278

Abram Hindle, C. Bird, Thomas Zimmermann, Nachiappan Nagappan

{"title":"Relating requirements to implementation via topic analysis: Do topics extracted from requirements make sense to managers and developers?","authors":"Abram Hindle, C. Bird, Thomas Zimmermann, Nachiappan Nagappan","doi":"10.1109/ICSM.2012.6405278","DOIUrl":"https://doi.org/10.1109/ICSM.2012.6405278","url":null,"abstract":"Large organizations like Microsoft tend to rely on formal requirements documentation in order to specify and design the software products that they develop. These documents are meant to be tightly coupled with the actual implementation of the features they describe. In this paper we evaluate the value of high-level topic-based requirements traceability in the version control system, using Latent Dirichlet Allocation (LDA). We evaluate LDA topics on practitioners and check if the topics and trends extracted matches the perception that Program Managers and Developers have about the effort put into addressing certain topics. We found that effort extracted from version control that was relevant to a topic often matched the perception of the managers and developers of what occurred at the time. Furthermore we found evidence that many of the identified topics made sense to practitioners and matched their perception of what occurred. But for some topics, we found that practitioners had difficulty interpreting and labelling them. In summary, we investigate the high-level traceability of requirements topics to version control commits via topic analysis and validate with the actual stakeholders the relevance of these topics extracted from requirements.","PeriodicalId":348790,"journal":{"name":"2012 28th IEEE International Conference on Software Maintenance (ICSM)","volume":"56 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129299542","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}

引用次数: 37

Feature-gathering dependency-based software clustering using Dedication and Modularity 使用奉献和模块化的基于特性收集依赖的软件集群

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405308

Kenichi Kobayashi, Manabu Kamimura, Koki Kato, Keisuke Yano, Akihiko Matsuo

{"title":"Feature-gathering dependency-based software clustering using Dedication and Modularity","authors":"Kenichi Kobayashi, Manabu Kamimura, Koki Kato, Keisuke Yano, Akihiko Matsuo","doi":"10.1109/ICSM.2012.6405308","DOIUrl":"https://doi.org/10.1109/ICSM.2012.6405308","url":null,"abstract":"Software clustering is one of the important techniques to comprehend software systems. However, presented techniques to date require human interactions to refine clustering results. In this paper, we proposed a novel dependency-based software clustering algorithm, SArF. SArF has two characteristics. First, SArF eliminates the need of the omnipresent-module-removing step which requires human interactions. Second, the objective of SArF is to gather relevant software features or functionalities into a cluster. To achieve them, we defined the Dedication score to infer the importance of dependencies and utilized Modularity Maximization to cluster weighted directed graphs. Two case studies and extensive comparative evaluations using open source and industrial systems show that SArF could successfully decompose the systems fitting to the authoritative decompositions from a feature viewpoint without any tailored setups and that SArF was superior to existing dependency-based software clustering studies. Besides, the case studies show that there exist measurable authoritativeness limits and that SArF nearly reached the limits.","PeriodicalId":348790,"journal":{"name":"2012 28th IEEE International Conference on Software Maintenance (ICSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130936390","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}

引用次数: 42

Models are code too: Near-miss clone detection for Simulink models 模型也是代码:Simulink模型的未遂克隆检测

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405285

Manar H. Alalfi, J. Cordy, T. Dean, Matthew Stephan, Andrew Stevenson

引用次数: 79

Automatic classification of software related microblogs 软件相关微博自动分类

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405330

Philips Kokoh Prasetyo, D. Lo, Palakorn Achananuparp, Yuan Tian, Ee-Peng Lim

引用次数: 51

Version history based source code plagiarism detection in proprietary systems 专有系统中基于版本历史的源代码抄袭检测

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405334

Girish Maskeri Rama, Deepthi Karnam, Sree Aurovindh Viswanathan, S. Padmanabhuni

{"title":"Version history based source code plagiarism detection in proprietary systems","authors":"Girish Maskeri Rama, Deepthi Karnam, Sree Aurovindh Viswanathan, S. Padmanabhuni","doi":"10.1109/ICSM.2012.6405334","DOIUrl":"https://doi.org/10.1109/ICSM.2012.6405334","url":null,"abstract":"While the advent of open source code search tools have made the source code of thousands of open source software (OSS) readily accessible, thereby increasing legitimate reuse, it has also opened up the possibility of unconscientious employees plagiarizing code from OSS repositories. Plagiarism in proprietary software would not only lead to costly lawsuits, but also undermine the credibility of the organization. Hence detecting plagiarism in proprietary software is an urgent need. Though there exist a number of techniques for detecting plagiarism in student project assignments, they do not scale well in the case of large proprietary software. Especially when code snippets are plagiarized from the large number of available open source software. In this paper we propose a novel approach that applies Mining Software Repositories (MSR) based techniques to the problem of plagiarism detection. We create a programming style profile for each maintenance engineer by mining the version history and use that to detect source code commits that are likely to be plagiarized. Such suspected code fragments can be analyzed using any of the existing plagiarism detection techniques to confirm the plagiarism and ascertain the original code.","PeriodicalId":348790,"journal":{"name":"2012 28th IEEE International Conference on Software Maintenance (ICSM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123359323","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}

引用次数: 1

Refactoring edit history of source code 重构编辑源代码历史

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405336

Shinpei Hayashi, Takayuki Omori, Teruyoshi Zenmyo, Katsuhisa Maruyama, M. Saeki

引用次数: 28

What makes a good code example?: A study of programming Q&A in StackOverflow 什么是好的代码示例?: StackOverflow中编程问答的研究

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405249

Seyed Mehdi Nasehi, Jonathan Sillito, F. Maurer, C. Burns

引用次数: 302

Making automatic repair for large-scale programs more efficient using weak recompilation 使用弱重编译使大规模程序的自动修复更有效

2012 28th IEEE International Conference on Software Maintenance (ICSM) Pub Date : 2012-09-23 DOI: 10.1109/ICSM.2012.6405280

Yuhua Qi, Xiaoguang Mao, Yan Lei

{"title":"Making automatic repair for large-scale programs more efficient using weak recompilation","authors":"Yuhua Qi, Xiaoguang Mao, Yan Lei","doi":"10.1109/ICSM.2012.6405280","DOIUrl":"https://doi.org/10.1109/ICSM.2012.6405280","url":null,"abstract":"For large-scale programs, automatically repairing a bug by modifying source code is often a time-consuming process due to plenty of time spent on recompiling and reinstalling the patched program. To suppress the above time cost and make the repair process more efficient, a recompilation technique called weak recompilation is described in this paper. In weak recompilation, a program is assumed to be constructed from a set of components, and for each candidate patch only the changed code fragment in term of one component is recompiled to a shared library; the behaviors of patched program are observed by executing the original program with an instrumentation tool which can wrap specified function. The advantage of weak recompilation is that redundant recompilation cost can be suppressed, and reinstallation cost will be cut down completely. We also built WAutoRepair, a system which enables scalability to fix bugs in large-scale C programs with high efficiency. The experiments confirm that our repair system significantly outperforms Genprog, a famous approach for automatic program repair. For the wireshark program containing over 2 millions lines of code, WAutoRepair spent only 0.222 seconds in recompiling one candidate patch and 8.035 seconds in totally repairing the bug, compared to Genprog separately taking about 20.484 and 75.493 seconds, on average.","PeriodicalId":348790,"journal":{"name":"2012 28th IEEE International Conference on Software Maintenance (ICSM)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123057465","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}

引用次数: 12