研究者詳細 - 大平　雅雄

論文 - 大平　雅雄

分割表示80 件中 1 - 20 件目／全件表示 >>

A Release-Aware Bug Triaging Method Considering Developers' Bug-Fixing Loads

Yutaro Kashiwa, Masao Ohira

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS ( IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG ) E103D ( 2 ) 348 - 362 2020年02月 [査読有り]

This paper proposes a release-aware bug triaging method that aims to increase the number of bugs that developers can fix by the next release date during open-source software development. A variety of methods have been proposed for recommending appropriate developers for particular bug-fixing tasks, but since these approaches only consider the developers' ability to fix the bug, they tend to assign many of the bugs to a small number of the project's developers. Since projects generally have a release schedule, even excellent developers cannot fix all the bugs that are assigned to them by the existing methods. The proposed method places an upper limit on the number of tasks which are assigned to each developer during a given period, in addition to considering the ability of developers. Our method regards the bug assignment problem as a multiple knapsack problem, finding the best combination of bugs and developers. The best combination is one that maximizes the efficiency of the project, while meeting the constraint where it can only assign as many bugs as the developers can fix during a given period. We conduct the case study, applying our method to bug reports from Mozilla Firefox, Eclipse Platform and GNU compiler collection (GCC). We find that our method has the following properties: (1) it can prevent the bug-fixing load from being concentrated on a small number of developers; (2) compared with the existing methods, the proposed method can assign a more appropriate amount of bugs that each developer can fix by the next release date; (3) it can reduce the time taken to fix bugs by 35%-41%, compared with manual bug triaging;

DOI

Hierarchical Clustering of OSS License Statements toward Automatic Generation of License Rules.

Yunosuke Higashi, Masao Ohira, Yutaro Kashiwa, Yuki Manabe 0001

JIP 27 ( 1 ) 42 - 50 2019年 [査読有り]

Reusing open source software (OSS) components for one's own software products has become common in the modern software development. Automated license identification tools have been proposed to help developers identify OSS licenses, since a large number of licenses sometimes must be checked before attempting to reuse. Of the existing tools, Ninka[1] can most correctly identify licenses of each source file by using regular expressions. In case Ninka does not have license identification rules for unknown licenses, Ninka reports these as "unknown licenses" which must be checked by developers manually. Since completely-new or derived OSS licenses appear nearly every year, a license identification tool should be appropriately maintained by adding regular expressions corresponding to the new licenses. The final goal of our study is to construct a method to automatically create candidate license rules to be added to a license identification tool such as Ninka. Toward achieving the goal, files identified as unknown licenses must be classified by license firstly. In this paper, we propose a hierarchical clustering which divides unknown licenses into clusters of files with a single license. We conduct a case study to confirm the usefulness of our clustering method when it is applied for classifying 2,801, 1,230 and 2,446 unknown license statement files for Linux Kernel v4.4.6, FreeBSD v10.3.0 and Debian v7.8.0 respectively. As a result, it is confirmed that our method can create clusters which are suitable as candidates for generating license rules automatically.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.27(2019) (online)DOI http://dx.doi.org/10.2197/ipsjjip.27.42------------------------------Reusing open source software (OSS) components for one's own software products has become common in the modern software development. Automated license identification tools have been proposed to help developers identify OSS licenses, since a large number of licenses sometimes must be checked before attempting to reuse. Of the existing tools, Ninka[1] can most correctly identify licenses of each source file by using regular expressions. In case Ninka does not have license identification rules for unknown licenses, Ninka reports these as "unknown licenses" which must be checked by developers manually. Since completely-new or derived OSS licenses appear nearly every year, a license identification tool should be appropriately maintained by adding regular expressions corresponding to the new licenses. The final goal of our study is to construct a method to automatically create candidate license rules to be added to a license identification tool such as Ninka. Toward achieving the goal, files identified as unknown licenses must be classified by license firstly. In this paper, we propose a hierarchical clustering which divides unknown licenses into clusters of files with a single license. We conduct a case study to confirm the usefulness of our clustering method when it is applied for classifying 2,801, 1,230 and 2,446 unknown license statement files for Linux Kernel v4.4.6, FreeBSD v10.3.0 and Debian v7.8.0 respectively. As a result, it is confirmed that our method can create clusters which are suitable as candidates for generating license rules automatically.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.27(2019) (online)DOI http://dx.doi.org/10.2197/ipsjjip.27.42------------------------------

DOI

大規模OSS開発における不具合修正時間の短縮化を目的としたバグトリアージ手法

