2021 IEEE/ACM International Workshop on Automated Program Repair (APR)最新文献

[Title page] (标题页)

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-06-01 DOI: 10.1109/apr52552.2021.00001

引用次数: 0

Challenging the Stigma of Formal Program Repair 挑战正式程序修复的耻辱

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-06-01 DOI: 10.1109/APR52552.2021.00015

Bat-Chen Rothenberg

引用次数: 0

[Copyright notice] (版权)

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-06-01 DOI: 10.1109/apr52552.2021.00003

引用次数: 0

Automated Code Repair to Ensure Spatial Memory Safety 自动代码修复以确保空间内存安全

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-06-01 DOI: 10.1109/APR52552.2021.00013

William Klieber, R. Martins, Ryan Steele, Matt Churilla, Michael McCall, David Svoboda

{"title":"Automated Code Repair to Ensure Spatial Memory Safety","authors":"William Klieber, R. Martins, Ryan Steele, Matt Churilla, Michael McCall, David Svoboda","doi":"10.1109/APR52552.2021.00013","DOIUrl":"https://doi.org/10.1109/APR52552.2021.00013","url":null,"abstract":"We present a technique for repairing C code to protect against potential violations of spatial memory safety. Many existing techniques can harden software against memory bugs as part of a compiler pass. However, this creates dependencies on the compiler and makes it difficult to fine-tune or even inspect the repairs. We propose an automated technique for repairing the source code to eliminate spatial memory vulnerabilities. Performing the repair at the source-code level introduces a new challenge: analysis and transformation are most easily done on an intermediate representation (IR), but existing techniques using IRs have fundamental limitations in regards to translating changes back to the level of source code. We break this challenge into two parts: (1) translating changes at the level of the IR to the abstract syntax tree (AST) level, and (2) translating changes at the AST level back to the original source-code text. Preemptively repairing potential memory bugs leads to a tradeoff between performance overhead and memory safety. While for safety-critical applications this trade-off may be acceptable, for other applications we can reduce the performance overhead by only repairing suspicious locations. We implemented our approach in a tool called ACR and show that it can repair spatial memory vulnerabilities on buggy programs from the Software Verification Competition. Additionally, we also ran ACR on medium-size programs and preliminary results show the scalability of ACR for thousands of lines of code. Finally, we integrated ACR with static analysis tools and show that the performance overhead is small when repairing only locations that are flagged by a static analyzer.","PeriodicalId":257468,"journal":{"name":"2021 IEEE/ACM International Workshop on Automated Program Repair (APR)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125383006","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

Domain invariant-based spreadsheet debugging 基于域不变量的电子表格调试

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-06-01 DOI: 10.1109/APR52552.2021.00012

Xiaoyan Wang, Jie Zhao

引用次数: 0

Refining Fitness Functions for Search-Based Program Repair 改进基于搜索的程序修复适应度函数

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-06-01 DOI: 10.1109/APR52552.2021.00008

Zhiqiang Bian, Aymeric Blot, J. Petke

{"title":"Refining Fitness Functions for Search-Based Program Repair","authors":"Zhiqiang Bian, Aymeric Blot, J. Petke","doi":"10.1109/APR52552.2021.00008","DOIUrl":"https://doi.org/10.1109/APR52552.2021.00008","url":null,"abstract":"Debugging is a time-consuming task for software engineers. Automated Program Repair (APR) has proved successful in automatically fixing bugs for many real-world applications. Search-based APR generates program variants that are then evaluated on the test suite of the original program, using a fitness function. In the vast majority of search-based APR work only the Boolean test case result is taken into account when evaluating the fitness of a program variant. We pose that more fine-grained fitness functions could lead to a more diverse fitness landscape, and thus provide better guidance for the APR search algorithms. We thus present 2Phase, a fitness function that also incorporates the output of test case failures, and compare it with ARJAe, that shares the same principles, and the standard fitness, that only takes the Boolean test case result into consideration. We conduct the comparison on 16 buggy programs from the QuixBugs benchmark using the Gin genetic improvement framework. The results show no significant difference in the performance of all three fitness functions considered. However, Gin was able to find 8 correct fixes, more than any of the APR tools in the recent QuixBugs study.","PeriodicalId":257468,"journal":{"name":"2021 IEEE/ACM International Workshop on Automated Program Repair (APR)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122505823","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

Please hold on: more time = more patches? Automated program repair as anytime algorithms 请稍等:更多的时间=更多的补丁?自动程序修复随时算法

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-06-01 DOI: 10.1109/APR52552.2021.00009

Duc-Ly Vu, Ivan Pashchenko, F. Massacci

引用次数: 2

Tackling Software Architecture Erosion: Joint Architecture and Implementation Repairing by a Knowledge-based Approach 解决软件架构侵蚀:基于知识的联合架构和实现修复

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-04-28 DOI: 10.1109/APR52552.2021.00011

Christoph Knieke, A. Rausch, Mirco Schindler

引用次数: 1

Exploring Plausible Patches Using Source Code Embeddings in JavaScript 在JavaScript中使用源代码嵌入探索可信的补丁

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-03-31 DOI: 10.1109/APR52552.2021.00010

Viktor Csuvik, Dániel Horváth, Márk Lajkó, László Vidács

{"title":"Exploring Plausible Patches Using Source Code Embeddings in JavaScript","authors":"Viktor Csuvik, Dániel Horváth, Márk Lajkó, László Vidács","doi":"10.1109/APR52552.2021.00010","DOIUrl":"https://doi.org/10.1109/APR52552.2021.00010","url":null,"abstract":"Despite the immense popularity of the Automated Program Repair (APR) field, the question of patch validation is still open. Most of the present-day approaches follow the so-called Generate-and-Validate approach, where first a candidate solution is being generated and after validated against an oracle. The latter, however, might not give a reliable result, because of the imperfections in such oracles; one of which is usually the test suite. Although (re-) running the test suite is right under one's nose, in real life applications the problem of over- and underfitting often occurs, resulting in inadequate patches. Efforts that have been made to tackle with this problem include patch filtering, test suite expansion, careful patch producing and many more. Most approaches to date use post-filtering relying either on test execution traces or make use of some similarity concept measured on the generated patches. Our goal is to investigate the nature of these similarity-based approaches. To do so, we trained a Doc2Vec model on an open-source JavaScript project and generated 465 patches for 10 bugs in it. These plausible patches alongside with the developer fix are then ranked based on their similarity to the original program. We analyzed these similarity lists and found that plain document embeddings may lead to misclassification - it fails to capture nuanced code semantics. Nevertheless, in some cases it also provided useful information, thus helping to better understand the area of Automated Program Repair.","PeriodicalId":257468,"journal":{"name":"2021 IEEE/ACM International Workshop on Automated Program Repair (APR)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129145","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

Extractive Summarization of Related Bug-fixing Comments in Support of Bug Repair 支持Bug修复的相关Bug修复评论的摘录摘要

2021 IEEE/ACM International Workshop on Automated Program Repair (APR) Pub Date : 2021-03-28 DOI: 10.1109/APR52552.2021.00014

Rrezarta Krasniqi

{"title":"Extractive Summarization of Related Bug-fixing Comments in Support of Bug Repair","authors":"Rrezarta Krasniqi","doi":"10.1109/APR52552.2021.00014","DOIUrl":"https://doi.org/10.1109/APR52552.2021.00014","url":null,"abstract":"When developers investigate a new bug report, they search for similar previously fixed bug reports and discussion threads attached to them. These discussion threads convey important information about the behavior of the bug including relevant bug-fixing comments. Often times, these discussion threads become extensively lengthy due to the severity of the reported bug. This adds another layer of complexity, especially if relevant bug-fixing comments intermingle with seemingly unrelated comments. To manually detect these relevant comments among various cross-cutting discussion threads can become a daunting task when dealing with high volume of bug reports. To automate this process, our focus is to initially extract and detect comments in the context of query relevance, the use of positive language, and semantic relevance. Then, we merge these comments in the form of a summary for easy understanding. Specifically, we combine Sentiment Analysis, and the TextRank Model with the baseline Vector Space Model (VSM). Preliminary findings indicate that bug-fixing comments tend to be positive and there exists a semantic relevance with comments from other cross-cutting discussion threads. The results also indicate that our combined approach improves overall ranking performance against the baseline VSM.","PeriodicalId":257468,"journal":{"name":"2021 IEEE/ACM International Workshop on Automated Program Repair (APR)","volume":"122 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124524833","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