• Journal of Internet Computing and Services
• /
• v.21 no.5
• /
• pp.129-137
• /
• 2020

Recently, software size and program code complexity have increased due to application to various fields of software. Accordingly, the existence of program bugs inevitably occurs, and the cost of software maintenance is increasing. In open source projects, developers spend a lot of debugging time when solving a bug report assigned. To solve this problem, in this paper, we apply SeqGAN algorithm to software bug repair. In detail, the SeqGAN model is trained based on the source code. Open similar source codes during the learning process are also used. To evaluate the suitability for the generated candidate patch, a fitness function is applied, and if all test cases are passed, software bug correction is considered successful. To evaluate the efficiency of the proposed model, it was compared with the baseline, and the proposed model showed better repair.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.755-763
• /
• 2015

As fixing bugs is a large part of software development and maintenance, estimating the time to fix bugs -bug fixing time- is extremely useful when planning software projects. Therefore, in this study, we propose a way to estimate bug fixing time using bug reports. First, we classify previous bug reports with meta fields by applying a k-NN method. Next, we compute the similarity of the new bug and previous bugs by using data from bug reports. Finally, we estimate how long it will take to fix the new bug using the time it took to repair similar bugs. In this study, we perform experiments with open source software. The results of these experiments show that our approach effectively estimates the bug fixing time.

• Journal of Broadcast Engineering
• /
• v.27 no.2
• /
• pp.240-243
• /
• 2022

Tracking the location of program defects is an essential task for software maintenance and repair. When a bug report is submitted, bug localization is a costly task because of the developer's manual effort. Many researchers have tried to automate the task, but according to the reported results, the performance is still insufficient in practice. Therefore, in this study, we analyzed a large amount of bug report data and the latest research and found that the existing studies used only one preprocessing without considering the characteristics of the bug report. In this paper, to solve the problems mentioned earlier, we propose a pre/post-processing operator selection approach for bug localization.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.261-273
• /
• 2022

Over the last decade, the scientific community has been actively developing technologies for automated software bug fixes called Automated Program Repair (APR). Several APR techniques have recently been proposed to effectively address multiple classroom programming errors. However, little attention has been paid to the advances in effective APR techniques for software bugs that are widely occurring during the software life cycle maintenance phase. To further enhance the concept of software testing and debugging, we recommend an optimized automated software repair approach based on hybrid technology (OAPR-HOML'1). The first contribution of the proposed OAPR-HOML'1 technique is to introduce an improved grasshopper optimization (IGO) algorithm for fault location identification in the given test projects. Then, we illustrate an opposition learning based artificial neural network (OL-ANN) technique to select AST node-level transformation schemas to create the sketches which provide automated program repair for those faulty projects. Finally, the OAPR-HOML'1 is evaluated using Defects4J benchmark and the performance is compared with the modern technologies number of bugs fixed, accuracy, precession, recall and F-measure.

• International Journal of Reliability and Applications
• /
• v.2 no.3
• /
• pp.147-160
• /
• 2001

The reliability of computer software is of prime importance for all developers of software. The complicated nature of detecting and removing faults from software has led to a plethora of models for reliability growth. One of the most basic of these is the Jelinski Moranda model, where it is assumed that there are N faults in the software, and that in testing, bugs (or faults) are encountered (and removed when defected) according to a stochastic process at a rate which at a given point in time is proportional to the number of bugs remaining in the system. In this research, we consider the possibility that imperfect repair may occur in any attempt to remove a detected bug in the Jelinski Moranda model. We let p represent the probability that a fault which is discovered or detected is actually perfectly repaired. The possibility that the probability p may differ before and after release of the software is also considered. The distribution of both the number of bugs detected and perfectly repaired in a given time period is studied. Cost models for the development and release of software are investigated, and the impact of the parameter p on the optimal release time minimizing expected costs is assessed.