柏祐太郎, 大平雅雄, 阿萬裕久, 亀井靖高

情報処理学会論文誌ジャーナル(Web) ( 一般社団法人情報処理学会 ) 56 ( 2 ) 669-681 (WEB ONLY) - 681 2015年02月 [査読有り]

本論文では，大規模OSS開発における不具合修正時間の短縮化を目的としたバグトリアージ手法を提案する．提案手法は，開発者の適性に加えて，開発者が一定期間に取り組めるタスク量の上限を考慮している点に特徴がある．Mozilla FirefoxおよびEclipse Platformプロジェクトを対象としたケーススタディを行った結果，提案手法について以下の3つの効果を確認した．(1)一部の開発者へタスクが集中するという問題を緩和できること．(2)現状のタスク割当て方法に比べFirefoxでは50%（Platformでは誤差が大きすぎるため計測不能），既存手法に比べFirefoxでは34%，Platformでは38%の不具合修正時間を削減できること．(3)提案手法で用いた2つの設定，プリファレンス（開発者の適性）と上限（開発者が取り組むことのできる時間の上限）が，タスクの分散効果にそれぞれ同程度寄与すること．This paper proposes a bug triaging method to reduce the time to fix bugs in large-scale open source software development. Our method considers the upper limit of tasks which can be fixed by a developer in a certain period. In this paper, we conduct a case study of applying our method to Mozilla Firefox and Eclipse Platform projects and show the following findings: (1) using our method mitigates the situation where the majority of bug-fixing tasks are assigned to particular developers, (2) our method can reduce up to 50%-83% of time to fix bugs compared with the manual bug triaging method and up to 34%-38% compared with the existing method, and (3) the two factors, Preference (adequate for fixing a bug) and Limit (limits of developers' working hours), used in our method have an dispersion effect on the task assignment.

OSSシステムとコミュニティの共進化の理解を目的としたデータマイニング手法

山谷陽亮, 大平雅雄, PHANNACHITTA Passakorn, 伊原彰紀

情報処理学会論文誌ジャーナル(Web) ( 一般社団法人情報処理学会 ) 56 ( 1 ) 59-71 (WEB ONLY) - 71 2015年01月 [査読有り]

オープンソースソフトウェア（OSS）を活用したシステム開発が一般的になりつつある一方，「サポートが得られるかどうか分からない」などの理由から，依然としてOSSの活用に躊躇するシステム開発企業は少なくない．本研究では，OSSシステムとコミュニティの共進化のプロセスを定量的に分析するためのデータマイニング手法を提案する．本手法は，時間的順序関係を考慮した相関分析を行うためのものであり，一方の系統の進化が一定時間後に他方の系統の進化に影響を与えるという関係の抽出を支援する．Eclipse Platformプロジェクトを対象に131種類のメトリクスを用いてケーススタディを行った結果，従来の相関分析では抽出できない31件の関係を提案手法により抽出できた．また，抽出された関係を追加分析することで，Eclipse Platformにおける共進化のプロセスをより正確に観察できることを確かめた．While using open source software (OSS) has been becoming common as a means for developing software systems, many companies still have a reluctance to utilize OSS products. This paper proposes a data mining method to analyze the co-evolution process of OSS systems and communities quantitatively. The method includes time-delayed correlation analysis to investigate whether changes in the amount of an explanatory variable have an impact on changes in the amount of an objective variable after a certain period of time. Through a case study of the Eclipse Platform project using 131 software metrics and our method, we found that our method extracted 31 correlations which cannot be extracted by the common correlation analysis. We also found that our method can support additional analyses to observe the co-evolution process in the Eclipse Platform project more precisely.

Studying re-opened bugs in open source software

Emad Shihab, Akinori Ihara, Yasutaka Kamei, Walid M. Ibrahim, Masao Ohira, Bram Adams, Ahmed E. Hassan, Ken-ichi Matsumoto

EMPIRICAL SOFTWARE ENGINEERING ( SPRINGER ) 18 ( 5 ) 1005 - 1042 2013年10月 [査読有り]

Bug fixing accounts for a large amount of the software maintenance resources. Generally, bugs are reported, fixed, verified and closed. However, in some cases bugs have to be re-opened. Re-opened bugs increase maintenance costs, degrade the overall user-perceived quality of the software and lead to unnecessary rework by busy practitioners. In this paper, we study and predict re-opened bugs through a case study on three large open source projects-namely Eclipse, Apache and OpenOffice. We structure our study along four dimensions: (1) the work habits dimension (e.g., the weekday on which the bug was initially closed), (2) the bug report dimension (e.g., the component in which the bug was found) (3) the bug fix dimension (e.g., the amount of time it took to perform the initial fix) and (4) the team dimension (e.g., the experience of the bug fixer). We build decision trees using the aforementioned factors that aim to predict re-opened bugs. We perform top node analysis to determine which factors are the most important indicators of whether or not a bug will be re-opened. Our study shows that the comment text and last status of the bug when it is initially closed are the most important factors related to whether or not a bug will be re-opened. Using a combination of these dimensions, we can build explainable prediction models that can achieve a precision between 52.1-78.6 % and a recall in the range of 70.5-94.1 % when predicting whether a bug will be re-opened. We find that the factors that best indicate which bugs might be re-opened vary based on the project. The comment text is the most important factor for the Eclipse and OpenOffice projects, while the last status is the most important one for Apache. These factors should be closely examined in order to reduce maintenance cost due to re-opened bugs.

DOI

ソフトウェア開発プロジェクトのリアルタイム管理を目的とした支援システム

大平雅雄, 横森励士, 阪井誠, 岩村聡, 小野英治, 新海平, 横川智教 (担当区分：筆頭著者 )

電子情報通信学会論文誌 D-1 ( 一般社団法人電子情報通信学会 ) J88-D-1 ( 2 ) 228 - 239 2005年02月 [査読有り]

本研究は, 信頼性や生産性に課題の多いソフトウェア開発の分野において, 科学的根拠に基づく開発手法である実証的ソフトウェア工学(Empirical Software Engineering)の確立を目指すEASE(Empirical Approach to Software Engineering)プロジェクトの一環として行われたものである.本論文では, より実践的なプロセス改善の支援を目的として構築したシステム, EPM(Empirical Project Monitor)について述べる.EPMは, 現在広く普及している開発支援フリーウェア(CVS, Mailman, GNATS等)と連携することによって開発履歴データをリアルタイムに収集し, 定量的データ分析を可能にするシステムである.EPMを利用したソフトウェア開発では, 管理者及び開発者は常時, プロジェクトの進捗状況や作業状況を客観的に把握することが可能となる.その効用として, プロジェクトの問題点を迅速に発見し的確なプロジェクト管理が行いやすくなるため, 効果的なプロセス改善活動の実施を期待することができる.システムの有用性を検証するために, 試作したEPMを現行のEPM開発プロジェクトに適用した結果, 開発者に大きな作業負荷を与えることなく当該プロジェクトの状況を分析することができた.

技術的負債に関連する課題票分類手法の構築

木村祐太, 大平雅雄 (担当区分：最終著者,　責任著者 )

情報処理学会論文誌 64 ( 1 ) 2 - 12 2023年01月 [査読有り]

Automating License Rule Generation to Help Maintain Rule-based OSS License Identification Tools

Yunosuke Higashi, Masao Ohira, Yuki Manabe

Journal of Information Processing ( Information Processing Society of Japan ) 31 2 - 12 2023年01月 [査読有り]

DOI

OSSプロジェクトへのオンボーディング支援のためのGood First Issue自動分類

堀口日向, 大平雅雄

コンピュータソフトウェア 39 ( 4 ) 31 - 37 2022年10月 [査読有り]

DOI

A Preliminary Analysis of Gpl Related License Violations in Docker Images

Yunosuke Higashi, Yutaro Kashiwa, Masao Ohira (担当区分：最終著者 )

Proceedings of 2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER '22) 433 - 437 2022年03月 [査読有り]

単語分散表現による類義語統一と単語N-gramによるフレーズ抽出に基づくセキュリティ要件分類手法

宮崎智己, 東裕之輔, 大平雅雄 (担当区分：最終著者 )

情報処理学会論文誌 63 ( 1 ) 94 - 103 2022年03月 [査読有り]

Onboarding to Open Source Projects with Good First Issues: A Preliminary Analysis

Hyuga Horiguchi, Itsuki Omori, Masao Ohira (担当区分：最終著者,　責任著者 )

2021 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) ( IEEE ) 501 - 505 2021年03月 [査読有り]

