• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.312-315
• /
• 2012

이 논문은 한 대의 모바일 로봇의 모션 계획 알고리즘인 Bug1과 Bug2를 개선한 알고리즘을 제안한다. 장애물이 있는 환경에서 목표지점까지 도달하기 위한 경로 계획 알고리즘으로 Bug1과 Bug2가 제안되었지만, 이 두 알고리즘은 모두 장애물 형태에 따라 탐사 시간이 오래 걸릴 수 있다는 단점이 있다. Bug2 알고리즘은 Bug1 알고리즘을 개선한 형태로 제안되었지만 심지어 극적적인 경우에는 무한 루프에 빠진다는 단점이 있다. 이 논문에서는 이러한 단점을 해결하기 위해 한 쌍의 모바일 로봇을 이용한 병렬 탐색 PBug1, PBug2 알고리즘을 제안한다. 제안된 PBug1과 PBug2 알고리즘은 각각 Bug1과 Bug2의 속도를 보장하며 일반적으로 빠른 탐사시간을 보인다. 측히 PBug2 알고리즘은 Bug2와 달리 무한루프에 빠지는 경우가 없다. 제안된 알고리즘의 성능을 평가하기 위해 PBug1, PBug2 알고리즘을 구현하여 Bug1, Bug2 알고리즘과 비교하였다. 실험결과 PBug1 알고리즘은 Bug1 알고리즘보다 탐사 시간이 64.9%로 감소하였고 PBug2 알고리즘은 Bug1 알고리즘과 비슷한 탐사 시간을 보였다.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.967-985
• /
• 2019

Bug report processing is a key element of bug fixing in modern software maintenance. Bug reports are not processed immediately after submission and involve several processes such as bug report deduplication and bug report triage before bug fixing is initiated; however, this method of bug fixing is very inefficient because all these processes are performed manually. Software engineers have persistently highlighted the need to automate these processes, and as a result, many automation techniques have been proposed for bug report processing; however, the accuracy of the existing methods is not satisfactory. Therefore, this study focuses on surveying to improve the accuracy of existing techniques for bug report processing. Reviews of each method proposed in this study consist of a description, used techniques, experiments, and comparison results. The results of this study indicate that research in the field of bug deduplication still lacks and therefore requires numerous studies that integrate clustering and natural language processing. This study further indicates that although all studies in the field of triage are based on machine learning, results of studies on deep learning are still insufficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1583-1598
• /
• 2019

Recently, software has increased in complexity and been applied in various industrial fields. As a result, the presence of software bugs cannot be avoided. Various bug severity prediction methodologies have been proposed, but their performance needs to be further improved. In this study, we propose a novel technique for bug severity prediction in cross projects such as Eclipse, Mozilla, WireShark, and Xamarin by using topic modeling and similarity (i.e., KL-divergence). First, we construct topic models from bug repositories in cross projects using Latent Dirichlet Allocation (LDA). Then, we find topics in each project that contain the most numerous similar bug reports by using a new bug report. Next, we extract the bug reports belonging to the selected topics and input them to a Naïve Bayes Multinomial (NBM) algorithm. Finally, we predict the bug severity in the new bug report. In order to evaluate the performance of our approach and to verify the difference between cross projects and single project, we compare it with the Naïve Bayes Multinomial approach; the Lamkanfi methodology, which is a well-known bug severity prediction approach; and an emotional similarity-based bug severity prediction approach. Our approach exhibits a better performance than the compared methods.

• KIISE Transactions on Computing Practices
• /
• v.22 no.5
• /
• pp.235-239
• /
• 2016

'Commit-bug link', the link between commit history and bug reports, is used for software maintenance and defect prediction in bug tracking systems. Previous studies have shown that the links are automatically detected based on text similarity, time interval, and keyword. Existing approaches depend on the quality of commit history and could thus miss several links. In this paper, we proposed a technique to link commit and bug report using not only messages of commit history, but also the similarity of files in the commit history coupled with bug reports. The experimental results demonstrated the applicability of the suggested approach.

• KIISE Transactions on Computing Practices
• /
• v.21 no.9
• /
• pp.616-621
• /
• 2015

Recently developed software systems have many components, and their complexity is thus increasing. Last year, about 375 bug reports in one day were reported to a software repository in Eclipse and Mozilla open source projects. With so many bug reports submitted, developers' time and efforts have increased unnecessarily. Since the bug severity is manually determined by quality assurance, project manager or other developers in the general bug fixing process, it is biased to them. They might also make a mistake on the manual decision because of the large number of bug reports. Therefore, in this study, we propose an approach of bug severity prediction to solve these problems. First, we find similar topics within a new bug report and reduce the candidate reports of the topic by using the meta field of the bug report. Next, we train the reduced reports by applying Naive Bayes Multinomial. Finally, we predict the severity of the new bug report. We compare our approach with other prediction algorithms by using bug reports in open source projects. The results show that our approach better predicts bug severity than other algorithms.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.866-869
• /
• 2020

