• 検索結果がありません。

リリースと優先順位を考慮した不具合修正タスク割当の最適化

N/A
N/A
Protected

Academic year: 2021

シェア "リリースと優先順位を考慮した不具合修正タスク割当の最適化"

Copied!
3
0
0

読み込み中.... (全文を見る)

全文

(1)

氏 名 ( 本 籍 ) 柏 祐太郎(和歌山県) 学 位 の 種 類 博 士(工学) 学 位 授 与 番 号 甲 第99号 学 位 授 与 日 付 令和2年3月25日 専 攻 システム工学専攻

学 位 論 文 題 目 Release-Aware and Prioritized Bug-Fixing Task Assignment Optimization

学位論文審査委員 (主査)教 授 風間 一洋 (副査)教 授 和田 俊和 准教授 大平 雅雄 学外委員 亀井 靖高

論文内容の要旨

Due to a large number of bug reports, project managers consume much time to read bug reports, prioritize bugs to determine which the bugs should be fixed by the release date, and assign developers to fix the bugs. To mitigate the workload, many bug assignment methods have been proposed with an aim to automate the assignments.

However, Park et al. report that most of the methods tend to concentrate the assignment of bugs to specific developers. The task of concentrating on specific developers, by the traditional methods, would reduce the number of bugs that they can actually fix by the next release date. This is because most projects have releases planned in advance, and the scope of the developers (even well­experienced) is limited to the number of bug­fixes by the release date.

This thesis proposes the Release­Aware and Prioritized Task­assignment Optimization Framework (RAPTOR), which moderates the bug­fixing loads for specific developers in order to increase the number of bugs fixed by the release date.

In Chapter 3, for the first study to build a strategy to prioritize bugs, we interviewed 322 developers from GitHub to identify the bugs that are impactful based on those they encountered in practice. We manually inspect and classify actual bug reports from the responses. As a result, we show that there are a wide variety of high impact bugs. Particularly, developers think security and breakage bugs are highly important for FLOSS developers.

Furthermore, we show that 66% of the high impact bugs have a higher importance in the projects (especially in the projects that strictly handle bugs). This helps us select bugs for the next release when the projects have a myriad of bugs.

Related publication: International conference (Refereed)

­ Yutaro Kashiwa, Akinori !hara, and Masao Ohira, "What Arc the Perception Gaps between Floss Developers and SE Researchers?" In Proceedings of the 15th International Conference on Open Source Systems, pages 44­57. May 2019.

­ Yutaro Kashiwa. Hayato Yoshiyuki, Yusuke Kukita, and Masao Ohira, "A Pilot Study of Diversity in High Impact Bugs," In Proceedings of 30th International Conference on Software Maintenance and Evolution (ICSME2014), pages 536­540, September 2014.

(2)

The prediction will play a crucial role in selecting which bugs should be fixed by the release date. Although some studies address building priority prediction models, the accuracy of the prediction is quite low. This is because they use data derived from the complete development process.

Most projects have release cycles, and the data is produced in requirements analysis, design, implementation, test, and debug phases. According to the aims, developers would switch what they focus on, such as either implementing new features or fixing defects. Furthermore, depending on what they focus on, the characteristics of the produced data would vary. Disregarding the characteristics for specific periods makes the quality of data­driven tools lower. Especially, RAPTOR is designed for testing and debugging phase, and we need a priority prediction method specialized in the periods.

Throughout a case study on the Eclipse Platform project, we show that developers' activity varies during the release cycle. Based on these findings, we build release cycle­aware models which is the models of which data is derived from appropriate periods. We find that cycle­aware models outperform the traditional model which uses whole data during the development.

In Chapter 5, we finally address the main problems that prior work concentrates their assignments on a small number of particular developers. We construct RAPTOR and evaluate it through a case study on Eclipse Platform, GNU compiler collection, and Mozilla Firefox and showed that (1) RAPTOR mitigates the situation where bug­fixing tasks are concentrated to a small number of developers; (2) RAPTOR increases the number of high priority bugs that developers can fix by the next release date; (3) RAPTOR can reduce the time to fix bugs, compared with the manual bug triaging method and the existing methods.