DOI

Report on the 26th foundation of software engineering workshop (fose2019)

Shuji Morisaki, Masao Ohira, Akito Monden

Computer Software ( Japan Society for Software Science and Technology ) 37 ( 4 ) 3 - 9 2020年10月

DOI

A bot for suggesting questions that match each user's expertise.

Katsunori Fukui, Tomoki Miyazaki, Masao Ohira

2019 IEEE/ACM 1st International Workshop on Bots in Software Engineering (BotSE) ( IEEE / ACM ) 18 - 19 2019年05月 [査読有り]

DOI

Suggesting Questions that Match Each User's Expertise in Community Question and Answering Services

Katsunori Fukui, Tomoki Miyazaki, Masao Ohira

2019 20TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD) ( IEEE ) 513 - 518 2019年 [査読有り]

Stack Overflow has been already recognized as an indispensable CQA (Community Question and Answering) service for developers. However developers as questioners sometimes cannot get any answers or they only can get incomplete answers to resolve their questions, since over several thousands of questions and answers are posted on a daily basis and expert developers are currently facing with a difficulty in finding questions which can be better or best answered by them. In order address the issue, our study aims at developing a bot that helps expert developers find questions matching each developer's expertise. The existing study [8] proposed a promising approach to the expert recommendation for CQA services, based on PMF (Probabilistic Matrix Factorization) algorithm. In order to improve the accuracy of the expert recommendation, in this paper we present our approach which combines the PMF (Probabilistic Matrix Factorization) approach and a term expansion techniques using word embeddings. As a result of an experiment comparing our approach with the existing approach only based on PMF, we show that our approach based on PMF and the term expansion with Word2vec and fastText slightly outperforms the existing approach only based on PMF.