소프트웨어 개발 환경이 빠르게 변화함에 따라 시스템의 복잡성이 증가하고 있다. 이에 따라 크고 작은 소프트웨어의 버그를 피할 수 없게 되며 이를 효율적으로 처리하기 위해 Bug report 를 사용한다. 하지만, Bug report 에서 개발자가 해당 Bug report 의 우선순위를 결정하는 과정은 노력과 비용 그리고 시간을 많이 소모하게 만든다. 따라서, 본 논문에서는 Bug report 내의 Stack trace 를 기반으로 Bug 의 우선순위를 자동적으로 추천하는 기법을 제안한다. 이를 위해 본 연구에서는 첫 번째로 Bug report 로부터 Stack trace 를 추출하였으며 Stack trace 의 3 가지 요소(Exception, Reason 그리고 Stack frame)에 TF-IDF, Word2Vec 그리고 Stack overflow 를 사용하여 특징 벡터를 정의하였다. 그리고 Bug 의 우선순위 추천 모델을 생성하기 위해 4 가지의 Classification 알고리즘을(Random Forest, Decision Tree, XGBoost, SVM)을 적용하였다. 평가에서는 266,292 개의 JDK library 의 Bug report 데이터를 수집하였고 그중 Stack trace 를 가진 Bug report 로부터 68%의 정확도를 산출하였다.

• Journal of Information Technology Services
• /
• v.18 no.5
• /
• pp.53-70
• /
• 2019

As information security becomes more important as the fourth industrial revolution gradually emerges, an efficient and effective way to find vulnerabilities in information systems is becoming an essential requirement of information security. As the point of the protection of current information and the protection of the future industry, the Korean government has paid attention to the bug bounty, which has been recognized for its efficiency and effectiveness and has implemented through the Korea Internet Security Agency's S/W vulnerability bug bounty program. However, there are growing problems about the S/W vulnerability bug bounty program of the Korea Internet Security Agency, which has been operating for about 7 years. The purpose of this study is to identify the problems in Korean bug bounty policies through the characteristics of the bug bounty program, and to suggest the direction of the government's policy to activate the bug bounty like changes in the government's approach utilizing the market.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.12
• /
• pp.511-522
• /
• 2014

During the development of the software, a variety of bugs are reported. Several bug tracking systems, such as, Bugzilla, MantisBT, Trac, JIRA, are used to deal with reported bug information in many open source development projects. Bug reports in bug tracking system would be triaged to manage bugs and determine developer who is responsible for resolving the bug report. As the size of the software is increasingly growing and bug reports tend to be duplicated, bug triage becomes more and more complex and difficult. In this paper, we present an approach to assign bug reports to appropriate developers, which is a main part of bug triage task. At first, words which have been included the resolved bug reports are classified according to each developer. Second, words in newly bug reports are selected. After first and second steps, vectors whose items are the selected words are generated. At the third step, TF-IDF(Term frequency - Inverse document frequency) of the each selected words are computed, which is the weight value of each vector item. Finally, the developers are recommended based on the similarity between the developer's word vector and the vector of new bug report. We conducted an experiment on Eclipse JDT and CDT project to show the applicability of the proposed approach. We also compared the proposed approach with an existing study which is based on machine learning. The experimental results show that the proposed approach is superior to existing method.

• Journal of KIISE:Software and Applications
• /
• v.41 no.8
• /
• pp.557-568
• /
• 2014

Recently, software projects have been increasing and getting complex. Due to the large number of submitted bug reports, developers' workload increases. Generally in bug triage process, the triagers assign the bug report to fixer (developer) in order to resolve the bug. However, bug reports have been reassigned to other developers because fixers are not suitable. This is why the triagers did not correctly check and understand the bug report and decide the appropriate developers to fix the bug. This results in increase of developers' time and efforts in software maintenance. To resolve these problems, in this paper, we propose a novel method for developer recommendation based on topic model and social network. First, we build a basis of topic(s) from bug reports. Next, when a new bug report (test data set) comes, we select the most similar topic(s) and extract the participated developers from the topic(s). Finally, by applying social network, we analyze the developers' behavior (comment and commit activity) and recommend the appropriate developers. In this paper we compare our work with related studies through performance experiments on open source projects. The results show that our approach is more effective than other studies in bug triage.