2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation最新文献_第3页

A Change-Type Based Empirical Study on the Stability of Cloned Code 基于变化类型的克隆代码稳定性实证研究

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.13

M. S. Rahman, C. Roy

{"title":"A Change-Type Based Empirical Study on the Stability of Cloned Code","authors":"M. S. Rahman, C. Roy","doi":"10.1109/SCAM.2014.13","DOIUrl":"https://doi.org/10.1109/SCAM.2014.13","url":null,"abstract":"Clones are the duplicate or similar code blocks in software systems. A large number of studies concerning the impacts of clones on software systems mainly focus on the frequency of changes to evaluate stability, consistency in evolution and introduction of bugs. Although it is obvious that not each type of changes has equal impact on software systems, none of the existing studies take the types of changes and their significance into account during comparative evaluation of stability of cloned and non-cloned code. This paper presents an empirical study on the comparative stability of cloned and non-cloned code from the perspective of different change types. Changes from successive revisions are extracted and classified using Change Distiller which employs Abstract Syntax Tree (AST) differencing of the successive revisions of source code and assigns the corresponding level of significance to each of the classified changes. We detect exact (Type-1) and near-miss (Type-2 and Type-3) clones using the hybrid clone detection tool NiCad. Extracted and classified changes and clone information are then analyzed to compare the stability of cloned and non-cloned code from three different perspectives: types of clones, types of changes with respect to the significance of changes, and size and extent of evolution of the systems. Our study on seven open-source Java systems with diversity in their size, length of evolution and application domain shows that changes are more frequent in cloned code than in noncloned code and Type-1 clones are comparatively more vulnerable to the stability of the systems. Therefore, cloned code is less stable than non-cloned code suggesting that cloned code is likely to pose more maintenance challenges than non-cloned code.","PeriodicalId":407060,"journal":{"name":"2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115130070","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}

引用次数: 17

Bit-Level Taint Analysis 位级污点分析

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.43

B. Yadegari, S. Debray

引用次数: 37

Efficient Utilization of Secondary Storage for Scalable Dynamic Slicing 二级存储在可扩展动态切片中的有效利用

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.24

Ulf Kargén, N. Shahmehri

{"title":"Efficient Utilization of Secondary Storage for Scalable Dynamic Slicing","authors":"Ulf Kargén, N. Shahmehri","doi":"10.1109/SCAM.2014.24","DOIUrl":"https://doi.org/10.1109/SCAM.2014.24","url":null,"abstract":"Dynamic program slicing is widely recognized as a powerful aid for e.g. Program comprehension during debugging. However, its widespread use has been impeded in part by scalability issues that occur when constructing the dynamic dependence graph necessary to compute dynamic slices. A few seconds of execution time on a modern CPU can easily yield dynamic dependence graphs on the order of tens of gigabytes in size. Existing methods either produce imprecise slices, incur large time overheads during slice computation, or run out of memory for long program executions. By carefully designing our method to take advantage of locality, we are able to efficiently use secondary storage for dynamic dependence graphs, thus allowing our method to scale to long program executions. Our prototype implementation runs directly on x86 executables, eliminating problems with e.g. Binary-only libraries. We show in our experiments that graphs can be constructed for program runs with billions of executed instructions, at slowdowns ranging from 62x to 173x. Our optimized format also allows graphs to be traversed at speeds of several million dependence edges per second.","PeriodicalId":407060,"journal":{"name":"2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132113973","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}

引用次数: 6

Identifying Source Code Reuse across Repositories Using LCS-Based Source Code Similarity 使用基于lcs的源代码相似度识别跨存储库的源代码重用

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.17

Naohiro Kawamitsu, T. Ishio, Tetsuya Kanda, R. Kula, Coen De Roover, Katsuro Inoue

引用次数: 31

Instrumentation of Annotated C Programs for Test Generation 用于测试生成的注释C程序的仪器仪表

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.19

Guillaume Petiot, Bernard Botella, J. Julliand, N. Kosmatov, Julien Signoles

引用次数: 17

ACUA: API Change and Usage Auditor ACUA: API变更和使用审计员

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.33

Wei Wu, Bram Adams, Yann-Gaël Guéhéneuc, G. Antoniol

引用次数: 13

A Pattern Search Method for Unpreprocessed C Programs Based on Tokenized Syntax Trees 基于标记化语法树的未预处理C程序模式搜索方法

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.16

Atsushi Yoshida, Yoshinari Hachisu

引用次数: 4

Effect of Clone Information on the Performance of Developers Fixing Cloned Bugs 克隆信息对开发者修复克隆bug性能的影响

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.10

Saman Bazrafshan, R. Koschke

{"title":"Effect of Clone Information on the Performance of Developers Fixing Cloned Bugs","authors":"Saman Bazrafshan, R. Koschke","doi":"10.1109/SCAM.2014.10","DOIUrl":"https://doi.org/10.1109/SCAM.2014.10","url":null,"abstract":"Duplicated source code -- clones -- is known to occur frequently in software systems and bears the risk of inconsistent updates of the code. The impact of clones has been investigated mostly by retrospective analysis of software systems. Only little effort has been spent to investigate human interaction when dealing with clones. A previous study by Chatterji and colleagues found that cloned defects are removed significantly more accurately when clone information is provided to the programmers. We conducted a controlled experiment to extend the previous study on the use of clone information by investigating the effect of clone information on the performance of developers in common bug-fixing tasks. The experiment shows that developers are quite capable to compensate missing clone information through testing to provide correct solutions. Clone information does help to detect cloned defects faster, although developers may exploit semantic code relations such as inheritance to uncover cloned defects only slightly slower if they do not have clone information. If cloned defects lurk in semantically unrelated places however, clone information helps to find them faster at statistical significance. Developers without clone information needed 17 minutes longer on average or 140% more time in relative terms to complete the task successfully.","PeriodicalId":407060,"journal":{"name":"2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132518485","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

A Comparative Study of Bug Patterns in Java Cloned and Non-cloned Code Java克隆与非克隆代码中Bug模式的比较研究

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.12

Hitesh Sajnani, V. Saini, C. Lopes

{"title":"A Comparative Study of Bug Patterns in Java Cloned and Non-cloned Code","authors":"Hitesh Sajnani, V. Saini, C. Lopes","doi":"10.1109/SCAM.2014.12","DOIUrl":"https://doi.org/10.1109/SCAM.2014.12","url":null,"abstract":"Code cloning via copy-and-paste is a common practice in software engineering. Traditionally, this practice has been considered harmful, and a symptom that some important design abstraction is being ignored. As such, many previous studies suggest approaches to facilitate the discovery, removal, and refactoring of clones. However, not many studies exist that empirically investigate the relationship of code clones with code quality. In this paper, we conduct an empirical study of 31 open source Java projects (1.7 MSLOC) to explore the relationship between code clones and a set of bug patterns reported by Find Bugs. We found that: (i) the defect density in cloned code is 3.7 times less than that of the rest of the code, (ii) 66% of the bug patterns associated with code clones are related to issues in coding style and practice, the two least problematic of the Find Bugs' categories, while that number is 49% for non-cloned code, and (iii) 75% of the bug patterns in cloned code are duplicated without any changes, while 25% are only present in one of the clones. These results show that, when using Find Bugs to detect bug patterns, there is a positive differentiation of cloned code with respect to the rest of the code: the cloned code has considerably less, and less problematic, bug patterns. While our study does not unveil any explanation for this, results from other, more qualitative studies indicate that developers use copy-and-paste intentionally and wisely, which may explain the quantitative observations of our study. Overall, these research results suggest that the practice of code cloning in Java, and possibly in all other object-oriented languages, needs to be given serious consideration on the part of tool designers.","PeriodicalId":407060,"journal":{"name":"2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114686981","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}

引用次数: 22

Fast Flow Analysis with Godel Hashes 哥德尔哈希快速流分析

2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation Pub Date : 2014-09-28 DOI: 10.1109/SCAM.2014.40

Shuying Liang, Weibin Sun, M. Might

引用次数: 12