DOI

Code Clone Tracer (CCT): A Tracking Tool for Analyzing Human and Social Factors in Creating and Reusing Code Clones

Yusuke Kukita, Kojiro Noguchi, Masao Ohira

2019 20TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD) ( IEEE ) 519 - 524 2019年 [査読有り]

This paper introduces a tool called CCT (Code Clone Tracer) which is designed to help practitioners and researchers analyze the impacts of human/social factors on software quality in creating and reusing code clones. CCT tracks a history of created and reused code clones for all the revisions in a distributed version control system such as Git. The tool also has features to analyze the relationship between bug-inducing changes and developers, working together with a bug tracking system such as Bugzilla and JIRA. This paper reports our pilot case study where CCT is applied to three open source projects (RxJava, c:geo, and Jackson databind). The results of the case study indicated that a small number of particular developers were involved in many of clone changes to resolve issues.

DOI

What Are the Perception Gaps Between FLOSS Developers and SE Researchers? A Case of Bug Finding Research

Yutaro Kashiwa, Akinori Ihara, Masao Ohira

OPEN SOURCE SYSTEMS, OSS 2019 ( SPRINGER INTERNATIONAL PUBLISHING AG ) 556 44 - 57 2019年 [査読有り]

In recent years, many researchers in the SE community have been devoting considerable efforts to provide FLOSS developers with a means to quickly find and fix various kinds of bugs in FLOSS products such as security and performance bugs. However, it is not exactly sure how FLOSS developers think about bugs to be removed preferentially. Without a full understanding of FLOSS developers' perceptions of bug finding and fixing, researchers' efforts might remain far away from FLOSS developers' needs. In this study, we interview 322 notable GitHub developers about high impact bugs to understand FLOSS developers' needs for bug finding and fixing, and we manually inspect and classify developers' answers (bugs) by symptoms and root causes of bugs. As a result, we show that security and breakage bugs are highly crucial for FLOSS developers. We also identify what kinds of high impact bugs should be studied newly by the SE community to help FLOSS developers.

DOI

OSSコミュニティにおける開発者の活動継続性を理解するためのPoliteness分析

宮崎智己, 伊原彰紀, 大平雅雄, 東裕之輔, 山谷陽亮

情報処理学会論文誌ジャーナル(Web) 59 ( 1 ) 2‐11 (WEB ONLY) 2018年01月 [査読有り]

ソフトウェアテストにおける静的解析ツールの段階的適用による不具合修正工数の更なる低減 ―民生用音響・映像機器向け組み込みソフトウェア開発へのQACの段階的適用とその実証評価―

鶴田雅明, 大平雅雄, 門田暁人, 松本健一

情報社会学会誌 11 ( 1 ) 5 - 16 2016年 [査読有り]

『オープンソースソフトウェア工学』シリーズオープンソースソフトウェア工学

伊原彰紀, 大平雅雄

コンピュータソフトウェア ( 日本ソフトウェア科学会 ) 33 ( 1 ) 28‐40(J‐STAGE) - 1_27 2016年 [査読有り] [招待有り]

DOI

　前のページ- 次のページ　

<大平 雅雄>

論文 - 大平 雅雄

<大平　雅雄>

論文 - 大平　雅雄