Proceedings of the 28th International Conference on Program Comprehension最新文献

筛选
英文 中文
BugSum
Proceedings of the 28th International Conference on Program Comprehension Pub Date : 2020-07-13 DOI: 10.1145/3387904.3389272
Haoran Liu, Yue Yu, Shanshan Li, Yong Guo, Deze Wang, Xiaoguang Mao
{"title":"BugSum","authors":"Haoran Liu, Yue Yu, Shanshan Li, Yong Guo, Deze Wang, Xiaoguang Mao","doi":"10.1145/3387904.3389272","DOIUrl":"https://doi.org/10.1145/3387904.3389272","url":null,"abstract":"During collaborative software development, bug reports are dynamically maintained and evolved as a part of a software project. For a historical bug report with complicated discussions, an accurate and concise summary can enable stakeholders to reduce the time effort perusing the entire content. Existing studies on bug report summarization, based on whether supervised or unsupervised techniques, are limited due to their lack of consideration of the redundant information and disapproved standpoints among developers. comments. Accordingly, in this paper, we propose a novel un-supervised approach based on deep learning network, called Bug-Sum. Our approach integrates an auto-encoder network for feature extraction with a novel metric (believability) to measure the degree to which a sentence is approved or disapproved within discussions. In addition, a dynamic selection strategy is employed to optimize the comprehensiveness of the auto-generated summary represented by limited words. Extensive experiments show that our approach outperforms 8 comparative approaches over two public datasets. In particular, the probability of adding controversial sentences that are clearly disapproved by other developers during the discussion, into the summary is reduced by up to 69.6%.","PeriodicalId":433703,"journal":{"name":"Proceedings of the 28th International Conference on Program Comprehension","volume":"286 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116486231","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
srcClone srcClone
Proceedings of the 28th International Conference on Program Comprehension Pub Date : 2020-07-13 DOI: 10.1145/3387904.3389271
Hakam W. Alomari, Matthew Stephan
{"title":"srcClone","authors":"Hakam W. Alomari, Matthew Stephan","doi":"10.1145/3387904.3389271","DOIUrl":"https://doi.org/10.1145/3387904.3389271","url":null,"abstract":"Detecting code clones is an established method for comprehending and maintaining systems. One important but challenging form of code clone detection involves detecting semantic clones, which are those that are semantically similar code segments that differ syntactically. Existing approaches to semantic clone detection do not scale well to large code bases and have room for improvement in their precision and recall. In this paper, we present a scalable slicing-based approach for detecting code clones, including semantic clones. We determine code segment similarity based on their corresponding program slices. We take advantage of a lightweight, publicly available, and scalable program slicing approach to compute the necessary information. Our approach uses dependency analysis to find and measure cloned elements, and provides insights into elements of the code that are affected by an entire clone set/-class. We have implemented our approach as a tool called srcClone. We evaluate it by comparing it to two semantic clone detectors in terms of clones, performance, and scalability; and perform recall and precision analysis using established benchmark scenarios. In our evaluation, we illustrate our approach is both relatively scalable and accurate. srcClone can also be used by program analysts to run on non-compilable and incomplete source code, which serves comprehension and maintenance tasks very well. We believe our approach is an important advancement in program comprehension that can help improve clone detection practices and provide developers greater insights into their software.","PeriodicalId":433703,"journal":{"name":"Proceedings of the 28th International Conference on Program Comprehension","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117337687","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
GGF
Proceedings of the 28th International Conference on Program Comprehension Pub Date : 2020-07-13 DOI: 10.1145/3387904.3389252
Li Wu, Fei Li, Youhua Wu, Tao Zheng
{"title":"GGF","authors":"Li Wu, Fei Li, Youhua Wu, Tao Zheng","doi":"10.1145/3387904.3389252","DOIUrl":"https://doi.org/10.1145/3387904.3389252","url":null,"abstract":"Syntax errors combined with obscure error messages generated by compilers usually annoy programmers and cause them to waste a lot of time on locating errors. The existing models do not utilize the structure in the code and just treat the code as token sequences. It causes low accuracy and poor performance on this task. In this paper, we propose a novel deep supervised learning model, called Graph-based Grammar Fix(GGF), to help programmers locate and fix the syntax errors. GGF treats the code as a mixture of the token sequences and graphs. The graphs build upon the Abstract Syntax Tree (AST) structure information. GGF encodes an erroneous code with its sub-AST structure, predicts the error position using pointer network and generates the right token. We utilized the DeepFix dataset which contains 46500 correct C programs and 6975 programs with errors written by students taking an introductory programming course. GGF is trained with the correct programs from the DeepFix dataset with intentionally injected syntax errors. After training, GGF could fix 4054 (58.12%) of the erroneous code, while the existing state of the art tool DeepFix fixes 1365 (19.57%) of the erroneous code.","PeriodicalId":433703,"journal":{"name":"Proceedings of the 28th International Conference on Program Comprehension","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114281878","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}
引用次数: 7
SimplyHover SimplyHover
Proceedings of the 28th International Conference on Program Comprehension Pub Date : 2020-07-13 DOI: 10.1145/3387904.3389297
Ahmad Jbara, Or Shacham, Bar Ben Michael, Omer Tavor
{"title":"SimplyHover","authors":"Ahmad Jbara, Or Shacham, Bar Ben Michael, Omer Tavor","doi":"10.1145/3387904.3389297","DOIUrl":"https://doi.org/10.1145/3387904.3389297","url":null,"abstract":"Code comprehension is a vital mental process in any maintenance activity. It becomes decisive in large code blocks, in particular those that are governed by if-else statements. These large blocks increase the spatial distance between the if statement and its else counterpart or other dependent else statements. This increased spatial complexity makes it hard for the developer to recall the if logical expression that he has just read and understood, so he needs to go back and read it again, then understand it, and eventually negate it to get the else implicit logical expression. In extreme cases the if-else pair might occur in different pages so the developer has to scroll back and forth to grasp them both. Furthermore, to understand the else implicit negated expression he might want to go back to the farthest if statement and understand the aggregated logical expression all the way to the else which makes the understanding of the else even harder. In this work, we introduce SimplyHover, a plug-in for the Eclipse IDE that brings the if condition next to its else counterpart or one of its descendants saving the developer to go back and forth over and over again. Furthermore, SimplyHover presents to the developer, when he hovers over else, the if conditions in their negated form and even lets him write his own simplification for that. In some cases, the tool even suggests its own simplification of the aggregated expression. To demonstrate the usage and usefulness of SimplyHover, a few code snippets from real software are presented.","PeriodicalId":433703,"journal":{"name":"Proceedings of the 28th International Conference on Program Comprehension","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127387006","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}
引用次数: 2
OpenSZZ
Proceedings of the 28th International Conference on Program Comprehension Pub Date : 2020-07-13 DOI: 10.1145/3387904.3389295
Valentina Lenarduzzi, Fabio Palomba, Davide Taibi, D. Tamburri
{"title":"OpenSZZ","authors":"Valentina Lenarduzzi, Fabio Palomba, Davide Taibi, D. Tamburri","doi":"10.1145/3387904.3389295","DOIUrl":"https://doi.org/10.1145/3387904.3389295","url":null,"abstract":"The accurate identification of defect-inducing commits represents a key problem for researchers interested in studying the naturalness of defects and defining defect prediction models. To tackle this problem, software engineering researchers have relied on and proposed several implementations of the well-known Sliwerski-Zimmermann-Zeller (SZZ) algorithm. Despite its popularity and wide usage, no open-source, publicly available, and web-accessible implementation of the algorithm has been proposed so far. In this paper, we prototype and make available one such implementation for further use by practitioners and researchers alike. The evaluation of the proposed prototype showed competitive results and lays the foundation for future work. This paper outlines our prototype, illustrating its usage and reporting on its evaluation in action.","PeriodicalId":433703,"journal":{"name":"Proceedings of the 28th International Conference on Program Comprehension","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131384516","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
BugVis
Proceedings of the 28th International Conference on Program Comprehension Pub Date : 2020-07-13 DOI: 10.1145/3387904.3389299
David Bowes, Jean Petrić, T. Hall
{"title":"BugVis","authors":"David Bowes, Jean Petrić, T. Hall","doi":"10.1145/3387904.3389299","DOIUrl":"https://doi.org/10.1145/3387904.3389299","url":null,"abstract":"In this paper we present BugVis, our tool which allows the visualisation of the lifetime of a code fault. The commit history of the fault from insertion to fix is visualised. Unlike previous similar tools, BugVis visualises only the lines of each commit involved in the fault. The visualisation creates a commit slice throughout the history of the fault which enables comprehension of the evolution of the code involved in the fault.","PeriodicalId":433703,"journal":{"name":"Proceedings of the 28th International Conference on Program Comprehension","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132956332","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
Proceedings of the 28th International Conference on Program Comprehension 第28届程序理解国际会议论文集
{"title":"Proceedings of the 28th International Conference on Program Comprehension","authors":"","doi":"10.1145/3387904","DOIUrl":"https://doi.org/10.1145/3387904","url":null,"abstract":"","PeriodicalId":433703,"journal":{"name":"Proceedings of the 28th International Conference on Program Comprehension","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132489434","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
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学术官方微信