2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)最新文献

筛选
英文 中文
Release Practices for Mobile Apps -- What do Users and Developers Think? 用户和开发者如何看待手机应用的发行惯例?
Maleknaz Nayebi, Bram Adams, G. Ruhe
{"title":"Release Practices for Mobile Apps -- What do Users and Developers Think?","authors":"Maleknaz Nayebi, Bram Adams, G. Ruhe","doi":"10.1109/SANER.2016.116","DOIUrl":"https://doi.org/10.1109/SANER.2016.116","url":null,"abstract":"Large software organizations such as Facebook or Netflix, who otherwise make daily or even hourly releases of their web applications using continuous delivery, have had to invest heavily into a customized release strategy for their mobile apps, because the vetting process of app stores introduces lag and uncertainty into the release process. Amidst these large, resourceful organizations, it is unknown how the average mobile app developer organizes her app's releases, even though an incorrect strategy might bring a premature app update to the market that drives away customers towards the heavy market competition. To understand the common release strategies used for mobile apps, the rationale behind them and their perceived impact on users, we performed two surveys with users and developers. We found that half of the developers have a clear strategy for their mobile app releases, since especially the more experienced developers believe that it affects user feedback. We also found that users are aware of new app updates, yet only half of the surveyed users enables automatic updating of apps. While the release date and frequency is not a decisive factor to install an app, users prefer to install apps that were updated more recently and less frequently. Our study suggests that an app's release strategy is a factor that affects the ongoing success of mobile apps.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802175","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}
引用次数: 77
An Empirical Study on Ranking Change Recommendations Retrieved Using Code Similarity 基于代码相似度的排名变更推荐检索的实证研究
Manishankar Mondal, C. Roy, Kevin A. Schneider
{"title":"An Empirical Study on Ranking Change Recommendations Retrieved Using Code Similarity","authors":"Manishankar Mondal, C. Roy, Kevin A. Schneider","doi":"10.1109/SANER.2016.53","DOIUrl":"https://doi.org/10.1109/SANER.2016.53","url":null,"abstract":"Providing change suggestions for a particular code snippet on the basis of how similar code snippets were changed in the past has been investigated by a number of studies. These studies rank change recommendations emphasizing their frequency of occurrence during the prior evolution. In our study, we investigate the ranking of change recommendations on the basis of their recency of occurrence in the past and compare this technique with the frequency based technique. According to our experimental results on thousands of revisions of six subject systems we observe that while ranking on the basis of frequency performs better than recency based ranking, a combination of these two techniques performs significantly better than the discrete techniques. We find that the combined technique provides better overall rankings for 16.58% more cases when compared with the frequency ranking technique, and 57.48% more cases when compared with the recency ranking technique.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128335281","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
Precondition Coverage in Software Testing 软件测试中的前提条件覆盖
Cyrille Artho, Quentin Gros, Guillaume Rousset
{"title":"Precondition Coverage in Software Testing","authors":"Cyrille Artho, Quentin Gros, Guillaume Rousset","doi":"10.1109/SANER.2016.31","DOIUrl":"https://doi.org/10.1109/SANER.2016.31","url":null,"abstract":"Preconditions indicate when it is permitted to use a given function. However, it is not always the case that both outcomes of a precondition are observed during testing. A precondition that is always false makes a function unusable, a precondition that is always true may turn out to be actually an invariant. In model-based testing, preconditions describes when a transition may be executed from a given state. If no outgoing transition is enabled in a given state because all preconditions of all outgoing transitions are false, the test model may be flawed. Experiments show a low test coverage of preconditions in the Scala library. We also investigate preconditions in Modbat models for model-based testing, in that case, a certain number of test cases is needed to produce sufficient coverage, but remaining cases of low coverage indeed point to legitimate flaws in test models or code.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127975183","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
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis 二进制级分析的动态符号执行工具包
Robin David, Sébastien Bardin, Thanh Dinh Ta, L. Mounier, Josselin Feist, Marie-Laure Potet, J. Marion
{"title":"BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis","authors":"Robin David, Sébastien Bardin, Thanh Dinh Ta, L. Mounier, Josselin Feist, Marie-Laure Potet, J. Marion","doi":"10.1109/SANER.2016.43","DOIUrl":"https://doi.org/10.1109/SANER.2016.43","url":null,"abstract":"When it comes to software analysis, several approaches exist from heuristic techniques to formal methods, which are helpful at solving different kinds ofproblems. Unfortunately very few initiative seek to aggregate this techniques in the same platform. BINSEC intend to fulfill this lack of binary analysis platform by allowing to perform modular analysis. This work focusses on BINSEC/SE, the new dynamic symbolic execution engine (DSE) implemented in BINSEC. We will highlight the novelties of the engine, especially in terms of interactions between concrete and symbolic execution or optimization of formula generation. Finally, two reverse engineering applications are shown in order to emphasize the tool effectiveness.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"30 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321612","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}
引用次数: 62
MICHAC: Defect Prediction via Feature Selection Based on Maximal Information Coefficient with Hierarchical Agglomerative Clustering 基于最大信息系数和层次聚类的特征选择缺陷预测
Zhou Xu, J. Xuan, Jin Liu, Xiaohui Cui
{"title":"MICHAC: Defect Prediction via Feature Selection Based on Maximal Information Coefficient with Hierarchical Agglomerative Clustering","authors":"Zhou Xu, J. Xuan, Jin Liu, Xiaohui Cui","doi":"10.1109/SANER.2016.34","DOIUrl":"https://doi.org/10.1109/SANER.2016.34","url":null,"abstract":"Defect prediction aims to estimate software reliability via learning from historical defect data. A defect prediction method identifies whether a software module is defect-prone or not according to metrics that are mined from software projects. These metric values, also known as features, may involve irrelevance and redundancy, which will hurt the performance of defect prediction methods. Existing work employs feature selection to preprocess defect data to filter out useless features. In this paper, we propose a novel feature selection framework, MICHAC, short for defect prediction via Maximal Information Coefficient with Hierarchical Agglomerative Clustering. MICHAC consists of two major stages. First, MICHAC employs maximal information coefficient to rank candidate features to filter out irrelevant ones, second, MICHAC groups features with hierarchical agglomerative clustering and selects one feature from each resulted group to remove redundant features. We evaluate our proposed method on 11 widelystudied NASA projects and four open-source AEEEM projects using three different classifiers with four performance metrics (precision, recall, F-measure, and AUC). Comparison with five existing methods demonstrates that MICHAC is effective in selecting features in defect prediction.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123785944","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}
引用次数: 52
Software-Specific Named Entity Recognition in Software Engineering Social Content 软件工程社会内容中特定于软件的命名实体识别
Deheng Ye, Zhenchang Xing, Chee Yong Foo, Zi Qun Ang, J. Li, Nachiket Kapre
{"title":"Software-Specific Named Entity Recognition in Software Engineering Social Content","authors":"Deheng Ye, Zhenchang Xing, Chee Yong Foo, Zi Qun Ang, J. Li, Nachiket Kapre","doi":"10.1109/SANER.2016.10","DOIUrl":"https://doi.org/10.1109/SANER.2016.10","url":null,"abstract":"Software engineering social content, such as Q&A discussions on Stack Overflow, has become a wealth of information on software engineering. This textual content is centered around software-specific entities, and their usage patterns, issues-solutions, and alternatives. However, existing approaches to analyzing software engineering texts treat software-specific entities in the same way as other content, and thus cannot support the recent advance of entity-centric applications, such as direct answers and knowledge graph. The first step towards enabling these entity-centric applications for software engineering is to recognize and classify software-specific entities, which is referred to as Named Entity Recognition (NER) in the literature. Existing NER methods are designed for recognizing person, location and organization in formal and social texts, which are not applicable to NER in software engineering. Existing information extraction methods for software engineering are limited to API identification and linking of a particular programming language. In this paper, we formulate the research problem of NER in software engineering. We identify the challenges in designing a software-specific NER system and propose a machine learning based approach applied on software engineering social content. Our NER system, called S-NER, is general for software engineering in that it can recognize a broad category of software entities for a wide range of popular programming languages, platform, and library. We conduct systematic experiments to evaluate our machine learning based S-NER against a well-designed, and to study the effectiveness of widely-adopted NER techniques and features in the face of the unique characteristics of software engineering social content.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122688918","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}
引用次数: 77
Do Developers Focus on Severe Code Smells? 开发者关注严重的代码气味吗?
T. Saika, Eunjong Choi, Norihiro Yoshida, S. Haruna, Katsuro Inoue
{"title":"Do Developers Focus on Severe Code Smells?","authors":"T. Saika, Eunjong Choi, Norihiro Yoshida, S. Haruna, Katsuro Inoue","doi":"10.1109/SANER.2016.117","DOIUrl":"https://doi.org/10.1109/SANER.2016.117","url":null,"abstract":"Code smells are structures in the code that suggestthe possibility of refactoring. To prioritize code smells in large-scale source code, several tools for refactoring calculate theirseverity based on software metrics. Although several metrics are known as maintainability indicators, it is still unclear whether these severity indicators are in line with developer's perception. In this paper, we investigate whether developers focus on severe code smells. The result shows that developers focus on only particular types of severe smells and refactoring do not decrease the severity of code smell significantly.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133299881","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}
引用次数: 9
Localizing Multiple Faults in Simulink Models Simulink模型中的多故障定位
Bing Liu, Lucia, S. Nejati, L. Briand, T. Bruckmann
{"title":"Localizing Multiple Faults in Simulink Models","authors":"Bing Liu, Lucia, S. Nejati, L. Briand, T. Bruckmann","doi":"10.1109/SANER.2016.38","DOIUrl":"https://doi.org/10.1109/SANER.2016.38","url":null,"abstract":"As Simulink is a widely used language in the embedded industry, there is a growing need to support debugging activities for Simulink models. In this work, we propose an approach to localize multiple faults in Simulink models. Our approach builds on statistical debugging and is iterative. At each iteration, we identify and resolve one fault and re-test models to focus on localizing faults that might have been masked before. We use decision trees to cluster together failures that satisfy similar (logical) conditions on model blocks or inputs. We then present two alternative selection criteria to choose a cluster that is more likely to yield the best fault localization results among the clusters produced by our decision trees. Engineers are expected to inspect the ranked list obtained from the selected cluster to identify faults. We evaluate our approach on 240 multi-fault models obtained from three different industrial subjects. We compare our approach with two baselines: (1) Statistical debugging without clustering, and (2) State-of-the-art clustering-based statistical debugging. Our results show that our approach significantly reduces the number of blocks that engineers need to inspect in order to localize all faults, when compared with the two baselines. Furthermore, with our approach, there is less performance degradation than in the baselines when increasing the number of faults in the underlying models.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133955337","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}
引用次数: 24
Improving the Performance of a Large Scale Spreadsheet: A Case Study 改进大型电子表格的性能:一个案例研究
Alaaeddin Swidan, F. Hermans, Ruben Koesoemowidjojo
{"title":"Improving the Performance of a Large Scale Spreadsheet: A Case Study","authors":"Alaaeddin Swidan, F. Hermans, Ruben Koesoemowidjojo","doi":"10.1109/SANER.2016.100","DOIUrl":"https://doi.org/10.1109/SANER.2016.100","url":null,"abstract":"Spreadsheets are used extensively for calculations in several domains, especially in finance and insurance. Spreadsheets offer a clear benefit to their users: they are an easy to learn application in which to express their business needs, however, there are downsides too. Like software, spreadsheets can have a long life span in which they are used by several people. This leads to maintainability issues, including errors, but also often to issues with performance. In this paper we present a case study in which a model for shortfall calculations, originally implemented in a spreadsheet, was adapted to run on an HPC cluster. We present the design, analysis and implementation of the solution which clearly improved the performance of the spreadsheet, with a factor of 50 in some cases. We subsequently reflect on challenges related to reverse engineering, testing and scalability. Finally, we identify opportunities that would provide automatic support to refactoring, dependency recognition and performance profiling in future spreadsheet optimization projects.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130300777","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}
引用次数: 5
Duplication for the Removal of Duplication 删除复制的复制
Ran Ettinger, S. Tyszberowicz
{"title":"Duplication for the Removal of Duplication","authors":"Ran Ettinger, S. Tyszberowicz","doi":"10.1109/SANER.2016.62","DOIUrl":"https://doi.org/10.1109/SANER.2016.62","url":null,"abstract":"A semantics-preserving code-motion refactoring transformation by Komondoor and Horwitz (KH) had been shown to be effective in the elimination of type-3 clones, partly thanks to its successful combination of statement reordering with duplication of predicates. According to a recent clone refactorability definition by Tsantalis, however, such a transformation is considered unacceptable whenever the given code fragments contain any statement that cannot be moved. We propose an adaptation of the KH transformation that yields refactorable results according to the definition of Tsantalis. An evaluation of this approach on real-world type-3 clones from the Java portion of the Tiarks benchmark produces promising results, demonstrating how code motion with the duplication of predicates forms an effective step towards the removal of duplication in source code.","PeriodicalId":348755,"journal":{"name":"2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131996975","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书