Getafix: learning to fix bugs automatically
نویسندگان
چکیده
منابع مشابه
Predicting Effort to Fix Software Bugs
Predicting the time and effort for a software problem has long been a difficult task. We present an approach that predicts the fixing effort for an issue. Our technique leverages existing issue tracking systems: given a new issue report, we search for similar, earlier reports and use their average time as a prediction. Our approach thus allows for early effort estimation, helping in assigning i...
متن کاملSix ways to automatically find software bugs
With the rapid development of hardware and the emerging of smart devices like smart phones and wearable gadgets, software, the soul of those devices, becomes more and more important. However, program bugs, which often cause system failure and misbehaviors, is one of the most severe stumbling blocks for even further development of those technologies. Since automatically detecting all bugs in a p...
متن کاملFix Me Up: Repairing Access-Control Bugs in Web Applications
Access-control policies in Web applications ensure that only authorized users can perform security-sensitive operations. These policies usually check user credentials before executing actions such as writing to the database or navigating to privileged pages. Typically, every Web application uses its own, hand-crafted program logic to enforce access control. Within a single application, this log...
متن کاملHarvesting Fix Hints in the History of Bugs
In software development, fixing bugs is an important task that is time consuming and cost-sensitive. While many approaches have been proposed to automatically detect and patch software code, the strategies are limited to a set of identified bugs that were thoroughly studied to define their properties. They thus manage to cover a niche of faults such as infinite loops. We build on the assumption...
متن کاملLearning to Automatically Discover Meronyms
We present a system for automatically discovering meronyms (noun pairs in a part-whole relationship) from text corpora. More precisely, our system begins by parsing and extracting dependency paths similar to (but not the same as) those used by (Snow et al., 2004). For each noun pair we calculate an empirical distribution over dependency relations, which are then used as features of a Support Ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3360585