Related publication: Academic journal

­ 柏祐太郎,大平雅雄,阿萬裕久,亀井靖高."大規模 OSS 開発における不具合修正時間の短縮化を目的としたバグト リアージ手法" 情報処理学会論文誌. volume 56. number 2, pages 669­­681, 2015 年 2 月.

­ Yutaro Kashiwa and Masao Ohira, " Release­Aware and Prioritized Bug­fixing Task assignment Optimization." Transaction of The Institute of Electronics, Information and Communication Engineers, volume El 03­0. number 02. pp. (to appear), February.

Related publication: International conference (Refereed)

­ Yutaro Kashiwa, " RAPTOR: Release­Aware and Prioritized Bug­fixing Task assignment Optimization" In Proceedings of the 35th International Conference on Software Maintenance and Evolution. pp. 629­­633, October 2019.

(3)

論文審査の結果の要旨

本論文では,バグ修正作業を適任の開発者に割り当てるバグトリアージの際にリリースサイクルを考慇することで, 特定の開発者への負荷を軽減させると同時に,リリースまでにより多くのバグを修正できるようにする RAPTOR(Release·Aware and Prioritized Task­assignment Optimization fRamework)と呼ぶ手法を提案している. 本論文は,1.GitHubの著名開発者へのアンケートを用いたバグの種類と重要性に関する分析,2.リリースサイクルを 考慮したバグ優先度の予測モデル,3.リリースサイクルを考慮したバグ修正作業の優先度割り当て手法から構成され る.本論文では,近年のオープンソース開発で主流の規則的・周期的なリリースサイクルに注目し,リリースサイク ルの段階を考慮することで従来手法よりも性能を向上できたことが示されていることから,新規性と有効性が充分に 示されており,博士論文に値すると判定した.

最終試験の結果の要旨

令和2 年 2 月 10 日にシステム工学部北 1 号館 6 階 A605 会議室にて公聴会を実施した.参加者は審査委員会委員全 員と他6 名であった公聴会は午後 1 時 00 分より開始し,45 分の発表の後に 25 分の質疑応答を行なった.質疑応答で は,優先度予測性能に関する質疑や,教師データの作成方法に関する質疑,開発者のバグ修正能力とリグレッションに 関する質疑,重大なバグの分析の既存研究との差に関する質疑,データの季節変動と提案手法の限界に関する質疑があ り,何れの例問に対しても適切な回答が得られた上記の結果を総合的に判断し,学位申請者は博士の学位を得るに足る 学識・能力を有していると判断したため,最終試験は合格と判定する.

参照

関連したドキュメント

Proof of Theorem 2: The Push-and-Pull algorithm consists of the Initialization phase to generate an initial tableau that contains some basic variables, followed by the Push and

Proof of Theorem 2: The Push-and-Pull algorithm consists of the Initialization phase to generate an initial tableau that contains some basic variables, followed by the Push and

The set of families K that we shall consider includes the family of real or imaginary quadratic fields, that of real biquadratic fields, the full cyclotomic fields, their maximal

In fact in order to show that Condorcet rankings are medians we are going to use a more general notion of median namely the notion of metric median in a metric space.. I begin by

In particular this implies a shorter and much more transparent proof of the combinatorial part of the Mullineux conjecture with additional insights (Section 4). We also note that

More recently, Hajdu and Szikszai [12] have investigated the original problem of Pillai when applied to sets of consecutive terms of Lucas and Lehmer sequences.. It is easy to see

In the next paper [6] we rephrased the theorem (1) above in terms of graph cohomology using an integral version of Kontsevich’s theorem that the coho- mology of the mapping class

Given a marked Catalan tree (T, v), we will let [T, v] denote the equivalence class of all trees isomorphic to (T, v) as a rooted tree, where the isomorphism sends marked vertex