HAYASHI, Shinpei at se.cs.titech.ac.jp

[English]

About Me

1982年生. 2004年 北海道大学 工学部 情報工学科 卒業(知能情報工学分野出身). 2006年 東京工業大学 大学院情報理工学研究科 計算工学専攻 修士課程修了. 2008年 同専攻 博士後期課程修了. 博士(工学). 2009年 同専攻 助教. 2016年より同大学 情報理工学院 助教. 2018年より同大学 情報理工学院 准教授.

See Also

Contact Addresses

Location
West-8E Bldg. #906, Ookayama Campus, Tokyo Institute of Technology
Address
Ookayama 2-12-1-W8-71, Ookayama, Meguro-ku, Tokyo 152-8552, Japan
Phone/Fax.
+81-3-5734-3213 or skype:hayashi.shinpei

Current Interests

Software Engineering, in particular,

P{ublic,resent}ations

To Be Published

  1. Sarocha Sothornprapakorn, Shinpei Hayashi, Motoshi Saeki:"Visualizing a Tangled Change for Supporting Its Decomposition and Commit Construction".In Proceedings of the 42nd IEEE Computer Software and Applications Conference (COMPSAC 2018). Tokyo, Japan,jul,2018.
  2. Natthawute Sae-Lim, Shinpei Hayashi, Motoshi Saeki:"An Investigative Study on How Developers Filter and Prioritize Code Smells".IEICE Transactions on Information and Systems, vol. E101-D,no. 7, pp. 1733-1742. jul,2018.
  3. Shinpei Hayashi, Fumiki Minami, Motoshi Saeki:"Detecting Architectural Violations Using Responsibility and Dependency Constraints of Components".IEICE Transactions on Information and Systems, vol. E101-D,no. 7, pp. 1780-1789. jul,2018.

Recent Publications (2018)

  1. Natthawute Sae-Lim, Shinpei Hayashi, Motoshi Saeki:"Context-Based Approach to Prioritize Code Smells for Prefactoring".Journal of Software: Evolution and Process, vol. 30,no. 6:e1886, pp. 1-24. jun,2018.
    ID
    DOI: 10.1002/smr.1886
    Abstract
    Existing techniques for detecting code smells (indicators of source code problems) do not consider the current context, which renders them unsuitable for developers who have a specific context, such as modules within their focus. Consequently, the developers must spend time identifying relevant smells. We propose a technique to prioritize code smells using the developers' context. Explicit data of the context are obtained using a list of issues extracted from an issue tracking system. We applied impact analysis to the list of issues and used the results to specify the context-relevant smells. Results show that our approach can provide developers with a list of prioritized code smells related to their current context. We conducted several empirical studies to investigate the characteristics of our technique and factors that might affect the ranking quality. Additionally, we conducted a controlled experiment with professional developers to evaluate our technique. The results demonstrate the effectiveness of our technique.
    BibTeX
    @article{natthawute-jsep201806,
        author = {Natthawute Sae-Lim and Shinpei Hayashi and Motoshi Saeki},
        title = {Context-Based Approach to Prioritize Code Smells for Prefactoring},
        journal = {Journal of Software: Evolution and Process},
        volume = 30,
        number = {6:e1886},
        pages = {1--24},
        year = 2018,
        month = {jun},
    }
    [natthawute-jsep201806]: as a page
  2. Aoi Takahashi, Natthawute Sae-Lim, Shinpei Hayashi, Motoshi Saeki:"A Preliminary Study on Using Code Smells to Improve Bug Localization".In Proceedings of the 26th IEEE/ACM International Conference on Program Comprehension (ICPC 2018), pp. 324-327. Gothenburg, Sweden,may,2018.
    ID
    DOI: 10.1145/3196321.3196361
    Abstract
    Bug localization is a technique that has been proposed to support the process of identifying the locations of bugs specified in a bug report. A traditional approach such as information retrieval (IR)-based bug localization calculates the similarity between the bug description and the source code and suggests locations that are likely to contain the bug. However, while many approaches have been proposed to improve the accuracy, the likelihood of each module having a bug is often overlooked or they are treated equally, whereas this may not be the case. For example, modules having code smells have been found to be more prone to changes and faults. Therefore, in this paper, we explore a first step toward leveraging code smells to improve bug localization. By combining the code smell severity with the textual similarity from IR-based bug localization, we can identify the modules that are not only similar to the bug description but also have a higher likelihood of containing bugs. Our preliminary evaluation on four open source projects shows that our technique can improve the baseline approach by 142.25\% and 30.50\% on average for method and class levels, respectively.
    BibTeX
    @inproceedings{takahashi-a-at-icpc2018,
        author = {Aoi Takahashi and Natthawute Sae-Lim and Shinpei Hayashi and Motoshi Saeki},
        title = {A Preliminary Study on Using Code Smells to Improve Bug Localization},
        booktitle = {Proceedings of the 26th IEEE/ACM International Conference on Program Comprehension},
        pages = {324--327},
        year = 2018,
        month = {may},
    }
    [takahashi-a-at-icpc2018]: as a page
  3. 中野 真明貴, 野田 訓広, 小林 隆志, 林 晋平:"実行トレースの共通性分析に基づく機能開始点の特定".電子情報通信学会技術研究報告, vol. 117,no. 477, pp. 51-56. 南大東島多目的交流センター, 沖縄,mar,2018.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/2018030791DD/
    Abstract
    形式概念分析を利用した動的機能捜索手法には,入力である「シナリオと利用された機能とのマッピング」の作成が容易ではないという問題点が存在する.この問題を解決するために,機能開始点を特定することで,機能とシナリオの対応関係を特定する手法を提案する.提案手法では,"実行シナリオに関する共通性"の変化から機能開始点を特定し,機能名推定の支援及びシナリオとの対応関係特定を行う.オープンソースソフトウェアを対象に提案手法の評価実験を行った.その結果,対象ソフトウェアのドメイン知識だけを前提とし,41%の機能とシナリオのマッピングを構成することができた.
    BibTeX
    @article{maaki-sigss201803,
        author = {中野 真明貴 and 野田 訓広 and 小林 隆志 and 林 晋平},
        title = {実行トレースの共通性分析に基づく機能開始点の特定},
        journal = {電子情報通信学会技術研究報告},
        volume = 117,
        number = 477,
        pages = {51--56},
        year = 2018,
        month = {mar},
    }
    [maaki-sigss201803]: as a page
  4. Katsuhisa Maruyama, Shinpei Hayashi, Takayuki Omori:"ChangeMacroRecorder: Recording Fine-Grained Textual Changes of Source Code".In Proceedings of the 25th IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER 2018), Tool Demonstration Session, pp. 537-541. Campobasso, Italy,mar,2018.
    ID
    DOI: 10.1109/SANER.2018.8330255
    URL
    www.fse.cs.ritsumei.ac.jp/~maru/papers/saner2018-maruyama.pdf
    Abstract
    Recording code changes comes to be well recognized as an effective means for understanding the evolution of existing programs and making their future changes efficient. Although fine-grained textual changes of source code are worth leveraging in various situations, there is no satisfactory tool that records such changes. This paper proposes a yet another tool, called ChangeMacroRecorder, which automatically records all textual changes of source code while a programmer writes and modifies it on the Eclipse's Java editor. Its capability has been improved with respect to both the accuracy of its recording and the convenience for its use. Tool developers can easily and cheaply create their new applications that utilize recorded changes by embedding our proposed recording tool into them.
    BibTeX
    @inproceedings{maruyama-saner2018,
        author = {Katsuhisa Maruyama and Shinpei Hayashi and Takayuki Omori},
        title = {ChangeMacroRecorder: Recording Fine-Grained Textual Changes of Source Code},
        booktitle = {Proceedings of the 25th IEEE International Conference on Software Analysis, Evolution and Reengineering},
        pages = {537--541},
        year = 2018,
        month = {mar},
    }
    [maruyama-saner2018]: as a page
  5. Shinpei Hayashi, Andrea Mocci:"1st IEEE International Workshop on Mining and Analyzing Interaction Histories (MAINT 2018)". (MAINT 2018), co-located with SANER 2018. Campobasso, Italy,mar,2018.
    ID
    ISBN: 978-1-5386-6011-9
    BibTeX
    @proceedings{maint2018,
        title = {1st IEEE International Workshop on Mining and Analyzing Interaction Histories (MAINT 2018)},
        year = 2018,
        month = {mar},
    }
    [maint2018]: as a page
  6. 高橋 碧, セーリム ナッタウット, 林 晋平, 佐伯 元司:"情報検索に基づくBug Localizationへの不吉な臭いの深刻度の利用".情報処理学会研究報告, vol. 2018-SE-198,no. 16, pp. 1-8. 芝浦工業大学, 東京,mar,2018. 学生研究賞 受賞.
    ID
    ISSN: 0919-6072
    Abstract
    大規模なソフトウェア開発では,ある特定のバグを解決するために修正すべきソースコード箇所を見つけるBug Localizationが必要である.情報検索に基づくBug Localization手法(IR手法)は,バグに関して記述されたバグレポートとソースコード内のモジュールとのテキスト類似度を計算し,これに基づき修正すべきモジュールを特定する.しかし,この手法は各モジュールのバグの出やすさの度合いを考慮していないため精度が低い.本論文では,ソースコード内のモジュールのバグの出やすさとして不吉な臭いを用い,これを既存のIR手法と組み合わせたBug Localization手法を提案する.提案手法では,不吉な臭いの深刻度と,ベクトル空間モデルに基づくテキスト類似度を統合した新しい評価値を定義している.これは深刻度の高い不吉な臭いとバグレポートとの高いテキスト類似性の両方を持つモジュールを上位に位置付け,バグを解決するために修正すべきモジュールを予測する.4つのOSSプロジェクトの過去のバグレポートを用いた評価では,いずれのプロジェクト,モジュール粒度においても提案手法の精度が既存のIR手法を上回り,また最大で269\%の向上がみられた.
    BibTeX
    @article{takahashi-a-at-sigse201803,
        author = {高橋 碧 and セーリム ナッタウット and 林 晋平 and 佐伯 元司},
        title = {情報検索に基づくBug Localizationへの不吉な臭いの深刻度の利用},
        journal = {情報処理学会研究報告},
        volume = {2018-SE-198},
        number = 16,
        pages = {1--8},
        year = 2018,
        month = {mar},
    }
    [takahashi-a-at-sigse201803]: as a page
  7. 梅川 尚孝, 林 晋平, 佐伯 元司:"名前変更リファクタリングが行われた識別子間の関係性に関する実証的調査".電子情報通信学会技術研究報告, vol. 117,no. 381, pp. 1-6. 広島市立大学サテライトキャンパス, 広島,jan,2018.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20180118f1by/
    Abstract
    識別子の名前変更は多く行われるリファクタリングであり,複数の識別子をツールで一括して正しく変更することは,開発者の負担軽減や変更漏れの防止へ繋がる.一括変更を精度良く行うためには,同概念を指すとして一括変更すべき識別子中の語を特定する必要がある.本稿では,識別子間のプログラム上での関係性に注目する.過去の変更履歴から同時名前変更された識別子間の関係性について定義を行い,その関係にある同時名前変更がどれだけ存在するのか調査を行った.また,既存の一括名前変更手法と組み合わせることで,それぞれの関係性がどの程度同時名前変更された識別子を優先して変更推薦できるか実験を行った.
    BibTeX
    @article{umekawa-sigss201801,
        author = {梅川 尚孝 and 林 晋平 and 佐伯 元司},
        title = {名前変更リファクタリングが行われた識別子間の関係性に関する実証的調査},
        journal = {電子情報通信学会技術研究報告},
        volume = 117,
        number = 381,
        pages = {1--6},
        year = 2018,
        month = {jan},
    }
    [umekawa-sigss201801]: as a page
  8. 林 晋平, 有賀 顕, 佐伯 元司:"reqchecker:IEEE 830の品質特性に基づく日本語要求仕様書の問題点検出ツール".電子情報通信学会論文誌, vol. J101-D,no. 1, pp. 57-67. jan,2018.
    ID
    DOI: 10.14923/transinfj.2017SKP0036
    Abstract
    要求仕様書は主に自然言語で記述されているため,文意のあいまい性などの問題がある.高品質な要求仕様書を得るためには,要求分析者がこれらの問題点を認識し発見することが重要である.本論文ではIEEE 830で定義された品質特性をもとに,日本語で記述された要求仕様書の問題点を検出する手法およびその自動化ツールreqcheckerを提案する.提案手法では,要求仕様書全体と要求文の解析,さらに要求文間の関係解析を行い要求仕様書中の問題点を検出する.reqcheckerでは非あいまい性など6つの品質特性に関する問題点を検出しマーキングを行うことで,要求分析者による問題点の発見を支援する.例題への適用および被験者実験によりreqcheckerの有用性に関する予備評価を行ったところ,良好な結果を得た.
    Some requirements specification documents have several problems such as the ambiguity of sentences because they are mainly written in natural language. It is important for requirements analysts to find and analyze these problems. In this paper, we propose a technique for detecting problems in a requirements specification documents based on the quality characteristics defined in IEEE 830, using the syntactical structure of the specification. Our technique analyzes the structure and relationships of the sentences and the whole of the given specification. A specification checker named reqchecker that automates our technique can support to find the problems over six quality characteristics. The preliminary evaluation results show that reqchecker has acceptable detection accuracy and high supporting effects for some particular quality characteristics.
    BibTeX
    @article{hayashi-ieicet201802,
        author = {林 晋平 and 有賀 顕 and 佐伯 元司},
        title = {reqchecker:IEEE 830の品質特性に基づく日本語要求仕様書の問題点検出ツール},
        journal = {電子情報通信学会論文誌},
        volume = {J101-D},
        number = 1,
        pages = {57--67},
        year = 2018,
        month = {jan},
    }
    [hayashi-ieicet201802]: as a page

Papers Published in Academic Journals

  1. 林 晋平, 柳田 拓人, 佐伯 元司, 三村 秀典:"クラス責務割当てのファジィ制約充足問題としての定式化".情報処理学会論文誌, vol. 58,no. 4, pp. 795-806. apr,2017.
    Abstract
    本論文ではクラスへの責務割当てをファジィ制約充足問題として定式化することにより自動化を図る手法を提案する.責務とは各クラスのインスタンスが果たすべき役割を指し,それらをクラスへ適切に割り当てることによって,高品質な設計が実現される.割当てに際しては,疎結合かつ高凝集な割当てが望ましいなど,様々な観点を考慮することが必要となる.しかし,そのような観点の間にはトレード・オフがあるため,現実的には条件を適度に満たす割当てが求められ,計算機による支援が重要である.そこで,様々な条件をファジィ制約として表現し,責務割当てをファジィ制約充足問題として定式化する.これによって,既存の汎用的なアルゴリズムを適用できるようになり,解としての責務割当ての導出が可能となる.例題に対して解を導出した結果を示す.
    The authors formulate the class responsibility assignment (CRA) problem as the fuzzy constraint satisfaction problem (FCSP) to automate CRA, and show the results of automatic assignments of examples. Responsibilities are contracts or obligations of objects that they should assume; by aligning them to classes appropriately, designs of high quality realize. Typical aspects of a desirable design are having a low coupling between highly cohesive classes. However, because of a trade-off among such aspects, solutions that satisfy the conditions moderately are desired, and computer assistance is needed. The authors represent the conditions of such aspects as fuzzy constraints, and formulate CRA as FCSP. That enables us to apply common algorithms that solve FCSP to the problem, and to derive solutions representing a CRA.
    BibTeX
    @article{hayashi-ipsjj201704,
        author = {林 晋平 and 柳田 拓人 and 佐伯 元司 and 三村 秀典},
        title = {クラス責務割当てのファジィ制約充足問題としての定式化},
        journal = {情報処理学会論文誌},
        volume = 58,
        number = 4,
        pages = {795--806},
        year = 2017,
        month = {apr},
    }
    [hayashi-ipsjj201704]: as a page
  2. 風戸 広史, 林 晋平, 大島 剛志, 小林 隆志, 夏川 勝行, 星野 隆, 佐伯 元司:"多層システムに対する横断的な機能捜索".情報処理学会論文誌, vol. 58,no. 4, pp. 885-897. apr,2017.
    Abstract
    複数のレイヤで構成されたソフトウェアでは,レイヤ間に分散したプログラム要素が協調動作して1つの機能を実現するために,機能とプログラム要素群を対応付ける作業である機能捜索が難しい.そこで,本論文では機能とレイヤ間に分散したプログラム要素群の対応関係を半自動的に抽出する機能捜索手法を提案する.提案手法ではレイヤごとの実行プロファイルを併合して形式概念分析への入力として用いることにより,異なるレイヤに属するプログラム要素を形式概念としてグループ化し,機能の集合と対応付ける.たとえば,提案手法をWebアプリケーションに対して適用することにより,アプリケーション層に属するモジュールだけでなく,プレゼンテーション層やデータ層に属するWebページやデータベースのテーブルアクセスといった要素を同時に機能に紐付けられる.Webアプリケーションの例題に提案手法を適用し,3つのレイヤに分散したプログラム要素と機能の対応関係を抽出した事例を示すことにより,手法の実現可能性を示すとともに,現実的なプログラム理解の支援に向けた応用可能性について議論する.
    In multi-layer systems such as web applications, locating features is a challenging problem because each feature is often realized through a collaboration of program elements belonging to different layers. This paper proposes a semi-automatic technique to extract correspondence between features and program elements among layers, by merging execution traces of every layer to feed into formal concept analysis. By applying this technique to a web application, not only modules in the application layer but also web pages in the presentation layer and table accesses in the data layer can be associated with features at once. To show the feasibility of our technique, we applied it to a web application which conforms to the typical three-layer architecture of Java EE and discuss its applicability to other layer systems in the real world.
    BibTeX
    @article{kazato-ipsjj201704,
        author = {風戸 広史 and 林 晋平 and 大島 剛志 and 小林 隆志 and 夏川 勝行 and 星野 隆 and 佐伯 元司},
        title = {多層システムに対する横断的な機能捜索},
        journal = {情報処理学会論文誌},
        volume = 58,
        number = 4,
        pages = {885--897},
        year = 2017,
        month = {apr},
    }
    [kazato-ipsjj201704]: as a page
  3. Mohamed Wiem Mkaouer, Marouane Kessentini, Mel Ó Cinnéide, Shinpei Hayashi, Kalyanmoy Deb:"A Robust Multi-Objective Approach to Balance Severity and Importance of Refactoring Opportunities".Empirical Software Engineering, vol. 22,no. 2, pp. 894-927. apr,2017.
    ID
    DOI: 10.1007/s10664-016-9426-8
    Abstract
    Refactoring large systems involves several sources of uncertainty related to the severity levels of code smells to be corrected and the importance of the classes in which the smells are located. Both severity and importance of identified refactoring opportunities (e.g. code smells) are difficult to estimate. In fact, due to the dynamic nature of software development, these values cannot be accurately determined in practice, leading to refactoring sequences that lack robustness. In addition, some code fragments can contain severe quality issues but they are not playing an important role in the system. To address this problem, we introduced a multi-objective robust model, based on NSGA-II, for the software refactoring problem that tries to find the best trade-off between three objectives to maximize: quality improvements, severity and importance of refactoring opportunities to be fixed. We evaluated our approach using 8 open source systems and one industrial project, and demonstrated that it is significantly better than state-of-the-art refactoring approaches in terms of robustness in all the experiments based on a variety of real-world scenarios. Our suggested refactoring solutions were found to be comparable in terms of quality to those suggested by existing approaches, better prioritization of refactoring opportunities and to carry an acceptable robustness price.
    BibTeX
    @article{mkaouer-emse201704,
        author = {Mohamed Wiem Mkaouer and Marouane Kessentini and Mel {\'{O}} Cinn{\'{e}}ide and Shinpei Hayashi and Kalyanmoy Deb},
        title = {A Robust Multi-Objective Approach to Balance Severity and Importance of Refactoring Opportunities},
        journal = {Empirical Software Engineering},
        volume = 22,
        number = 2,
        pages = {894--927},
        year = 2017,
        month = {apr},
    }
    [mkaouer-emse201704]: as a page
  4. 加藤 潤三, 佐伯 元司, 大西 淳, 海谷 治彦, 林 晋平, 山本 修一郎:"要求獲得のためシソーラス構築支援".情報処理学会論文誌, vol. 57,no. 7, pp. 1576-1589. jul,2016.
    Abstract
    要求獲得で用いるシソーラスの構築手法とその支援ツールを提案する.本論文で述べる手法は,(1) 要求分析者が技術文書からシソーラスに登録すべき機能の候補を抽出し,(2) ドメインエキスパートが候補を吟味することで,これらの候補からシソーラスに登録する機能と機能に付随する非機能要素を決定するという2段階からなる.ツールが支援するのは (1) である.本手法は,技術文書から (a) 機能を正しく抽出できる,(b) 機能を漏れなく抽出できる,という特徴を満たす必要がある.事例研究において本手法を適用したところ,本手法がこれらの特徴を満たし,有用であることを確認した.
    We propose a method of developing a thesaurus for requirements elicitation and its supporting tool. This proposed method consists of two parts - (1) elicitation of candidates of functional requirements to be registered in the thesaurus from technical documents and (2) registration of functional requirements with associated non-functional factors in the thesaurus from these candidates under the direction of domain experts. Our tool supports the first part. This method should satisfy the following two characteristics - (a) extracted functions are correct and (b) any analyst can extract all indispensable functions from technical documents. We show the above two characteristics through case studies and confirm the usability and effectiveness of the proposed method.
    BibTeX
    @article{jkato-ipsjj201607,
        author = {加藤 潤三 and 佐伯 元司 and 大西 淳 and 海谷 治彦 and 林 晋平 and 山本 修一郎},
        title = {要求獲得のためシソーラス構築支援},
        journal = {情報処理学会論文誌},
        volume = 57,
        number = 7,
        pages = {1576--1589},
        year = 2016,
        month = {jul},
    }
    [jkato-ipsjj201607]: as a page
  5. Katsuhisa Maruyama, Takayuki Omori, Shinpei Hayashi:"Slicing Fine-Grained Code Change History".IEICE Transactions on Information and Systems, vol. E99-D,no. 3, pp. 671-687. mar,2016.
    ID
    DOI: 10.1587/transinf.2015EDP7282
    Abstract
    Change-aware development environments can automatically record fine-grained code changes on a program and allow programmers to replay the recorded changes in chronological order. However, since they do not always need to replay all the code changes to investigate how a particular entity of the program has been changed, they often eliminate several code changes of no interest by manually skipping them in replaying. This skipping action is an obstacle that makes many programmers hesitate when they use existing replaying tools. This paper proposes a slicing mechanism that automatically removes manually skipped code changes from the whole history of past code changes and extracts only those necessary to build a particular class member of a Java program. In this mechanism, fine-grained code changes are represented by edit operations recorded on the source code of a program and dependencies among edit operations are formalized. The paper also presents a running tool that slices the operation history and replays its resulting slices. With this tool, programmers can avoid replaying nonessential edit operations for the construction of class members that they want to understand. Experimental results show that the tool offered improvements over conventional replaying tools with respect to the reduction of the number of edit operations needed to be examined and over history filtering tools with respect to the accuracy of edit operations to be replayed.
    BibTeX
    @article{maruyama-ieicet201603,
        author = {Katsuhisa Maruyama and Takayuki Omori and Shinpei Hayashi},
        title = {Slicing Fine-Grained Code Change History},
        journal = {IEICE Transactions on Information and Systems},
        volume = {E99-D},
        number = 3,
        pages = {671--687},
        year = 2016,
        month = {mar},
    }
    [maruyama-ieicet201603]: as a page
  6. 加藤 哲平, 林 晋平, 佐伯 元司:"呼び出し関係グラフ分割手法の動的機能捜索手法との組合せの検討".電子情報通信学会論文誌, vol. J98-D,no. 11, pp. 1374-1376. nov,2015.
    ID
    DOI: 10.14923/transinfj.2015SSL0001
    Abstract
    形式概念分析を用いた動的な機能捜索手法と呼び出し関係グラフ分割手法を組み合わせ,シナリオの用意が十分でない場合でも精度良く機能に対応するモジュール集合を得る方法について,例題への適用結果に基づき検討する.
    BibTeX
    @article{kato-ieicet201511,
        author = {加藤 哲平 and 林 晋平 and 佐伯 元司},
        title = {呼び出し関係グラフ分割手法の動的機能捜索手法との組合せの検討},
        journal = {電子情報通信学会論文誌},
        volume = {J98-D},
        number = 11,
        pages = {1374--1376},
        year = 2015,
        month = {nov},
    }
    [kato-ieicet201511]: as a page
  7. 崔 恩瀞, 藤原 賢二, 吉田 則裕, 林 晋平:"変更履歴解析に基づくリファクタリング検出技術の調査".コンピュータソフトウェア, vol. 32,no. 1, pp. 47-59. feb,2015.
    ID
    DOI: 10.11309/jssst.32.1_47
    Abstract
    リファクタリングとは,ソフトウェアの外部的振る舞いを変化させることなく,内部の構造を改善するプロセスを指す.研究者・実務者ともに,開発プロジェクトにおいて過去に実施されたリファクタリングを知りたいという要求がある.そこで,リファクタリングの実施を自動的に検出する手法(リファクタリング検出手法)が数多く提案されている.これらの手法は,多様な国際会議や論文誌において発表されており,研究者や実務者にとって研究成果を概観することは容易ではない.本稿では,リファクタリング検出手法の中でも,盛んに研究が行われている成果物の変更履歴解析に基づく手法を中心に紹介を行う.まず,本稿におけるリファクタリング検出の定義および分類について述べる.その後,成果物の変更履歴解析に基づく手法を紹介し,今後行われる研究の方向性について考察を行う.
    Refactoring is the process of changing a software system in such a way that it does not alter the external behavior of the code yet improves its internal structure. Not only researchers but also practitioners need to know past instances of refactoring performed in a software development project. So far, a number of techniques have been proposed on the automatic detection of refactoring instances. Those techniques have been presented in various international conferences and journals, and it is difficult for researchers and practitioners to grasp the current status of studies on refactoring detection techniques. In this survey paper, we introduce refactoring detection techniques, especially in techniques based on change history analysis. At first, we give the definition and the categorization of refactoring detection in this paper, and then introduce refactoring detection techniques based on change history analysis. Finally, we discuss possible future research directions on refactoring detection.
    BibTeX
    @article{choi-jssst201502,
        author = {崔 恩瀞 and 藤原 賢二 and 吉田 則裕 and 林 晋平},
        title = {変更履歴解析に基づくリファクタリング検出技術の調査},
        journal = {コンピュータソフトウェア},
        volume = 32,
        number = 1,
        pages = {47--59},
        year = 2015,
        month = {feb},
    }
    [choi-jssst201502]: as a page
  8. 大森 隆行, 林 晋平, 丸山 勝久:"統合開発環境における細粒度な操作履歴の収集および応用に関する調査".コンピュータソフトウェア, vol. 32,no. 1, pp. 60-80. feb,2015.
    ID
    DOI: 10.11309/jssst.32.1_60
    Abstract
    統合開発環境における開発者の操作履歴を扱う手法について調査を行った.主としてソフトウェア進化研究における引用を想定し,細粒度なソースコード変更の内容を扱うことができる手法を調査対象とした.本論文では,これらの手法を,基盤となる統合開発環境,操作履歴記録手法,操作履歴応用手法の3層のモデルで捉える.これらの手法の特性を整理した後,それぞれの記録手法,応用手法の概要を紹介する.
    This paper presents a survey on techniques to record and utilize developers’ operations on integrated development environments (IDEs). Especially, we let techniques treating fine-grained code changes be targets of this survey for reference in software evolution research. We created a three-tiered model to represent the relationships among IDEs, recording techniques, and application techniques. This paper also presents common features of the techniques and their details.
    BibTeX
    @article{omori-jssst201502,
        author = {大森 隆行 and 林 晋平 and 丸山 勝久},
        title = {統合開発環境における細粒度な操作履歴の収集および応用に関する調査},
        journal = {コンピュータソフトウェア},
        volume = 32,
        number = 1,
        pages = {60--80},
        year = 2015,
        month = {feb},
    }
    [omori-jssst201502]: as a page
  9. 星野 大樹, 林 晋平, 佐伯 元司:"ソースコード編集操作の自動グループ化".コンピュータソフトウェア, vol. 31,no. 3, pp. 277-283. aug,2014.
    ID
    DOI: 10.11309/jssst.31.3_277
    Abstract
    ソフトウェア構成管理では,ソースコード変更を開発者にとって意味のある単位ごとに分割してコミットを行うこと(分割コミット)が重要となる.しかし開発者は分割コミットを行わずに様々な意図が混ざったコミットをすることがある.これに対し,ソースコードの編集操作を収集し,それらを分類することで分割コミットを支援する既存手法がある.本稿では,ソースコードにおけるファイルやクラス,メソッド,コメントおよび編集時間を分類の基準とし,これらに基づいて編集操作を自動的に分類する手法を提案する.提案手法を実現するツールを開発し,例題へ適用することにより,既存手法よりも分類の労力を低減することを確認した.
    In software configuration management, it is important to separate source code changes into meaningful units before committing them (in short, Task Level Commit). However, developers often commit unrelated code changes in a single transaction. To support Task Level Commit, an existing technique uses an editing history of source code and enables developers to group the editing operations in the history. This paper proposes an automated technique for grouping editing operations in a history based on several criteria including source files, classes, methods, comments, and times editted. We show how our technique reduces developers' separating cost compared with the manual approach.
    BibTeX
    @article{dhoshino-jssst201408,
        author = {星野 大樹 and 林 晋平 and 佐伯 元司},
        title = {ソースコード編集操作の自動グループ化},
        journal = {コンピュータソフトウェア},
        volume = 31,
        number = 3,
        pages = {277--283},
        year = 2014,
        month = {aug},
    }
    [dhoshino-jssst201408]: as a page
  10. 鵜飼 孝典, 林 晋平, 佐伯 元司:"属性つきゴールグラフにおけるゴールの品質特性".情報処理学会論文誌, vol. 55,no. 2, pp. 893-908. feb,2014.
    URL
    http://id.nii.ac.jp/1001/00098488/
    Abstract
    本研究は,有望な要求分析手法の1つであるゴール指向要求分析法について,分析の成果物であるゴールグラフの品質を向上させることを目的としている.本論文では,作成したゴールグラフから低品質なゴールを発見し,改善させることが現実的であると考え,低品質なゴールを同定できるようにするためにゴールグラフの各ゴールに対する品質特性を定義する.品質特性は,要求仕様書が備えるべき品質特性の国際標準であるIEEE Std 830 を参考にした.また,各ゴールがそれぞれの品質特性を満たすか否かを判定する品質特性述語を,属性つきゴールグラフの属性を用いて定義する.さらに我々が定義した品質特性述語を用いて,品質特性を満たさないゴールをゴールグラフの品質を下げる可能性があると見なして分析者に提示する支援ツールを実装した.この支援ツールを用いて,ゴールグラフを書き換えさせる実験を行った.この実験により,我々が定義したゴールに対する品質特性と品質特性述語が品質的に問題のあるゴールの発見と修正を行うために役立つことを示す.
    Goal-oriented requirements analysis (GORA) is a promising technique in requirements engineering, especially requirements elicitation. This paper aims at developing a technique to support the improvement of goal graphs, which are resulting artifacts of GORA. We consider that the technique of improving existing goals of lower quality is more realistic rather than that of creating a goal graph of high quality from scratch. To achieve the proposed technique, we define quality properties for each goal formally. Our quality properties result from IEEE Std 830 and past related studies. To define them formally, using attribute values of an attributed goal graph, we formulate predicates for deciding if a goal satisfies a quality property or not. We have implemented a supporting tool to show a requirements analyst the goals which do not satisfy the predicates. Our experiments using the tool show that requirements analysts can efficiently find and modify the qualitatively problematic goals.
    BibTeX
    @article{ugai-ipsjj201402,
        author = {鵜飼 孝典 and 林 晋平 and 佐伯 元司},
        title = {属性つきゴールグラフにおけるゴールの品質特性},
        journal = {情報処理学会論文誌},
        volume = 55,
        number = 2,
        pages = {893--908},
        year = 2014,
        month = {feb},
    }
    [ugai-ipsjj201402]: as a page
  11. Motoshi Saeki, Shinpei Hayashi, Haruhiko Kaiya:"Enhancing Goal-Oriented Security Requirements Analysis Using Common Criteria-Based Knowledge".International Journal of Software Engineering and Knowledge Engineering, vol. 23,no. 5, pp. 695-720. jun,2013.
    ID
    DOI: 10.1142/S0218194013500174
    Abstract
    Goal-oriented requirements analysis (GORA) is one of the promising techniques to elicit software requirements, and it is natural to consider its application to security requirements analysis. In this paper, we proposed a method for goal-oriented security requirements analysis using security knowledge which is derived from several security targets (STs) compliant to Common Criteria (CC, ISO/IEC 15408). We call such knowledge security ontology for an application domain (SOAD). Three aspects of security such as confidentiality, integrity and availability are included in the scope of our method because the CC addresses these three aspects. We extract security-related concepts such as assets, threats, countermeasures and their relationships from STs, and utilize these concepts and relationships for security goal elicitation and refinement in GORA. The usage of certificated STs as knowledge source allows us to reuse efficiently security-related concepts of higher quality. To realize our proposed method as a supporting tool, we use an existing method GOORE (goal-oriented and ontology-driven requirements elicitation method) combining with SOAD. In GOORE, terms and their relationships in a domain ontology play an important role of semantic processing such as goal refinement and conflict identification. SOAD is defined based on concepts in STs. In contrast with other goal-oriented security requirements methods, the knowledge derived from actual STs contributes to eliciting security requirements in our method. In addition, the relationships among the assets, threats, objectives and security functional requirements can be directly reused for the refinement of security goals. We show an illustrative example to show the usefulness of our method and evaluate the method in comparison with other goal-oriented security requirements analysis methods.
    BibTeX
    @article{saeki-ijseke201306,
        author = {Motoshi Saeki and Shinpei Hayashi and Haruhiko Kaiya},
        title = {Enhancing Goal-Oriented Security Requirements Analysis Using Common Criteria-Based Knowledge},
        journal = {International Journal of Software Engineering and Knowledge Engineering},
        volume = 23,
        number = 5,
        pages = {695--720},
        year = 2013,
        month = {jun},
    }
    [saeki-ijseke201306]: as a page
  12. 大森 隆行, 丸山 勝久, 林 晋平, 沢田 篤史:"ソフトウェア進化研究の分類と動向".コンピュータソフトウェア, vol. 29,no. 3, pp. 3-28. aug,2012.
    ID
    DOI: 10.11309/jssst.29.3_3
    Abstract
    ソフトウェアは,利用者を満足させ続けるために絶えず進化しなければならない.本論文では,このようなソフトウェア進化に関連する研究を,手法,対象,目的という三つの視点から分類する基準を示す.その上で,それぞれの分類に基づき文献調査を行った結果を示す.この分類と調査の結果は,ソフトウェア進化分野の研究動向や研究の方向性を考察する足掛かりとなる.
    Software must be continually evolved to keep up with users’ needs. In this article, we propose a new taxonomy of software evolution. It consists of three perspectives: methods, targets, and objectives of evolution. We also present a literature review on software evolution based on our taxonomy. The result could provide a concrete baseline in discussing research trends and directions in the field of software evolution.
    BibTeX
    @article{omori-jssst201208,
        author = {大森 隆行 and 丸山 勝久 and 林 晋平 and 沢田 篤史},
        title = {ソフトウェア進化研究の分類と動向},
        journal = {コンピュータソフトウェア},
        volume = 29,
        number = 3,
        pages = {3--28},
        year = 2012,
        month = {aug},
    }
    [omori-jssst201208]: as a page
  13. 鵜飼 孝典, 林 晋平, 佐伯 元司:"要求獲得におけるステークホルダの偏りと不足を検出する可視化ツール".情報処理学会論文誌, vol. 53,no. 4, pp. 1448-1460. apr,2012.
    URL
    http://id.nii.ac.jp/1001/00081787/
    Abstract
    ソフトウェアの要求獲得は,ステークホルダによる協調作業である.プロジェクトマネージャや分析者にとって,ステークホルダの関心事を理解し,ステークホルダの偏りや不足などの潜在的な問題を知っておくことは重要である.本稿では,ゴール指向分析手法の1つであるAGORAの成果物である属性つきゴールグラフを対象に,要求分析作業中にステークホルダと,ステークホルダのシステム品質に関する関心事の関係をアンカーマップを使って可視化した.また,この手法を利用して,システムの信頼性,効率性,使用性などのシステム品質に関する重要な関心事をもれなく獲得するためにステークホルダの不足や偏りを発見することを支援するツールを開発した.このツールは,属性つきゴールグラフから自動的に,ステークホルダと品質に関する関心事の関係を抽出し,可視化する.さらに,実装したツールを用いた評価実験により,ステークホルダの偏りや不足を同定するのに,既存によく使われているステークホルダと要求の対応表よりも短時間で,正しくできることを示した.
    Software requirements elicitation is a cooperative work by stakeholders. It is important for project managers and analysts to understand stakeholder concerns and to identify potential problems such as imbalance or lack of stakeholders. This paper presents a technique and a tool which visualize the strength of stakeholders' interest of concerns on two dimensional screens. The tool generates anchored maps from an attributed goal graph by AGORA, which is an extended version of goal-oriented analysis methods. It has stakeholders' interest to concerns and its degree as the attributes of goals. Additionally an experimental evaluation is described, whose results show the user of the tool could identify imbalance and lack of stakeholders more accurately in shorter time than the case with a table of stakeholders and requirements.
    BibTeX
    @article{ugai-ipsjj201204,
        author = {鵜飼 孝典 and 林 晋平 and 佐伯 元司},
        title = {要求獲得におけるステークホルダの偏りと不足を検出する可視化ツール},
        journal = {情報処理学会論文誌},
        volume = 53,
        number = 4,
        pages = {1448--1460},
        year = 2012,
        month = {apr},
    }
    [ugai-ipsjj201204]: as a page
  14. Shinpei Hayashi, Daisuke Tanabe, Haruhiko Kaiya, Motoshi Saeki:"Impact Analysis on an Attributed Goal Graph".IEICE Transactions on Information and Systems, vol. E95-D,no. 4, pp. 1012-1020. apr,2012.
    ID
    DOI: 10.1587/transinf.E95.D.1012
    URL
    http://search.ieice.org/bin/summary.php?id=e95-d_4_1012&category=D&year=2012&lang=E
    Abstract
    Requirements changes frequently occur at any time of a software development process, and their management is a crucial issue to develop software of high quality. Meanwhile, goal-oriented analysis techniques are being put into practice to elicit requirements. In this situation, the change management of goal graphs and its support are necessary. This paper presents a technique related to the change management of goal graphs, realizing impact analysis on a goal graph when its modifications occur. Our impact analysis detects conflicts that arise when a new goal is added, and investigates the achievability of the other goals when an existing goal is deleted. We have implemented a supporting tool for automating the analysis. Two case studies suggested the efficiency of the proposed approach.
    BibTeX
    @article{hayashi-ieicet201204,
        author = {Shinpei Hayashi and Daisuke Tanabe and Haruhiko Kaiya and Motoshi Saeki},
        title = {Impact Analysis on an Attributed Goal Graph},
        journal = {IEICE Transactions on Information and Systems},
        volume = {E95-D},
        number = 4,
        pages = {1012--1020},
        year = 2012,
        month = {apr},
    }
    [hayashi-ieicet201204]: as a page
  15. 林 晋平, 関根 克幸, 佐伯 元司:"Feature Locationを用いたソフトウェア機能の対話的な実装理解支援".情報処理学会論文誌, vol. 53,no. 2, pp. 578-589. feb,2012.
    URL
    http://id.nii.ac.jp/1001/00080669/
    Abstract
    本論文ではFeature Location(FL)を用いて対話的にソフトウェア機能の実装を理解する手法を提案する.既存のFL手法は理解コストの削減に寄与するものの,機能に対応するコード片特定のための入力の構築は依然として難しい.提案手法では,FLの入力は利用者とシステムとの対話により段階的に改善されていく.利用者は,FLにより発見したコード片を実際に読み,得た理解やコード片中に出現する識別子をもとに入力クエリを改善する.さらに,読んだコード片が理解に貢献したかの判断をシステムに与える適合フィードバックによりFLの評価関数を改善し,より適切な結果を得る.FLとコード片の読解,フィードバックを対話的に繰り返すことにより,利用者は効率的に機能の実装を理解する.提案手法の支援ツールを用いた事例においては,提案手法は非対話的手法に比べ理解の効率化に貢献することが分かった.
    This paper proposes an interactive approach for efficiently understanding a feature implementation by applying feature location (FL). Although existing FL techniques can reduce the understanding cost, it is still an open issue to construct the appropriate inputs for the techniques. In our approach, the inputs of FL are incrementally improved by interactions between users and the FL system. By understanding a code fragment obtained using FL, users can find more appropriate queries from the identifiers in the fragment. Furthermore, the relevance feedback, obtained by partially judging whether or not a code fragment is required to understand, improves the evaluation score of FL. Users can then obtain more accurate results. We have implemented a supporting tool of our approach. Evaluation results using the tool show that our interactive approach is feasible and that it can reduce the understanding cost more effectively than the non-interactive approach.
    BibTeX
    @article{hayashi-ipsjj201202,
        author = {林 晋平 and 関根 克幸 and 佐伯 元司},
        title = {Feature Locationを用いたソフトウェア機能の対話的な実装理解支援},
        journal = {情報処理学会論文誌},
        volume = 53,
        number = 2,
        pages = {578--589},
        year = 2012,
        month = {feb},
    }
    [hayashi-ipsjj201202]: as a page
  16. 海谷 治彦, 清水 悠太郎, 安井 浩貴, 海尻 賢二, 林 晋平, 佐伯 元司:"要求獲得のためのオントロジをWebマイニングにより拡充する手法の提案と評価".情報処理学会論文誌, vol. 53,no. 2, pp. 495-509. feb,2012.
    URL
    http://id.nii.ac.jp/1001/00080661/
    Abstract
    ソフトウェア技術者がソフトウェアシステムの要求獲得を行うためには,システムを適用する問題領域の知識が必須である.ドメインオントロジ等の問題領域の知識の明示的な記述は,要求獲得結果を完全かつ正当にすることに貢献する.ドメインオントロジ等の利用を想定した要求獲得技法はいくつか提案されている.そして,対象分野に関する文書をまとめたり,当該分野の専門家から情報を抽出することで,ドメインオントロジを作成することはできる.しかし,一般に要求獲得を行う技術者は問題分野の専門家ではないため,分野に特化した情報のみから構成されるドメインオントロジだけでは,要求獲得を漏れなく誤りなく行うことは難しい.本稿では,Webマイニングの技術を用いてドメインオントロジに技術者がドメイン知識を理解するのに有益な知識を追加し,ドメインオントロジを拡充する手法とツールを提案する.提案手法では,まず,ドメインオントロジにすでに含まれる概念を検索語として用いて,当該概念に追加すべき概念の候補群をWebから自動的に収集する.そして,既存概念毎に,既存概念との関連の深さや,Web上の文書における出現頻度や分布に基づき,候補群のランク付けを自動的に行う.これらのランク付けに基づき技術者がオントロジの拡充を行う.拡充されたオントロジが要求獲得結果の漏れのなさ,誤りの少なさを改善できることを,比較実験を通して確認して結果も示す.
    Software engineers require knowledge about a problem domain when they elicit requirements for a system about the domain. Explicit descriptions about such knowledge such as domain ontology contribute to eliciting such requirements correctly and completely. Methods for eliciting requirements using ontology have been thus proposed, and such ontology is normally developed based on documents and/or experts in the problem domain. However, it is not easy for engineers to elicit requirements correctly and completely only with such domain ontology because they are not normally experts in the problem domain. In this paper, we propose a method and a tool to enhance domain ontology using Web mining. Our method and the tool help engineers to add additional knowledge suitable for them to understand domain ontology. According to our method, candidates of such additional knowledge are gathered from Web pages using keywords in existing domain ontology. The candidates are then prioritized based on the degree of the relationship between each candidate and existing ontology and on the frequency and the distribution of the candidate over Web pages. Engineers finally add new knowledge to existing ontology out of these prioritized candidates. We also show an experiment and its results for confirming enhanced ontology enables engineers to elicit requirements more completely and correctly than existing ontology does.
    BibTeX
    @article{kaiya-ipsjj201202,
        author = {海谷 治彦 and 清水 悠太郎 and 安井 浩貴 and 海尻 賢二 and 林 晋平 and 佐伯 元司},
        title = {要求獲得のためのオントロジをWebマイニングにより拡充する手法の提案と評価},
        journal = {情報処理学会論文誌},
        volume = 53,
        number = 2,
        pages = {495--509},
        year = 2012,
        month = {feb},
    }
    [kaiya-ipsjj201202]: as a page
  17. Rodion Moiseev, Shinpei Hayashi, Motoshi Saeki:"Using Hierarchical Transformation to Generate Assertion Code from OCL Constraints".IEICE Transactions on Information and Systems, vol. E94-D,no. 3, pp. 612-621. mar,2011.
    ID
    DOI: 10.1587/transinf.E94.D.612
    URL
    http://search.ieice.org/bin/summary.php?id=e94-d_3_612&category=D&year=2011&lang=E
    Abstract
    Object Constraint Language (OCL) is frequently applied in software development for stipulating formal constraints on software models. Its platform-independent characteristic allows for wide usage during the design phase. However, application in platform-specific processes, such as coding, is less obvious because it requires usage of bespoke tools for that platform. In this paper we propose an approach to generate assertion code for OCL constraints for multiple platform specific languages, using a unified framework based on structural similarities of programming languages. We have succeeded in automating the process of assertion code generation for four different languages using our tool. To show effectiveness of our approach in terms of development effort, an experiment was carried out and summarised.
    BibTeX
    @article{rodion-ieicet201103,
        author = {Rodion Moiseev and Shinpei Hayashi and Motoshi Saeki},
        title = {Using Hierarchical Transformation to Generate  Assertion Code from OCL Constraints},
        journal = {IEICE Transactions on Information and Systems},
        volume = {E94-D},
        number = 3,
        pages = {612--621},
        year = 2011,
        month = {mar},
    }
    [rodion-ieicet201103]: as a page
  18. 風戸 広史, 林 晋平, 小林 隆志, 佐伯 元司:"ベイジアンネットワークを用いたソフトウェア実装技術の選択支援".情報処理学会論文誌, vol. 51,no. 9, pp. 1765-1776. sep,2010.
    Abstract
    ソフトウェアの実行基盤を構成する個々の実装技術が,全体的な品質特性にどのような影響を及ぼすかを予測することは難しい.本稿では品質特性と実装技術の因果関係をベイジアンネットワークでモデル化し,実装技術の選択を支援する手法を提案する.また,ベイジアンネットワークの検証ツール上に提案手法を実装し,例題へ適用することによりその有効性を示す.
    It is difficult to estimate how a combination of implementation technologies influences quality attributes on an entire system. In this paper, we propose a technique to choose implementation technologies by modeling casual dependencies between requirements and technoloies probabilistically using Bayesian networks. We have implemented our technique on a Bayesian network tool and applied it to a case study of a business application to show its effectiveness.
    BibTeX
    @article{kazato-ipsjj201009,
        author = {風戸 広史 and 林 晋平 and 小林 隆志 and 佐伯 元司},
        title = {ベイジアンネットワークを用いたソフトウェア実装技術の選択支援},
        journal = {情報処理学会論文誌},
        volume = 51,
        number = 9,
        pages = {1765--1776},
        year = 2010,
        month = {sep},
    }
    [kazato-ipsjj201009]: as a page
  19. 小林 隆志, 林 晋平:"データマイニング技術を応用したソフトウェア構築・保守支援の研究動向".コンピュータソフトウェア, vol. 27,no. 3, pp. 13-23. aug,2010.
    ID
    DOI: 10.11309/jssst.27.3_13
    Abstract
    本論文では,多量のソフトウェア関連データを用いたソフトウェアの構築・保守支援手法及びそのために必要なデータマイニング技術の動向を,既存の研究を概観しつつ紹介する.
    This paper discusses recent studies on technologies for supporting software construction and maintenance by analyzing various software engineering data. We also introduce typical data mining techniques for analyzing the data.
    BibTeX
    @article{tkobaya-jssst201008,
        author = {小林 隆志 and 林 晋平},
        title = {データマイニング技術を応用したソフトウェア構築・保守支援の研究動向},
        journal = {コンピュータソフトウェア},
        volume = 27,
        number = 3,
        pages = {13--23},
        year = 2010,
        month = {aug},
    }
    [tkobaya-jssst201008]: as a page
  20. 林 晋平, 佐々木 祐輔, 佐伯 元司:"階層分析法を応用したソースコード変更案の評価".コンピュータソフトウェア, vol. 27,no. 2, pp. 118-123. may,2010.
    ID
    DOI: 10.11309/jssst.27.2_118
    Abstract
    本稿では,ソフトウェア開発プロジェクトの方針に基づいて,各開発者による変更案の選択を支援する手法を提案する.提案手法では,開発者個人の主観による影響を抑制するために,複数のソフトウェアメトリクスを統合した評価関数によって変更の選択肢の優劣を判断する.また,プロジェクトの方針に基づいた選択を実現するために,ソースコードに対する変更の選択を複数のメトリクスを評価項目とする多目的意思決定とみなすことにより,階層分析法を応用して評価関数の作成を行う.予備評価においては,提案手法は変更の選択に有用であった.
    This paper proposes a technique for selecting the most appropriate alternative of source code changes based on the commitment of a software development project by each developer of the project. In the technique, we evaluate the alternative changes by using an evaluation function with integrating multiple software metrics to suppress the influence of each developer’s subjectivity. By regarding the selection of the alternative changes as a multiple criteria decision making, we create the function with Analytic Hierarchy Process. A preliminary evaluation shows the efficiency of the technique.
    BibTeX
    @article{hayashi-jssst201005,
        author = {林 晋平 and 佐々木 祐輔 and 佐伯 元司},
        title = {階層分析法を応用したソースコード変更案の評価},
        journal = {コンピュータソフトウェア},
        volume = 27,
        number = 2,
        pages = {118--123},
        year = 2010,
        month = {may},
    }
    [hayashi-jssst201005]: as a page
  21. Shinpei Hayashi, Yasuyuki Tsuda, Motoshi Saeki:"Search-Based Refactoring Detection from Source Code Revisions".IEICE Transactions on Information and Systems, vol. E93-D,no. 4, pp. 754-762. apr,2010.
    ID
    DOI: 10.1587/transinf.E93.D.754
    URL
    http://search.ieice.org/bin/summary.php?id=e93-d_4_754
    Abstract
    This paper proposes a technique for detecting the occurrences of refactoring from source code revisions. In a real software development process, a refactoring operation may sometimes be performed together with other modifications at the same revision. This means that detecting refactorings from the differences between two versions stored in a software version archive is not usually an easy process. In order to detect these impure refactorings, we model the detection within a graph search. Our technique considers a version of a program as a state and a refactoring as a transition between two states. It then searches for the path that approaches from the initial to the final state. To improve the efficiency of the search, we use the source code differences between the current and the final state for choosing the candidates of refactoring to be applied next and estimating the heuristic distance to the final state. Through case studies, we show that our approach is feasible to detect combinations of refactorings.
    BibTeX
    @article{hayashi-ieicet201004,
        author = {Shinpei Hayashi and Yasuyuki Tsuda and Motoshi Saeki},
        title = {Search-Based Refactoring Detection from Source Code Revisions},
        journal = {IEICE Transactions on Information and Systems},
        volume = {E93-D},
        number = 4,
        pages = {754--762},
        year = 2010,
        month = {apr},
    }
    [hayashi-ieicet201004]: as a page
  22. Takeshi Obayashi, Shinpei Hayashi, Motoshi Saeki, Hiroyuki Ohta, Kengo Kinoshita:"ATTED-II provides coexpressed gene networks for Arabidopsis".Nucleic Acids Research, vol. 37,DB issue, pp. 987-991. jan,2009.
    ID
    DOI: 10.1093/nar/gkn807
    URL
    http://www.pubmed.gov/?db=pubmed&cmd=retrieve&list_uids=18953027
    Abstract
    ATTED-II (http://atted.jp) is a database of gene coexpression in Arabidopsis that can be used to design a wide variety of experiments, including the prioritization of genes for functional identification or for studies of regulatory relationships. Here, we report updates of ATTED-II that focus especially on functionalities for constructing gene networks with regard to the following points: (i) introducing a new measure of gene coexpression to retrieve functionally related genes more accurately, (ii) implementing clickable maps for all gene networks for step-by-step navigation, (iii) applying Google Maps API to create a single map for a large network, (iv) including information about protein-protein interactions, (v) identifying conserved patterns of coexpression and (vi) showing and connecting KEGG pathway information to identify functional modules. With these enhanced functions for gene network representation, ATTED-II can help researchers to clarify the functional and regulatory networks of genes in Arabidopsis.
    BibTeX
    @article{obayashi-nar200901,
        author = {Takeshi Obayashi and Shinpei Hayashi and Motoshi Saeki and Hiroyuki Ohta and Kengo Kinoshita},
        title = {{ATTED-II} provides coexpressed gene networks for Arabidopsis},
        journal = {Nucleic Acids Research},
        volume = 37,
        number = {DB issue},
        pages = {987--991},
        year = 2009,
        month = {jan},
    }
    [obayashi-nar200901]: as a page
  23. Shinpei Hayashi, Junya Katada, Ryota Sakamoto, Takashi Kobayashi, Motoshi Saeki:"Design Pattern Detection by Using Meta Patterns".IEICE Transactions on Information and Systems, vol. E91-D,no. 4, pp. 933-944. apr,2008.
    ID
    DOI: 10.1093/ietisy/e91-d.4.933
    URL
    http://search.ieice.org/bin/summary.php?id=e91-d_4_933
    Abstract
    One of the approaches to improve program understanding is to extract what kinds of design pattern are used in existing object-oriented software. This paper proposes a technique for efficiently and accurately detecting occurrences of design patterns included in source codes. We use both static and dynamic analyses to achieve the detection with high accuracy. Moreover, to reduce computation and maintenance costs, detection conditions are hierarchically specified based on Pree's meta patterns as common structures of design patterns. The usage of Prolog to represent the detection conditions enables us to easily add and modify them. Finally, we have implemented an automated tool as an Eclipse plug-in and conducted experiments with Java programs. The experimental results show the effectiveness of our approach.
    BibTeX
    @article{hayashi-ieicet200804,
        author = {Shinpei Hayashi and Junya Katada and Ryota Sakamoto and Takashi Kobayashi and Motoshi Saeki},
        title = {Design Pattern Detection by Using Meta Patterns},
        journal = {IEICE Transactions on Information and Systems},
        volume = {E91-D},
        number = 4,
        pages = {933--944},
        year = 2008,
        month = {apr},
    }
    [hayashi-ieicet200804]: as a page
  24. Takeshi Obayashi, Shinpei Hayashi, Masayuki Shibaoka, Motoshi Saeki, Hiroyuki Ohta, Kengo Kinoshita:"COXPRESdb: a database of coexpressed gene networks in mammals".Nucleic Acids Research, vol. 36,DB issue, pp. 77-82. jan,2008.
    ID
    DOI: 10.1093/nar/gkm840
    URL
    http://www.pubmed.gov/?db=pubmed&cmd=retrieve&list_uids=17932064
    Abstract
    A database of coexpressed gene sets can provide valuable information for a wide variety of experimental designs, such as targeting of genes for functional identification, gene regulation and/or protein-protein interactions. Coexpressed gene databases derived from publicly available GeneChip data are widely used in Arabidopsis research, but platforms that examine coexpression for higher mammals are rather limited. Therefore, we have constructed a new database, COXPRESdb (coexpressed gene database) (http://coxpresdb.hgc.jp), for coexpressed gene lists and networks in human and mouse. Coexpression data could be calculated for 19 777 and 21 036 genes in human and mouse, respectively, by using the GeneChip data in NCBI GEO. COXPRESdb enables analysis of the four types of coexpression networks: (i) highly coexpressed genes for every gene, (ii) genes with the same GO annotation, (iii) genes expressed in the same tissue and (iv) user-defined gene sets. When the networks became too big for the static picture on the web in GO networks or in tissue networks, we used Google Maps API to visualize them interactively. COXPRESdb also provides a view to compare the human and mouse coexpression patterns to estimate the conservation between the two species.
    BibTeX
    @article{obayashi-nar200801,
        author = {Takeshi Obayashi and Shinpei Hayashi and Masayuki Shibaoka and Motoshi Saeki and Hiroyuki Ohta and Kengo Kinoshita},
        title = {{COXPRESdb}: a database of coexpressed gene networks in mammals},
        journal = {Nucleic Acids Research},
        volume = 36,
        number = {DB issue},
        pages = {77--82},
        year = 2008,
        month = {jan},
    }
    [obayashi-nar200801]: as a page
  25. Takeshi Obayashi, Kengo Kinoshita, Kenta Nakai, Masayuki Shibaoka, Shinpei Hayashi, Motoshi Saeki, Daisuke Shibata, Kazuki Saito, Hiroyuki Ohta:"ATTED-II: a database of co-expressed genes and cis elements for identifying co-regulated gene groups in Arabidopsis".Nucleic Acids Research, vol. 35,DB issue, pp. 863-869. jan,2007.
    ID
    DOI: 10.1093/nar/gkl783
    URL
    http://www.pubmed.gov/?db=pubmed&cmd=retrieve&list_uids=17130150
    Abstract
    Publicly available database of co-expressed gene sets would be a valuable tool for a wide variety of experimental designs, including targeting of genes for functional identification or for regulatory investigation. Here, we report the construction of an Arabidopsis thaliana trans-factor and cis-element prediction database (ATTED-II) that provides co-regulated gene relationships based on co-expressed genes deduced from microarray data and the predicted cis elements. ATTED-II (http://www.atted.bio.titech.ac.jp) includes the following features: (i) lists and networks of co-expressed genes calculated from 58 publicly available experimental series, which are composed of 1388 GeneChip data in A.thaliana; (ii) prediction of cis-regulatory elements in the 200 bp region upstream of the transcription start site to predict co-regulated genes amongst the co-expressed genes; and (iii) visual representation of expression patterns for individual genes. ATTED-II can thus help researchers to clarify the function and regulation of particular genes and gene networks.
    BibTeX
    @article{obayashi-nar200701,
        author = {Takeshi Obayashi and Kengo Kinoshita and Kenta Nakai and Masayuki Shibaoka and Shinpei Hayashi and Motoshi Saeki and Daisuke Shibata and Kazuki Saito and Hiroyuki Ohta},
        title = {{ATTED-II}: a database of co-expressed genes and {\it cis} elements for identifying co-regulated gene groups in {\it Arabidopsis}},
        journal = {Nucleic Acids Research},
        volume = 35,
        number = {DB issue},
        pages = {863--869},
        year = 2007,
        month = {jan},
    }
    [obayashi-nar200701]: as a page
  26. Shinpei Hayashi, Motoshi Saeki, Masahito Kurihara:"Supporting Refactoring Activities Using Histories of Program Modification".IEICE Transactions on Information and Systems, vol. E89-D,no. 4, pp. 1403-1412. apr,2006.
    ID
    DOI: 10.1093/ietisy/e89-d.4.1403
    URL
    http://search.ieice.org/bin/summary.php?id=e89-d_4_1403
    Abstract
    Refactoring is one of the promising techniques for improving program design by means of program transformation with preserving behavior, and is widely applied in practice. However, it is difficult for engineers to identify how and where to refactor programs, because proper knowledge and skills of a high order are required of them. In this paper, we propose the technique to instruct how and where to refactor a program by using a sequence of its modifications. We consider that the histories of program modifications reflect developers' intentions, and focusing on them allows us to provide suitable refactoring guides. Our technique can be automated by storing the correspondence of modification patterns to suitable refactoring operations. By implementing an automated supporting tool, we show its feasibility. The tool is implemented as a plug-in for Eclipse IDE. It selects refactoring operations by matching between a sequence of program modifications and modification patterns.
    BibTeX
    @article{hayashi-ieicet200604,
        author = {Shinpei Hayashi and Motoshi Saeki and Masahito Kurihara},
        title = {Supporting Refactoring Activities Using Histories of Program Modification},
        journal = {IEICE Transactions on Information and Systems},
        volume = {E89-D},
        number = 4,
        pages = {1403--1412},
        year = 2006,
        month = {apr},
    }
    [hayashi-ieicet200604]: as a page

Research Talks Presented in International Conferences, Workshops, or Symposia

  1. Keisuke Asano, Shinpei Hayashi, Motoshi Saeki:"Detecting Bad Smells of Refinement in Goal-Oriented Requirements Analysis".In Proceedings of the 4th International Workshop on Conceptual Modeling in Requirements and Business Analysis (MReBa 2017), co-located with ER 2017, LNCS, vol. 10651, pp. 122-132. Valencia, Spain,nov,2017.
    ID
    DOI: 10.1007/978-3-319-70625-2_12
    Abstract
    Goal refinement is a crucial step in goal-oriented requirements analysis to create a goal model of high quality. Poor goal refinement leads to missing requirements and eliciting incorrect requirements as well as less comprehensiveness of produced goal models. This paper proposes a technique to automate detecting \textit{bad smells} of goal refinement, symptoms of poor goal refinement. Based on the classification of poor refinement, we defined four types of bad smells of goal refinement and developed two types of measures to detect them: measures on the graph structure of a goal model and semantic similarity of goal descriptions. We have implemented a support tool to detect bad smells and assessed its usefulness by an experiment.
    Slide
    BibTeX
    @inproceedings{k_asano-mreba2017,
        author = {Keisuke Asano and Shinpei Hayashi and Motoshi Saeki},
        title = {Detecting Bad Smells of Refinement in Goal-Oriented Requirements Analysis},
        booktitle = {Proceedings of the 4th International Workshop on Conceptual Modeling in Requirements and Business Analysis},
        pages = {122--132},
        year = 2017,
        month = {nov},
    }
    [k_asano-mreba2017]: as a page
  2. Tomoo Kinoshita, Shinpei Hayashi, Motoshi Saeki:"Goal-Oriented Requirements Analysis Meets a Creativity Technique".In Proceedings of the 4th International Workshop on Conceptual Modeling in Requirements and Business Analysis (MReBa 2017), co-located with ER 2017, LNCS, vol. 10651, pp. 101-110. Valencia, Spain,nov,2017.
    ID
    DOI: 10.1007/978-3-319-70625-2_10
    Abstract
    Goal-oriented requirements analysis (GORA) has been growing in the area of requirement engineering. It is one of the approaches that elicits and analyzes stakeholders’ requirements as goals to be achieved, and develops an AND-OR graph, called a goal graph, as a result of requirements elicitation. However, although it is important to involve stakeholders’ ideas and viewpoints during requirements elicitation, GORA still has a problem that their processes lack the deeper participation of stakeholders. Regarding stakeholders’ participation, creativity techniques have also become popular in requirements engineering. They aim to create novel and appropriate requirements by involving stakeholders. One of these techniques, the KJ-method is a method which organizes and associates novel ideas generated by Brainstorming. In this paper, we present an approach to support stakeholders’ participation during GORA processes by transforming an affinity diagrams of the KJ-method, into a goal graph, including transformation guidelines, and also apply our approach to an example.
    BibTeX
    @inproceedings{kinoshita-mreba2017,
        author = {Tomoo Kinoshita and Shinpei Hayashi and Motoshi Saeki},
        title = {Goal-Oriented Requirements Analysis Meets a Creativity Technique},
        booktitle = {Proceedings of the 4th International Workshop on Conceptual Modeling in Requirements and Business Analysis},
        pages = {101--110},
        year = 2017,
        month = {nov},
    }
    [kinoshita-mreba2017]: as a page
  3. Lan Wang, Shinpei Hayashi, Motoshi Saeki:"An Improvement on Data Interoperability with Large-Scale Conceptual Model and Its Application in Industry".In Conceptual Modeling: Research in Progress: Companion Proceedings of the 36th International Conference on Conceptual Modelling (ER 2017), vol. 1979, pp. 249-262. Valencia, Spain,nov,2017.
    URL
    http://ceur-ws.org/Vol-1979/paper-27.pdf
    Abstract
    In the world of the Internet of Things, heterogeneous systems and devices need to be connected. A key issue for systems and devices is data interoperability such as automatic data exchange and interpretation. A well-known approach to solve the interoperability problem is building a conceptual model (CM). Regarding CM in industrial domains, there are often a large number of entities defined in one CM. How data interoperability with such a large-scale CM can be supported is a critical issue when applying CM into industrial domains. In this paper, evolved from our previous work, a meta-model equipped with new concepts of “PropertyRelationship” and “Category” is proposed, and a tool called FSCM supporting the automatic generation of property relationships and categories is developed. A case study in an industrial domain shows that the proposed approach effectively improves the data interoperability of large-scale CMs.
    BibTeX
    @inproceedings{wlan-er2017,
        author = {Lan Wang and Shinpei Hayashi and Motoshi Saeki},
        title = {An Improvement on Data Interoperability with Large-Scale Conceptual Model and Its Application in Industry},
        booktitle = {Conceptual Modeling: Research in Progress: Companion Proceedings of the 36th International Conference on Conceptual Modelling},
        pages = {249--262},
        year = 2017,
        month = {nov},
    }
    [wlan-er2017]: as a page
  4. Natthawute Sae-Lim, Shinpei Hayashi, Motoshi Saeki:"How Do Developers Select and Prioritize Code Smells? A Preliminary Study".In Proceedings of the 33rd IEEE International Conference on Software Maintenance and Evolution (ICSME 2017), pp. 484-488. Shanghai, China,sep,2017.
    ID
    DOI: 10.1109/ICSME.2017.66
    Abstract
    Code smells are considered to be indicators of design flaws or problems in source code. Various tools and techniques have been proposed for detecting code smells. The number of code smells detected by these tools is generally large, so approaches have also been developed for prioritizing and filtering code smells. However, the lack of empirical data regarding how developers select and prioritize code smells hinders improvements to these approaches. In this study, we investigated professional developers to determine the factors they use for selecting and prioritizing code smells. We found that \textit{Task relevance} and \textit{Smell severity} were most commonly considered during code smell selection, while \textit{Module importance} and \textit{Task relevance} were employed most often for code smell prioritization. These results may facilitate further research into code smell detection, prioritization, and filtration to better focus on the actual needs of developers.
    BibTeX
    @inproceedings{natthawute-icsme2017,
        author = {Natthawute Sae-Lim and Shinpei Hayashi and Motoshi Saeki},
        title = {How Do Developers Select and Prioritize Code Smells? A Preliminary Study},
        booktitle = {Proceedings of the 33rd IEEE International Conference on Software Maintenance and Evolution},
        pages = {484--488},
        year = 2017,
        month = {sep},
    }
    [natthawute-icsme2017]: as a page
  5. Yu Negishi, Shinpei Hayashi, Motoshi Saeki:"Establishing Regulatory Compliance in Goal-Oriented Requirements Analysis".In Proceedings of the 19th IEEE Conference on Business Informatics (CBI 2017), pp. 434-443. Thessaloniki, Greece,jul,2017.
    ID
    DOI: 10.1109/CBI.2017.49
    Abstract
    To develop with lower costs information systems that do not violate regulations, it is necessary to elicit requirements compliant to the regulations. Automated supports allow us to avoid missing requirements necessary to comply with regulations and to exclude functional requirements against the regulations. In this paper, we propose a technique to detect goals relevant to regulations in a goal model and to add goals so that the resulting goal model can be compliant to the regulations. In this approach, we obtain the goals relevant to regulations by semantically matching goal descriptions to regulatory statements. We use Case Grammar approach to deal with the meaning of goal descriptions and regulatory statements, i.e., both are transformed to case frames as their semantic representations, and we check if their case frames can be unified. After detecting the relevant goals, based on the modality of matched regulatory statements, new goals to realize the compliance to regulatory statements are added to the goal model. We made case studies and had a result that 93\% of regulatory violations could be corrected.
    Slide
    BibTeX
    @inproceedings{negishi-cbi2017,
        author = {Yu Negishi and Shinpei Hayashi and Motoshi Saeki},
        title = {Establishing Regulatory Compliance in Goal-Oriented Requirements Analysis},
        booktitle = {Proceedings of the 19th IEEE Conference on Business Informatics},
        pages = {434--443},
        year = 2017,
        month = {jul},
    }
    [negishi-cbi2017]: as a page
  6. Maaki Nakano, Kunihiro Noda, Shinpei Hayashi, Takashi Kobayashi:"Mediating Turf Battles! Prioritizing Shared Modules in Locating Multiple Features".In Proceedings of the 41st IEEE Computer Society Signature Conference on Computers, Software and Applications (COMPSAC 2017), pp. 363-368. Torino, Italy,jul,2017.
    ID
    DOI: 10.1109/COMPSAC.2017.167
    Abstract
    Dynamic feature location techniques (DFLTs), which use execution profiles of scenarios that trigger a feature, are a promising approach to locating features in the source code. A sufficient set of scenarios is key to obtaining highly accurate results; however, its preparation is laborious and difficult in practice. In most cases, a scenario exercises not only the desired feature but also other features. We focus on the relationship between a module and multiple features that can be calculated with no extra scenarios, to improve the accuracy of locating the desired feature in the source code. In this paper, we propose a DFLT using the odds ratios of the multiple relationships between modules and features. We use the similarity coefficient, which is used in fault localization techniques, as a relationship. Our DFLT better orders shared modules compared with an existing DFLT. To reduce developer costs in our DFLT, we also propose a filtering technique that uses formal concept analysis. We evaluate our DFLT on the features of an open source software project with respect to developer costs and show that our DFLT outperforms the existing approach; the average cost of our DFLT is almost half that of the state-of-the-art DFLT.
    BibTeX
    @inproceedings{maaki-compsac2017,
        author = {Maaki Nakano and Kunihiro Noda and Shinpei Hayashi and Takashi Kobayashi},
        title = {Mediating Turf Battles! Prioritizing Shared Modules in Locating Multiple Features},
        booktitle = {Proceedings of the 41st IEEE Computer Society Signature Conference on Computers, Software and Applications},
        pages = {363--368},
        year = 2017,
        month = {jul},
    }
    [maaki-compsac2017]: as a page
  7. Shinpei Hayashi, Fumiki Minami, Motoshi Saeki:"Inference-Based Detection of Architectural Violations in MVC2".In Proceedings of the 12th International Conference on Software Technologies (ICSOFT 2017), pp. 394-401. Madrid, Spain,jul,2017.
    ID
    DOI: 10.5220/0006465103940401
    Abstract
    Utilizing software architecture patterns is important for reducing maintenance costs. However, maintaining code according to the constraints defined by the architecture patterns is time-consuming work. As described herein, we propose a technique to detect code fragments that are incompliant to the architecture as fine-grained architectural violations. For this technique, the dependence graph among code fragments extracted from the source code and the inference rules according to the architecture are the inputs. A set of candidate components to which a code fragment can be affiliated is attached to each node of the graph and is updated step-by-step. The inference rules express the components' responsibilities and dependency constraints. They remove candidate components of each node that do not satisfy the constraints from the current estimated state of the surrounding code fragment. If the current result does not include the current component, then it is detected as a violation. By defining inference rules for MVC2 architecture and applying the technique to web applications using Play Framework, we obtained accurate detection results.
    Slide
    BibTeX
    @inproceedings{hayashi-icsoft2017,
        author = {Shinpei Hayashi and Fumiki Minami and Motoshi Saeki},
        title = {Inference-Based Detection of Architectural Violations in MVC2},
        booktitle = {Proceedings of the 12th International Conference on Software Technologies},
        pages = {394--401},
        year = 2017,
        month = {jul},
    }
    [hayashi-icsoft2017]: as a page
  8. Katsuhisa Maruyama, Shinpei Hayashi:"A Tool Supporting Postponable Refactoring".In Proceedings of the 39th International Conference on Software Engineering (ICSE 2017), Poster Session, pp. 133-135. Buenos Aires, Argentina,may,2017.
    ID
    DOI: 10.1109/ICSE-C.2017.108
    Abstract
    Failures of precondition checking when attempting to apply automated refactorings often discourage programmers from attempting to use these refactorings in the future. To alleviate this situation, the postponement of the failed refactoring instead its cancellation is beneficial. This poster paper proposes a new concept of postponable refactoring and a prototype tool that implements postponable Extract Method as an Eclipse plug-in. We believe that this refactoring tool inspires a new field of reconciliation automated and manual refactoring.
    BibTeX
    @inproceedings{maruyama-icse2017,
        author = {Katsuhisa Maruyama and Shinpei Hayashi},
        title = {A Tool Supporting Postponable Refactoring},
        booktitle = {Proceedings of the 39th International Conference on Software Engineering},
        pages = {133--135},
        year = 2017,
        month = {may},
    }
    [maruyama-icse2017]: as a page
  9. Natthawute Sae-Lim, Shinpei Hayashi, Motoshi Saeki:"Revisiting Context-Based Code Smells Prioritization: On Supporting Referred Context".In Proceedings of the XP 2017 Scientific Workshops (MTD 2017), co-located with XP 2017,no. 3, pp. 1-5. Cologne, Germany,may,2017.
    ID
    DOI: 10.1145/3120459.3120463
    Abstract
    Because numerous code smells are revealed by code smell detectors, many attempts have been undertaken to mitigate related problems by prioritizing and filtering code smells. We earlier proposed a technique to prioritize code smells by leveraging the context of the developers, i.e., the modules that the developers plan to implement. Our empirical studies revealed that the results of code smells prioritized using our technique are useful to support developers' implementation on the modules they intend to change. Nonetheless, in software change processes, developers often navigate through many modules and refer to them before making actual changes. Such modules are important when considering the developers' context. Therefore, it is essential to ascertain whether our technique can also support developers on modules to which they are going to refer to make changes. We conducted an empirical study of an open source project adopting tools for recording developers' interaction history. Our results demonstrate that the code smells prioritized using our approach can also be used to support developers for modules to which developers are going to refer, irrespective of the need for modification.
    BibTeX
    @inproceedings{natthawute-mtd2017,
        author = {Natthawute Sae-Lim and Shinpei Hayashi and Motoshi Saeki},
        title = {Revisiting Context-Based Code Smells Prioritization: On Supporting Referred Context},
        booktitle = {Proceedings of the XP 2017 Scientific Workshops},
        pages = {1--5},
        year = 2017,
        month = {may},
    }
    [natthawute-mtd2017]: as a page
  10. Shoichiro Ito, Shinpei Hayashi, Motoshi Saeki:"How Can You Improve Your As-is Models? Requirements Analysis Methods Meet GQM".In Proceedings of the 23rd Working Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2017), pp. 95-111. Essen, Germany,feb,2017.
    ID
    DOI: 10.1007/978-3-319-54045-0_8
    Abstract
    [Context & motivation] To develop information systems providing high business value, we should clarify As-is business processes and information systems supporting them, identify the problems hidden in them, and develop To-be information systems so that the identified problems can be solved. [Question/problem] In this development, we need a technique to support the identification of the problems, which can be seamlessly connected to the modeling techniques. [Principal ideas/results] In this paper, to define metrics to extract problems of the As-is system, following the domains specific to it, we propose the combination of Goal-Question-Metric (GQM) with existing requirements analysis techniques. Furthermore, we integrate goal-oriented requirements analysis (GORA) with problem frames approach and use case modeling to define the metrics of measuring the problematic efforts of human actors in the As-is models. This paper includes a case study of a reporting operation process at a brokerage office to check the feasibility of our approach. [Contribution] Our contribution is the proposal of using of GQM to identify the problems of an As-is model specified with the combination of GORA, use case modeling, and problem frames.
    Slide
    BibTeX
    @inproceedings{ito-refsq2017,
        author = {Shoichiro Ito and Shinpei Hayashi and Motoshi Saeki},
        title = {How Can You Improve Your As-is Models? Requirements Analysis Methods Meet GQM},
        booktitle = {Proceedings of the 23rd Working Conference on Requirements Engineering: Foundation for Software Quality},
        pages = {95--111},
        year = 2017,
        month = {feb},
    }
    [ito-refsq2017]: as a page
  11. Katsuhisa Maruyama, Shinpei Hayashi, Norihiro Yoshida, Eunjong Choi:"Frame-Based Behavior Preservation in Refactoring".In Proceedings of the 24th IEEE International Conference on Software Analysis, Evolution, and Reengineering (SANER 2017), Poster Session, pp. 573-574. Klagenfurt, Austria,feb,2017.
    ID
    DOI: 10.1109/SANER.2017.7884683
    Abstract
    Behavior preservation often bothers programmers in refactoring. This poster paper proposes a new approach that tames the behavior preservation by introducing the concept of a frame. A frame in refactoring defines stakeholder's individual concerns about the refactored code. Frame-based refactoring preserves the observable behavior within a particular frame. Therefore, it helps programmers distinguish the behavioral changes that they should observe from those that they can ignore.
    BibTeX
    @inproceedings{maruyama-saner2017,
        author = {Katsuhisa Maruyama and Shinpei Hayashi and Norihiro Yoshida and Eunjong Choi},
        title = {Frame-Based Behavior Preservation in Refactoring},
        booktitle = {Proceedings of the 24th IEEE International Conference on Software Analysis, Evolution, and Reengineering},
        pages = {573--574},
        year = 2017,
        month = {feb},
    }
    [maruyama-saner2017]: as a page
  12. Shinpei Hayashi, Hiroshi Kazato, Takashi Kobayashi, Tsuyoshi Oshima, Katsuyuki Natsukawa, Takashi Hoshino, Motoshi Saeki:"Guiding Identification of Missing Scenarios for Dynamic Feature Location".In Proceedings of the 23rd Asia-Pacific Software Engineering Conference (APSEC 2016), pp. 393-396. Hamilton, New Zealand,dec,2016.
    ID
    DOI: 10.1109/APSEC.2016.63
    Abstract
    Feature location (FL) is an important activity for finding correspondence between software features and modules in source code. Although dynamic FL techniques are effective, the quality of their results depends on analysts to prepare sufficient scenarios for exercising the features. In this paper, we propose a technique for guiding identification of missing scenarios using the prior FL result. After applying FL, unexplored call dependencies are extracted by comparing the results of static and dynamic analyses, and analysts are advised to investigate them for finding missing scenarios. We propose several metrics that measure the potential impact of unexplored dependencies to help analysts sort out them. Through a preliminary evaluation using an example web application, we showed our technique was effective for recommending the clues to find missing scenarios.
    Slide
    BibTeX
    @inproceedings{hayashi-apsec2016,
        author = {Shinpei Hayashi and Hiroshi Kazato and Takashi Kobayashi and Tsuyoshi Oshima and Katsuyuki Natsukawa and Takashi Hoshino and Motoshi Saeki},
        title = {Guiding Identification of Missing Scenarios for Dynamic Feature Location},
        booktitle = {Proceedings of the 23rd Asia-Pacific Software Engineering Conference},
        pages = {393--396},
        year = 2016,
        month = {dec},
    }
    [hayashi-apsec2016]: as a page
  13. Keisuke Asano, Shinpei Hayashi:"Toward Detecting Inappropriate Goal Refinements in a Goal Model".The 35th International Conference on Conceptual Modeling (ER 2016), Poster Session. Gifu, Japan,nov,2016.
    BibTeX
    @misc{k_asano-er2016,
        author = {Keisuke Asano and Shinpei Hayashi},
        title = {Toward Detecting Inappropriate Goal Refinements in a Goal Model},
        howpublished = {The 35th International Conference on Conceptual Modeling},
        year = 2016,
        month = {nov},
    }
    [k_asano-er2016]: as a page
  14. Tomoo Kinoshita, Shinpei Hayashi:"How Do We Use Goal-Oriented Requirements Analysis in Interviews with Stakeholders?: An Approach to Transforming Affinity Diagrams into Goal Graphs".The 35th International Conference on Conceptual Modeling (ER 2016), Poster Session. Gifu, Japan,nov,2016.
    BibTeX
    @misc{kinoshita-er2016,
        author = {Tomoo Kinoshita and Shinpei Hayashi},
        title = {How Do We Use Goal-Oriented Requirements Analysis in Interviews with Stakeholders?: An Approach to Transforming Affinity Diagrams into Goal Graphs},
        howpublished = {The 35th International Conference on Conceptual Modeling},
        year = 2016,
        month = {nov},
    }
    [kinoshita-er2016]: as a page
  15. Lan Wang, Shinpei Hayashi:"How to Keep System Consistency via Meta-Model-Based Traceability Rules?".The 35th International Conference on Conceptual Modeling (ER 2016), Poster Session. Gifu, Japan,nov,2016.
    BibTeX
    @misc{wlan-er2016,
        author = {Lan Wang and Shinpei Hayashi},
        title = {How to Keep System Consistency via Meta-Model-Based Traceability Rules?},
        howpublished = {The 35th International Conference on Conceptual Modeling},
        year = 2016,
        month = {nov},
    }
    [wlan-er2016]: as a page
  16. Haruhiko Kaiya, Shinpei Ogata, Shinpei Hayashi, Motoshi Saeki:"Early Requirements Analysis for a Socio-Technical System based on Goal Dependencies".In Proceedings of the 15th International Conference on Intelligent Software Methodologies, Tools and Techniques (SOMET 2016), pp. 125-138. Larnaca, Cyprus,sep,2016. Best Paper Award 受賞.
    ID
    DOI: 10.3233/978-1-61499-674-3-125
    Abstract
    A socio-technical system (STS) consists of many different actors such as people, organizations, software applications and infrastructures. We call actors except both people and organizations machines. Machines should be carefully introduced into the STS because the machines are beneficial to some people or organization but harmful to others. We thus propose a goal-oriented requirements modelling language called GDMA based on i* so that machines with the following characteristics can be systematically specified. First, machines make the goals of each people be achieved more and better than ever. Second, machines make people achieve goals fewer and easier than ever. We also propose analysis techniques of GDMA to judge whether or not the introduction of machines are appropriate or not. Several machines are introduced into an as-is model of GDMA locally with the help of model transformation techniques. Then, such an introduction is evaluated globally on the basis of metrics derived from the model structure. We confirmed that GDMA could evaluate the successful and failure of existing projects.
    BibTeX
    @inproceedings{kaiya-somet2016,
        author = {Haruhiko Kaiya and Shinpei Ogata and Shinpei Hayashi and Motoshi Saeki},
        title = {Early Requirements Analysis for a Socio-Technical System based on Goal Dependencies},
        booktitle = {Proceedings of the 15th International Conference on Intelligent Software Methodologies, Tools and Techniques},
        pages = {125--138},
        year = 2016,
        month = {sep},
    }
    [kaiya-somet2016]: as a page
  17. Natthawute Sae-Lim, Shinpei Hayashi, Motoshi Saeki:"Context-Based Code Smells Prioritization for Prefactoring".In Proceedings of the 24th International Conference on Program Comprehension (ICPC 2016), pp. 1-10. Austin, Texas, USA,may,2016.
    ID
    DOI: 10.1109/ICPC.2016.7503705
    Abstract
    To find opportunities for applying prefactoring, several techniques for detecting bad smells in source code have been proposed. Existing smell detectors are often unsuitable for developers who have a specific context because these detectors do not consider their current context and output the results that are mixed with both smells that are and are not related to such context. Consequently, the developers must spend a considerable amount of time identifying relevant smells. As described in this paper, we propose a technique to prioritize bad code smells using developers' context. The explicit data of the context are obtained using a list of issues extracted from an issue tracking system. We applied impact analysis to the list of issues and used the results to specify which smells are associated with the context. Consequently, our approach can provide developers with a list of prioritized bad code smells related to their current context. Several evaluations using open source projects demonstrate the effectiveness of our technique.
    BibTeX
    @inproceedings{natthawute-icpc2016,
        author = {Natthawute Sae-Lim and Shinpei Hayashi and Motoshi Saeki},
        title = {Context-Based Code Smells Prioritization for Prefactoring},
        booktitle = {Proceedings of the 24th International Conference on Program Comprehension},
        pages = {1--10},
        year = 2016,
        month = {may},
    }
    [natthawute-icpc2016]: as a page
  18. Tatsuya Abe, Shinpei Hayashi, Motoshi Saeki:"Modeling and Utilizing Security Knowledge for Eliciting Security Requirements".In Proceedings of the 2nd International Workshop on Conceptual Modeling in Requirements and Business Analysis (MReBa 2015), co-located with ER 2015, pp. 236-247. Stockholm, Sweden,oct,2015.
    ID
    DOI: 10.1007/978-3-319-25747-1_24
    Abstract
    In order to develop secure information systems with less development cost, it is important to elicit the requirements to security functions (simply security requirements) as early in their development process as possible. To achieve it, accumulated knowledge of threats and their objectives obtained from practical experiences is useful, and the technique to support the elicitation of security requirements utilizing this knowledge should be developed. In this paper, we present the technique for security requirements elicitation using practical knowledge of threats, their objectives and security functions realizing the objectives, which is extracted from Security Target documents compliant to the standard Common Criteria. We show the usefulness of our approach with several case studies.
    Slide
    BibTeX
    @inproceedings{abe-mreba2015,
        author = {Tatsuya Abe and Shinpei Hayashi and Motoshi Saeki},
        title = {Modeling and Utilizing Security Knowledge for Eliciting Security Requirements},
        booktitle = {Proceedings of the 2nd International Workshop on Conceptual Modeling in Requirements and Business Analysis},
        pages = {236--247},
        year = 2015,
        month = {oct},
    }
    [abe-mreba2015]: as a page
  19. Haruhiko Kaiya, Shinpei Ogata, Shinpei Hayashi, Motoshi Saeki, Takao Okubo, Nobukazu Yoshioka, Hironori Washizaki, Atsuo Hazeyama:"Finding Potential Threats in Several Security Targets for Eliciting Security Requirements".In Proceedings of the 10th International Multi-Conference on Computing in the Global Information Technology (ICCGI 2015), pp. 83-92. St. Julians, Malta,oct,2015.
    URL
    https://www.thinkmind.org/download.php?articleid=iccgi_2015_4_10_10050
    Abstract
    Threats to existing systems help requirements analysts to elicit security requirements for a new system similar to such systems because security requirements specify how to protect the system against threats and similar systems require similar means for protection. We propose a method of finding potential threats that can be used for eliciting security requirements for such a system. The method enables analysts to find additional security requirements when they have already elicited one or a few threats. The potential threats are derived from several security targets (STs) in the Common Criteria. An ST contains knowledge related to security requirements such as threats and objectives. It also contains their explicit relationships. In addition, individual objectives are explicitly related to the set of means for protection, which are commonly used in any STs. Because we focus on such means to find potential threats, our method can be applied to STs written in any languages, such as English or French. We applied and evaluated our method to three different domains. In our evaluation, we enumerated all threat pairs in each domain. We then predicted whether a threat and another in each pair respectively threaten the same requirement according to the method. The recall of the prediction was more than 70% and the precision was 20 to 40% in three domains.
    BibTeX
    @inproceedings{kaiya-iccgi2015,
        author = {Haruhiko Kaiya and Shinpei Ogata and Shinpei Hayashi and Motoshi Saeki and Takao Okubo and Nobukazu Yoshioka and Hironori Washizaki and Atsuo Hazeyama},
        title = {Finding Potential Threats in Several Security Targets for Eliciting Security Requirements},
        booktitle = {Proceedings of the 10th International Multi-Conference on Computing in the Global Information Technology},
        pages = {83--92},
        year = 2015,
        month = {oct},
    }
    [kaiya-iccgi2015]: as a page
  20. Ryotaro Nakamura, Yu Negishi, Shinpei Hayashi, Motoshi Saeki:"Terminology Matching of Requirements Specification Documents and Regulations for Consistency Checking".In Proceedings of the 8th International Workshop on Requirements Engineering and Law (RELAW 2015), co-located with RE'15, pp. 10-18. Ottawa, Canada,aug,2015.
    ID
    DOI: 10.1109/RELAW.2015.7330206
    Abstract
    To check the consistency between requirements specification documents and regulations by using a model checking technique, requirements analysts generate inputs to the model checker, i.e., state transition machines from the documents and logical formulas from the regulatory statements to be verified as properties. During these generation processes, to make the logical formulas semantically correspond to the state transition machine, analysts should take terminology matching where they look for the words in the requirements document having the same meaning as the words in the regulatory statements and unify the semantically same words. In this paper, by using case grammar approach, we propose an automated technique to reason the meaning of words in requirements specification documents by means of cooccurrence constraints on words in case frames, and to generate from regulatory statements the logical formulas where the words are unified to the words of the requirements documents. We have a feasibility study of our proposal with two case studies.
    Slide
    BibTeX
    @inproceedings{nakamura-relaw2015,
        author = {Ryotaro Nakamura and Yu Negishi and Shinpei Hayashi and Motoshi Saeki},
        title = {Terminology Matching of Requirements Specification Documents and Regulations for Consistency Checking},
        booktitle = {Proceedings of the 8th International Workshop on Requirements Engineering and Law},
        pages = {10--18},
        year = 2015,
        month = {aug},
    }
    [nakamura-relaw2015]: as a page
  21. Jumpei Matsuda, Shinpei Hayashi, Motoshi Saeki:"Hierarchical Categorization of Edit Operations for Separately Committing Large Refactoring Results".In Proceedings of the 14th International Workshop on Principles of Software Evolution (IWPSE 2015), co-located with ESEC/FSE 2015, pp. 19-27. Bergamo, Italy,aug,2015.
    ID
    DOI: 10.1145/2804360.2804363
    Abstract
    In software configuration management using a version control system, developers have to follow the commit policy of the project. However, preparing changes according to the policy are sometimes cumbersome and time-consuming, in particular when applying large refactoring consisting of multiple primitive refactoring instances. In this paper, we propose a technique for re-organizing changes by recording editing operations of source code. Editing operations including refactoring operations are hierarchically managed based on their types provided by an integrated development environment. Using the obtained hierarchy, developers can easily configure the granularity of changes and obtain the resulting changes based on the configured granularity. We confirmed the feasibility of the technique by applying it to the recorded changes in a large refactoring process.
    BibTeX
    @inproceedings{jmatsu-iwpse2015,
        author = {Jumpei Matsuda and Shinpei Hayashi and Motoshi Saeki},
        title = {Hierarchical Categorization of Edit Operations for Separately Committing Large Refactoring Results},
        booktitle = {Proceedings of the 14th International Workshop on Principles of Software Evolution},
        pages = {19--27},
        year = 2015,
        month = {aug},
    }
    [jmatsu-iwpse2015]: as a page
  22. Wataru Inoue, Shinpei Hayashi, Haruhiko Kaiya, Motoshi Saeki:"Multi-Dimensional Goal Refinement in Goal-Oriented Requirements Engineering".In Proceedings of the 10th International Conference on Software Engineering and Applications (ICSOFT-EA 2015), pp. 185-195. Colmar, Alsace, France,jul,2015.
    ID
    DOI: 10.5220/0005499301850195
    Abstract
    In this paper, we propose a multi-dimensional extension of goal graphs in goal-oriented requirements engineering in order to support the understanding the relations between goals, i.e., goal refinements. Goals specify multiple concerns such as functions, strategies, and non-functions, and they are refined into sub goals from mixed views of these concerns. This intermixture of concerns in goals makes it difficult for a requirements analyst to understand and maintain goal graphs. In our approach, a goal graph is put in a multi-dimensional space, a concern corresponds to a coordinate axis in this space, and goals are refined into sub goals referring to the coordinates. Thus, the meaning of a goal refinement is explicitly provided by means of the coordinates used for the refinement. By tracing and focusing on the coordinates of goals, requirements analysts can understand goal refinements and modify unsuitable ones. We have developed a supporting tool and made an exploratory experiment to evaluate the usefulness of our approach.
    BibTeX
    @inproceedings{inouew-icsoft2015,
        author = {Wataru Inoue and Shinpei Hayashi and Haruhiko Kaiya and Motoshi Saeki},
        title = {Multi-Dimensional Goal Refinement in Goal-Oriented Requirements Engineering},
        booktitle = {Proceedings of the 10th International Conference on Software Engineering and Applications},
        pages = {185--195},
        year = 2015,
        month = {jul},
    }
    [inouew-icsoft2015]: as a page
  23. Yoshiki Higo, Akio Ohtani, Shinpei Hayashi, Hideaki Hata, Shinji Kusumoto:"Toward Reusing Code Changes".In Proceedings of the 12th Working Conference on Mining Software Repositories (MSR 2015), pp. 372-376. Florence, Italy,may,2015.
    ID
    DOI: 10.1109/MSR.2015.43
    Abstract
    Existing techniques have succeeded to help developers implement new code. However, they are insufficient to help to change existing code. Previous studies have proposed techniques to support bug fixes but other kinds of code changes such as function enhancements and refactorings are not supported by them. In this paper, we propose a novel system that helps developers change existing code. Unlike existing techniques, our system can support any kinds of code changes if similar code changes occurred in the past. Our research is still on very early stage and we have not have any implementation or any prototype yet. This paper introduces our research purpose, an outline of our system, and how our system is different from existing techniques.
    BibTeX
    @inproceedings{higo-msr2015,
        author = {Yoshiki Higo and Akio Ohtani and Shinpei Hayashi and Hideaki Hata and Shinji Kusumoto},
        title = {Toward Reusing Code Changes},
        booktitle = {Proceedings of the 12th Working Conference on Mining Software Repositories},
        pages = {372--376},
        year = 2015,
        month = {may},
    }
    [higo-msr2015]: as a page
  24. Shinpei Hayashi, Daiki Hoshino, Jumpei Matsuda, Motoshi Saeki, Takayuki Omori, Katsuhisa Maruyama:"Historef: A Tool for Edit History Refactoring".In Proceedings of the 22nd IEEE International Conference on Software Analysis, Evolution, and Reengineering (SANER 2015), Tool Demo Track, pp. 469-473. Montréal, Canada,mar,2015.
    ID
    DOI: 10.1109/SANER.2015.7081858
    Abstract
    This paper presents Historef, a tool for automatin edit history refactoring on Eclipse IDE for Java programs. The aim of our history refactorings is to improve the understandability and/or usability of the history without changing its whole effect. Historef enables us to apply history refactorings to the recorded edit history in the middle of the source code editing process by a developer. By using our integrated tool, developers can commit the refactored edits into underlying SCM repository after applying edit history refactorings so that they are easy to manage their changes based on the performed edits.
    Slide
    BibTeX
    @inproceedings{hayashi-saner2015,
        author = {Shinpei Hayashi and Daiki Hoshino and Jumpei Matsuda and Motoshi Saeki and Takayuki Omori and Katsuhisa Maruyama},
        title = {Historef: A Tool for Edit History Refactoring},
        booktitle = {Proceedings of the 22nd IEEE International Conference on Software Analysis, Evolution, and Reengineering},
        pages = {469--473},
        year = 2015,
        month = {mar},
    }
    [hayashi-saner2015]: as a page
  25. Shinpei Hayashi, Takashi Ishio, Hiroshi Kazato, Tsuyoshi Oshima:"Toward Understanding How Developers Recognize Features in Source Code from Descriptions".In Proceedings of the 9th International Workshop on Advanced Modularization Techniques (AOAsia/Pacific 2014), co-located with FSE 2014, pp. 1-3. Hong Kong, China,nov,2014.
    ID
    DOI: 10.1145/2666358.2666578
    Abstract
    A basic clue of feature location available to developers is a description of a feature written in a natural language. However, a description of a feature does not clearly specify the boundary of the feature, while developers tend to locate the feature precisely by excluding marginal modules that are likely outside of the boundary. This paper addresses a question: does a clearer description of a feature enable developers to recognize the same sets of modules as relevant to the feature? Based on the conducted experiment with subjects, we conclude that different descriptions lead to a different set of modules.
    Slide
    BibTeX
    @inproceedings{hayashi-aoasia2014,
        author = {Shinpei Hayashi and Takashi Ishio and Hiroshi Kazato and Tsuyoshi Oshima},
        title = {Toward Understanding How Developers Recognize Features in Source Code from Descriptions},
        booktitle = {Proceedings of the 9th International Workshop on Advanced Modularization Techniques},
        pages = {1--3},
        year = 2014,
        month = {nov},
    }
    [hayashi-aoasia2014]: as a page
  26. Shinpei Hayashi, Takuto Yanagida, Motoshi Saeki, Hidenori Mimura:"Class Responsibility Assignment as Fuzzy Constraint Satisfaction".In Proceedings of the 6th International Workshop on Empirical Software Engineering in Practice (IWESEP 2014), pp. 19-24. Osaka, Japan,nov,2014.
    ID
    DOI: 10.1109/IWESEP.2014.13
    Abstract
    We formulate the class responsibility assignment (CRA) problem as the fuzzy constraint satisfaction problem (FCSP) for automating CRA of high quality. Responsibilities are contracts or obligations of objects that they should assume, by aligning them to classes appropriately, quality designs realize. Typical conditions of a desirable design are having a low coupling between highly cohesive classes. However, because of a trade-off among such conditions, solutions that satisfy the conditions moderately are desired, and computer assistance is needed. Additionally, if we have an initial assignment, the improved one by our technique should keep the original assignment as much as possible because it involves with the intention of human designers. We represent such conditions as fuzzy constraints, and formulate CRA as FCSP. That enables us to apply common FCSP solvers to the problem and to derive solution representing a CRA. The conducted preliminary evaluation indicates the effectiveness of our technique.
    Slide
    BibTeX
    @inproceedings{hayashi-iwesep2014,
        author = {Shinpei Hayashi and Takuto Yanagida and Motoshi Saeki and Hidenori Mimura},
        title = {Class Responsibility Assignment as Fuzzy Constraint Satisfaction},
        booktitle = {Proceedings of the 6th International Workshop on Empirical Software Engineering in Practice},
        pages = {19--24},
        year = 2014,
        month = {nov},
    }
    [hayashi-iwesep2014]: as a page
  27. Katsuhisa Maruyama, Takayuki Omori, Shinpei Hayashi:"A Visualization Tool Recording Historical Data of Program Comprehension Tasks".In Proceedings of the 22nd International Conference on Program Comprehension (ICPC 2014), Tool Demo Track, pp. 207-211. Hyderabad, India,jun,2014.
    ID
    DOI: 10.1145/2597008.2597802
    Abstract
    Software visualization has become a major technique in program comprehension. Although many tools visualize the structure, behavior, and evolution of a program, they have no concern with how a tool user has understood it. Moreover, they miss the stuff the user has left through trial-and-error processes of his/her program comprehension task. This paper presents a source code visualization tool called CodeForest. It uses a forest metaphor to depict source code of Java programs. Each tree represents a class within the program and the collection of trees constitutes a three-dimensional forest. CodeForest helps a user to try a large number of combinations of mapping of software metrics on visual parameters. Moreover, it provides two new types of support: leaving notes that memorize the current understanding and insight along with visualized objects, and automatically recording a user's actions under understanding. The left notes and recorded actions might be used as historical data that would be hints accelerating the current comprehension task.
    BibTeX
    @inproceedings{maruyama-icpc2014,
        author = {Katsuhisa Maruyama and Takayuki Omori and Shinpei Hayashi},
        title = {A Visualization Tool Recording Historical Data of Program Comprehension Tasks},
        booktitle = {Proceedings of the 22nd International Conference on Program Comprehension},
        pages = {207--211},
        year = 2014,
        month = {jun},
    }
    [maruyama-icpc2014]: as a page
  28. Hiroshi Kazato, Shinpei Hayashi, Tsuyoshi Oshima, Shunsuke Miyata, Takashi Hoshino, Motoshi Saeki:"Extracting and Visualizing Implementation Structure of Features".In Proceedings of the 20th Asia-Pacific Software Engineering Conference (APSEC 2013), pp. 476-484. Bangkok, Thailand,dec,2013.
    ID
    DOI: 10.1109/APSEC.2013.69
    Abstract
    Feature location is an activity to identify correspondence between features in a system and program elements in source code. After a feature is located, developers need to understand implementation structure around the location from static and/or behavioral points of view. This paper proposes a semi-automatic technique both for locating features and exposing their implementation structures in source code, using a combination of dynamic analysis and two data analysis techniques, sequential pattern mining and formal concept analysis. We have implemented our technique in a supporting tool and applied it to an example of a web application. The result shows that the proposed technique is not only feasible but helpful to understand implementation of features just after they are located.
    BibTeX
    @inproceedings{kazato-apsec2013,
        author = {Hiroshi Kazato and Shinpei Hayashi and Tsuyoshi Oshima and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki},
        title = {Extracting and Visualizing Implementation Structure of Features},
        booktitle = {Proceedings of the 20th Asia-Pacific Software Engineering Conference},
        pages = {476--484},
        year = 2013,
        month = {dec},
    }
    [kazato-apsec2013]: as a page
  29. Tatsuya Abe, Shinpei Hayashi, Motoshi Saeki:"Modeling Security Threat Patterns to Derive Negative Scenarios".In Proceedings of the 20th Asia-Pacific Software Engineering Conference (APSEC 2013), pp. 58-66. Bangkok, Thailand,dec,2013.
    ID
    DOI: 10.1109/APSEC.2013.19
    Abstract
    The elicitation of security requirements is a crucial issue to develop secure business processes and information systems of higher quality. Although we have several methods to elicit security requirements, most of them do not provide sufficient supports to identify security threats. Since threats do not occur so frequently, like exceptional events, it is much more difficult to determine the potentials of threats exhaustively rather than identifying normal behavior of a business process. To reduce this difficulty, accumulated knowledge of threats obtained from practical setting is necessary. In this paper, we present the technique to model knowledge of threats as patterns by deriving the negative scenarios that realize threats and to utilize them during business process modeling. The knowledge is extracted from Security Target documents, based on the international Common Criteria Standard, and the patterns are described with transformation rules on sequence diagrams. In our approach, an analyst composes normal scenarios of a business process with sequence diagrams, and the threat patterns matched to them derives negative scenarios. Our approach has been demonstrated on several examples, to show its practical application.
    BibTeX
    @inproceedings{abe-apsec2013,
        author = {Tatsuya Abe and Shinpei Hayashi and Motoshi Saeki},
        title = {Modeling Security Threat Patterns to Derive Negative Scenarios},
        booktitle = {Proceedings of the 20th Asia-Pacific Software Engineering Conference},
        pages = {58--66},
        year = 2013,
        month = {dec},
    }
    [abe-apsec2013]: as a page
  30. Takashi Ishio, Shinpei Hayashi, Hiroshi Kazato, Tsuyoshi Oshima:"On the Effectiveness of Accuracy of Automated Feature Location Technique".In Proceedings of the 20th Working Conference on Reverse Engineering (WCRE 2013), pp. 381-390. Koblenz-Landau, Germany,oct,2013.
    ID
    DOI: 10.1109/WCRE.2013.6671313
    Abstract
    Automated feature location techniques have been proposed to extract program elements that are likely to be relevant to a given feature. A more accurate result is expected to enable developers to perform more accurate feature location. However, several experiments assessing traceability recovery have shown that analysts cannot utilize an accurate traceability matrix for their tasks. Because feature location deals with a certain type of traceability links, it is an important question whether the same phenomena are visible in feature location or not. To answer that question, we have conducted a controlled experiment. We have asked 20 subjects to locate features using lists of methods of which the accuracy is controlled artificially. The result differs from the traceability recovery experiments. Subjects given an accurate list would be able to locate a feature more accurately. However, subjects could not locate the complete implementation of features in 83% of tasks. Results show that the accuracy of automated feature location techniques is effective, but it might be insufficient for perfect feature location.
    BibTeX
    @inproceedings{ishio-wcre2013,
        author = {Takashi Ishio and Shinpei Hayashi and Hiroshi Kazato and Tsuyoshi Oshima},
        title = {On the Effectiveness of Accuracy of Automated Feature Location Technique},
        booktitle = {Proceedings of the 20th Working Conference on Reverse Engineering},
        pages = {381--390},
        year = 2013,
        month = {oct},
    }
    [ishio-wcre2013]: as a page
  31. Shinpei Hayashi, Sirinut Thangthumachit, Motoshi Saeki:"REdiffs: Refactoring-Aware Difference Viewer for Java".In Proceedings of the 20th Working Conference on Reverse Engineering (WCRE 2013), Tool Demonstrations Track, pp. 487-488. Koblenz-Landau, Germany,oct,2013.
    ID
    DOI: 10.1109/WCRE.2013.6671331
    Abstract
    Comparing and understanding differences between old and new versions of source code are necessary in various software development situations. However, if changes are tangled with refactorings in a single revision, then the resulting source code differences are more complicated. We propose an interactive difference viewer which enables us to separate refactoring effects from source code differences for improving the understandability of the differences.
    BibTeX
    @inproceedings{hayashi-wcre2013,
        author = {Shinpei Hayashi and Sirinut Thangthumachit and Motoshi Saeki},
        title = {REdiffs: Refactoring-Aware Difference Viewer for Java},
        booktitle = {Proceedings of the 20th Working Conference on Reverse Engineering},
        pages = {487--488},
        year = 2013,
        month = {oct},
    }
    [hayashi-wcre2013]: as a page
  32. Hiroshi Kazato, Shinpei Hayashi, Takashi Kobayashi, Tsuyoshi Oshima, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, Motoshi Saeki:"Incremental Feature Location and Identification in Source Code".In Proceedings of the 17th European Conference on Software Maintenance and Reengineering (CSMR 2013), ERA Track, pp. 371-374. Genova, Italy,mar,2013.
    ID
    DOI: 10.1109/CSMR.2013.52
    Abstract
    Feature location (FL) in source code is an important task for program understanding. Existing dynamic FL techniques depend on sufficient scenarios for exercising the features to be located. However, it is difficult to prepare such scenarios because it involves a correct understanding of the features. This paper proposes an incremental technique for refining the identification of features integrated with the existing FL technique using formal concept analysis. In our technique, we classify the differences of static and dynamic dependencies of method invocations based on their relevance to the identified features. According to the classification, the technique suggests method invocations to exercise unexplored part of the features. An application example indicates the effectiveness of the approach.
    Slide
    BibTeX
    @inproceedings{kazato-csmr2013,
        author = {Hiroshi Kazato and Shinpei Hayashi and Takashi Kobayashi and Tsuyoshi Oshima and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki},
        title = {Incremental Feature Location and Identification in Source Code},
        booktitle = {Proceedings of the 17th European Conference on Software Maintenance and Reengineering},
        pages = {371--374},
        year = 2013,
        month = {mar},
    }
    [kazato-csmr2013]: as a page
  33. Haruhiko Kaiya, Shunsuke Morita, Shinpei Ogata, Kenji Kaijiri, Shinpei Hayashi, Motoshi Saeki:"Model Transformation Patterns for Introducing Suitable Information Systems".In Proceedings of the 19th Asia-Pacific Software Engineering Conference (APSEC 2012), pp. 434-439. Hong Kong,dec,2012.
    ID
    DOI: 10.1109/APSEC.2012.52
    Abstract
    When information systems are introduced in a social setting such as a business, the systems will give bad and good impacts on stakeholders in the setting. Requirements analysts have to predict such impacts in advance because stakeholders cannot decide whether the systems are really suitable for them without such prediction. In this paper, we propose a method based on model transformation patterns for introducing suitable information systems. We use metrics of a model to predict whether a system introduction is suitable for a social setting. Through a case study, we show our method can avoid an introduction of a system, which was actually bad for some stakeholders. In the case study, we use a strategic dependency model in i* to specify the model of systems and stakeholders, and attributed graph grammar for model transformation. We focus on the responsibility and the satisfaction of stakeholders as the criteria for suitability about systems introduction in this case study.
    BibTeX
    @inproceedings{kaiya-apsec2012,
        author = {Haruhiko Kaiya and Shunsuke Morita and Shinpei Ogata and Kenji Kaijiri and Shinpei Hayashi and Motoshi Saeki},
        title = {Model Transformation Patterns for Introducing Suitable Information Systems},
        booktitle = {Proceedings of the 19th Asia-Pacific Software Engineering Conference},
        pages = {434--439},
        year = 2012,
        month = {dec},
    }
    [kaiya-apsec2012]: as a page
  34. Teppei Kato, Shinpei Hayashi, Motoshi Saeki:"Cutting a Method Call Graph for Supporting Feature Location".In Proceedings of the 4th International Workshop on Empirical Software Engineering in Practice (IWESEP 2012), pp. 55-57. Osaka, Japan,oct,2012.
    ID
    DOI: 10.1109/IWESEP.2012.17
    Abstract
    This paper proposes a technique for locating the implementation of features by combining techniques of a graph cut and a formal concept analysis based on methods and scenarios.
    BibTeX
    @inproceedings{kato-iwesep2012,
        author = {Teppei Kato and Shinpei Hayashi and Motoshi Saeki},
        title = {Cutting a Method Call Graph for Supporting Feature Location},
        booktitle = {Proceedings of the 4th International Workshop on Empirical Software Engineering in Practice},
        pages = {55--57},
        year = 2012,
        month = {oct},
    }
    [kato-iwesep2012]: as a page
  35. Shinpei Hayashi, Takayuki Omori, Teruyoshi Zenmyo, Katsuhisa Maruyama, Motoshi Saeki:"Refactoring Edit History of Source Code".In Proceedings of the 28th IEEE International Conference on Software Maintenance (ICSM 2012), ERA Track, pp. 617-620. Riva del Garda, Trento, Italy,sep,2012.
    ID
    DOI: 10.1109/ICSM.2012.6405336
    Abstract
    This paper proposes a concept for refactoring an edit history of source code and a technique for its automation. The aim of our history refactoring is to improve the clarity and usefulness of the history without changing its overall effect. We have defined primitive history refactorings including their preconditions and procedures, and large refactorings composed of these primitives. Moreover, we have implemented a supporting tool that automates the application of history refactorings in the middle of a source code editing process. Our tool enables developers to pursue some useful applications using history refactorings such as task level commit from an entangled edit history and selective undo of past edit operations.
    Slide
    BibTeX
    @inproceedings{hayashi-icsm2012,
        author = {Shinpei Hayashi and Takayuki Omori and Teruyoshi Zenmyo and Katsuhisa Maruyama and Motoshi Saeki},
        title = {Refactoring Edit History of Source Code},
        booktitle = {Proceedings of the 28th IEEE International Conference on Software Maintenance},
        pages = {617--620},
        year = 2012,
        month = {sep},
    }
    [hayashi-icsm2012]: as a page
  36. Katsuhisa Maruyama, Eijiro Kitsu, Takayuki Omori, Shinpei Hayashi:"Slicing and Replaying Code Change History".In Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering (ASE 2012), Short paper session, pp. 246-249. Essen, Germany,sep,2012.
    ID
    DOI: 10.1145/2351676.2351713
    Abstract
    Change-aware development environments have recently become feasible and reasonable. These environments can automatically record fine-grained code changes on a program and allow programmers to replay the recorded changes in chronological order. However, they do not always need to replay all the code changes to investigate how a particular entity of the program has been changed. Therefore, they often skip several code changes of no interest. This skipping action is an obstacle that makes many programmers hesitate in using existing replaying tools. This paper proposes a slicing mechanism that can extract only code changes necessary to construct a particular class member of a Java program from the whole history of past code changes. In this mechanism, fine-grained code changes are represented by edit operations recorded on source code of a program. The paper also presents a running tool that implements the proposed slicing and replays its resulting slices. With this tool, programmers can avoid replaying edit operations nonessential to the construction of class members they want to understand.
    BibTeX
    @incollection{maruyama-ase2012,
        author = {Katsuhisa Maruyama and Eijiro Kitsu and Takayuki Omori and Shinpei Hayashi},
        title = {Slicing and Replaying Code Change History},
        booktitle = {Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering},
        pages = {246--249},
        year = 2012,
        month = {sep},
    }
    [maruyama-ase2012]: as a page
  37. Haruhiko Kaiya, Shunsuke Morita, Kenji Kaijiri, Shinpei Hayashi, Motoshi Saeki:"Facilitating Business Improvement by Information Systems using Model Transformation and Metrics".In Proceedings of the CAiSE'12 Forum at the 24th International Conference on Advanced Information Systems Engineering (CAiSE 2012), pp. 106-113. Gdańsk, Poland,jun,2012.
    URL
    http://ceur-ws.org/Vol-855/paper13.pdf
    Abstract
    We propose a method to explore how to improve business by introducing information systems. We use a meta-modeling technique to specify the business itself and its metrics. The metrics are defined based on the structural information of the business model, so that they can help us to identify whether the business is good or not with respect to several different aspects. We also use a model transformation technique to specify an idea of the business improvement. The metrics help us to predict whether the improvement idea makes the business better or not. We use strategic dependency (SD) models in i* to specify the business, and attributed graph grammar (AGG) for the model transformation.
    BibTeX
    @inproceedings{kaiya-caise2012,
        author = {Haruhiko Kaiya and Shunsuke Morita and Kenji Kaijiri and Shinpei Hayashi and Motoshi Saeki},
        title = {Facilitating Business Improvement by Information Systems using Model Transformation and Metrics},
        booktitle = {Proceedings of the CAiSE'12 Forum at the 24th International Conference on Advanced Information Systems Engineering},
        pages = {106--113},
        year = 2012,
        month = {jun},
    }
    [kaiya-caise2012]: as a page
  38. Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, Motoshi Saeki:"Toward Structured Location of Features".In Proceedings of the 20th IEEE International Conference on Program Comprehension (ICPC 2012), Poster Session, pp. 255-256. Passau, Germany,jun,2012.
    ID
    DOI: 10.1109/ICPC.2012.6240497
    Abstract
    This paper proposes structured location, a semiautomatic technique and its supporting tool both for locating features and exposing their structures in source code, using a combination of dynamic analysis, sequential pattern mining and formal concept analysis.
    Slide
    BibTeX
    @inproceedings{kazato-icpc2012,
        author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki},
        title = {Toward Structured Location of Features},
        booktitle = {Proceedings of the 20th IEEE International Conference on Program Comprehension},
        pages = {255--256},
        year = 2012,
        month = {jun},
    }
    [kazato-icpc2012]: as a page
  39. Hiroshi Kazato, Shinpei Hayashi, Satoshi Okada, Shunsuke Miyata, Takashi Hoshino, Motoshi Saeki:"Feature Location for Multi-Layer System Based on Formal Concept Analysis".In Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR 2012), pp. 429-434. Szeged, Hungary,mar,2012.
    ID
    DOI: 10.1109/CSMR.2012.54
    Abstract
    Locating features in software composed of multiple layers is a challenging problem because we have to find program elements distributed over layers, which still work together to constitute a feature. This paper proposes a semi-automatic technique to extract correspondence between features and program elements among layers. By merging execution traces of each layer to feed into formal concept analysis, collaborative program elements are grouped into formal concepts and tied with a set of execution scenarios. We applied our technique to an example of web application composed of three layers. The result indicates that our technique is not only feasible but promising to promote program understanding in a more realistic context.
    Slide
    BibTeX
    @inproceedings{kazato-csmr2012,
        author = {Hiroshi Kazato and Shinpei Hayashi and Satoshi Okada and Shunsuke Miyata and Takashi Hoshino and Motoshi Saeki},
        title = {Feature Location for Multi-Layer System Based on Formal Concept Analysis},
        booktitle = {Proceedings of the 16th European Conference on Software Maintenance and Reengineering},
        pages = {429--434},
        year = 2012,
        month = {mar},
    }
    [kazato-csmr2012]: as a page
  40. Sirinut Thangthumachit, Shinpei Hayashi, Motoshi Saeki:"Understanding Source Code Differences by Separating Refactoring Effects".In Proceedings of the 18th Asia Pacific Software Engineering Conference (APSEC 2011), pp. 339-347. Ho Chi Minh city, Vietnam,dec,2011.
    ID
    DOI: 10.1109/APSEC.2011.47
    Abstract
    Comparing and understanding differences between old and new versions of source code are necessary in various software development situations. However, if refactoring is applied between those versions, then the source code differences are more complicated, and understanding them becomes more difficult. Although many techniques for extracting refactoring effects from the differences have been studied, it is necessary to exclude the extracted refactorings' effects and reconstruct the differences for meaningful and understandable ones with no refactoring effect. As described in this paper, we propose a novel technique to address this difficulty. Using our technique, we extract the refactoring effects and then apply them to the old version of source code to produce the differences without refactoring effects. We also implemented a support tool that helps separate refactorings automatically. An evaluation of open source software showed that our tool is applicable to all target refactorings. Our technique is therefore useful in real situations. Evaluation testing also demonstrated that the approach reduced the code differences more than 21\%, on average, and that developers can understand more changes from the differences using our approach than when using the original one in the same limited time.
    Slide
    BibTeX
    @inproceedings{zui-apsec2011,
        author = {Sirinut Thangthumachit and Shinpei Hayashi and Motoshi Saeki},
        title = {Understanding Source Code Differences by Separating Refactoring Effects},
        booktitle = {Proceedings of the 18th Asia Pacific Software Engineering Conference},
        pages = {339--347},
        year = 2011,
        month = {dec},
    }
    [zui-apsec2011]: as a page
  41. Motohiro Akiyama, Shinpei Hayashi, Takashi Kobayashi, Motoshi Saeki:"Supporting Design Model Refactoring for Improving Class Responsibility Assignment".In Proceedings of the ACM/IEEE 14th International Conference on Model Driven Engineering Languages and Systems (MODELS 2011), Lecture Notes in Computer Science, vol. 6981, pp. 455-469. Wellington, New Zealand,oct,2011.
    ID
    DOI: 10.1007/978-3-642-24485-8_33
    Abstract
    Although a responsibility driven approach in object oriented analysis and design methodologies is promising, the assignment of the identified responsibilities to classes (simply, class responsibility assignment: CRA) is a crucial issue to achieve design of higher quality. The GRASP by Larman is a guideline for CRA and is being put into practice. However, since it is described in an informal way using a natural language, its successful usage greatly relies on designers' skills. This paper proposes a technique to represent GRASP formally and to automate appropriate CRA based on them. Our computerized tool automatically detects inappropriate CRA and suggests alternatives of appropriate CRAs to designers so that they can improve a CRA based on the suggested alternatives. We made preliminary experiments to show the usefulness of our tool.
    Slide
    BibTeX
    @inproceedings{akiyama-models2011,
        author = {Motohiro Akiyama and Shinpei Hayashi and Takashi Kobayashi and Motoshi Saeki},
        title = {Supporting Design Model Refactoring for Improving Class Responsibility Assignment},
        booktitle = {Proceedings of the ACM/IEEE 14th International Conference on Model Driven Engineering Languages and Systems},
        pages = {455--469},
        year = 2011,
        month = {oct},
    }
    [akiyama-models2011]: as a page
  42. Shinpei Hayashi, Takashi Yoshikawa, Motoshi Saeki:"Sentence-to-Code Traceability Recovery with Domain Ontologies".In Proceedings of the 17th Asia Pacific Software Engineering Conference (APSEC 2010), pp. 385-394. Sydney, Australia,nov,2010.
    ID
    DOI: 10.1109/APSEC.2010.51
    Abstract
    We propose an ontology-based technique for recovering traceability links between a natural language sentence specifying features of a software product and the source code of the product. Some software products have been released without detailed documentation. To automatically detect code fragments associated with sentences describing a feature, the relations between source code structures and problem domains are important. We model the knowledge of the problem domains as domain ontologies having concepts of the domains and their relations. Using semantic relations on the ontologies in addition to method invocation relations and the similarity between an identifier on the code and words in the sentences, we locate the code fragments corresponding to the given sentences. Additionally, our prioritization mechanism which orders the located results of code fragments based on the ontologies enables users to select and analyze the results effectively. To show effectiveness of our approach in terms of accuracy, a case study was carried out with our proof-ofconcept tool and summarized.
    Slide
    BibTeX
    @inproceedings{hayashi-apsec2010,
        author = {Shinpei Hayashi and Takashi Yoshikawa and Motoshi Saeki},
        title = {Sentence-to-Code Traceability Recovery with Domain Ontologies},
        booktitle = {Proceedings of the 17th Asia Pacific Software Engineering Conference},
        pages = {385--394},
        year = 2010,
        month = {nov},
    }
    [hayashi-apsec2010]: as a page
  43. Shinpei Hayashi, Motoshi Saeki:"Recording Finer-Grained Software Evolution with IDE: An Annotation-Based Approach".In Proceedings of the 4th International Joint ERCIM/IWPSE Symposium on Software Evolution (IWPSE-EVOL 2010), co-located with ASE 2010, pp. 8-12. Antwerp, Belgium,sep,2010.
    ID
    DOI: 10.1145/1862372.1862378
    ISBN: 978-1-4503-0128-2
    Abstract
    This paper proposes a formalized technique for generating finer-grained source code deltas according to a developer's editing intentions. Using the technique, the developer classifies edit operations of source code by annotating the time series of the edit history with the switching information of their editing intentions. Based on the classification, the history is sorted and converted automatically to appropriate source code deltas to be committed separately to a version repository. This paper also presents algorithms for automating the generation process and a prototyping tool to implement them.
    Slide
    BibTeX
    @inproceedings{hayashi-iwpse-evol2010,
        author = {Shinpei Hayashi and Motoshi Saeki},
        title = {Recording Finer-Grained Software Evolution with {IDE}: An Annotation-Based Approach},
        booktitle = {Proceedings of the 4th International Joint ERCIM/IWPSE Symposium on Software Evolution},
        pages = {8--12},
        year = 2010,
        month = {sep},
    }
    [hayashi-iwpse-evol2010]: as a page
  44. Shinpei Hayashi, Katsuyuki Sekine, Motoshi Saeki:"iFL: An Interactive Environment for Understanding Feature Implementations".In Proceedings of the 26th IEEE International Conference on Software Maintenance (ICSM 2010), ERA Track, pp. 1-5. Timisoara, Romania,sep,2010.
    ID
    DOI: 10.1109/ICSM.2010.5609669
    Abstract
    We propose iFL, an interactive environment that is useful for effectively understanding feature implementation by application of feature location (FL). With iFL, the inputs for FL are improved incrementally by interactions between users and the FL system. By understanding a code fragment obtained using FL, users can find more appropriate queries from the identifiers in the fragment. Furthermore, the relevance feedback obtained by partially judging whether or not a fragment is relevant improves the evaluation score of FL. Users can then obtain more accurate results. Case studies with iFL show that our interactive approach is feasible and that it can reduce the understanding cost more effectively than the non-interactive approach.
    Slide
    BibTeX
    @inproceedings{hayashi-icsm2010,
        author = {Shinpei Hayashi and Katsuyuki Sekine and Motoshi Saeki},
        title = {{iFL}: An Interactive Environment for Understanding Feature Implementations},
        booktitle = {Proceedings of the 26th IEEE International Conference on Software Maintenance},
        pages = {1--5},
        year = 2010,
        month = {sep},
    }
    [hayashi-icsm2010]: as a page
  45. Takanori Ugai, Shinpei Hayashi, Motoshi Saeki:"Visualizing Stakeholder Concerns with Anchored Map".In Proceedings of the 5th International Workshop on Requirements Engineering Visualization (REV 2010), co-located with RE 2010, pp. 20-24. Sydney, Australia,sep,2010.
    ID
    DOI: 10.1109/REV.2010.5625662
    Abstract
    Software development is a cooperative work by stakeholders. It is important for project managers and analysts to understand stakeholder concerns and to identify potential problems such as imbalance of stakeholders or lack of stakeholders.\\This paper presents a tool which visualizes the strength of stakeholders' interest of concern on two dimensional screens. The proposed tool generates an anchored map from an attributed goal graph by AGORA, which is an extended version of goal-oriented analysis methods. It has information on stakeholders' interest to concerns and its degree as the attributes of goals.\\Results from the case study are that (1) some concerns are not connected to any stakeholders and (2) a type of stakeholders is interested in different concerns each other. The results suggest that lack of stakeholders for the unconnected concerns and need that a type of stakeholders had better to unify their requirements.
    Slide
    BibTeX
    @inproceedings{ugai-rev2010,
        author = {Takanori Ugai and Shinpei Hayashi and Motoshi Saeki},
        title = {Visualizing Stakeholder Concerns with Anchored Map},
        booktitle = {Proceedings of the 5th International Workshop on Requirements Engineering Visualization},
        pages = {20--24},
        year = 2010,
        month = {sep},
    }
    [ugai-rev2010]: as a page
  46. Motoshi Saeki, Shinpei Hayashi, Haruhiko Kaiya:"An Integrated Support for Attributed Goal-Oriented Requirements Analysis Method and Its Implementation".In Proceedings of the 10th International Conference on Quality Software (QSIC 2010), pp. 357-360. jul,2010.
    ID
    DOI: 10.1109/QSIC.2010.19
    Abstract
    This paper presents an integrated supporting tool for Attributed Goal-Oriented Requirements Analysis (AGORA), which is an extended version of goal-oriented analysis. Our tool assists seamlessly requirements analysts and stakeholders in their activities throughout AGORA steps including constructing goal graphs with group work, utilizing domain ontologies for goal graph construction, detecting various types of conflicts among goals, prioritizing goals, analyzing impacts when modifying a goal graph, and version control of goal graphs.
    BibTeX
    @inproceedings{saeki-qsic2010,
        author = {Motoshi Saeki and Shinpei Hayashi and Haruhiko Kaiya},
        title = {An Integrated Support for Attributed Goal-Oriented Requirements Analysis Method and Its Implementation},
        booktitle = {Proceedings of the 10th International Conference on Quality Software},
        pages = {357--360},
        year = 2010,
        month = {jul},
    }
    [saeki-qsic2010]: as a page
  47. Motoshi Saeki, Shinpei Hayashi, Haruhiko Kaiya:"A Tool for Attributed Goal-Oriented Requirements Analysis".In Proceedings of the 24th IEEE/ACM International Conference on Automated Software Engineering (ASE 2009), pp. 670-672. Auckland, New Zealand,nov,2009.
    ID
    DOI: 10.1109/ASE.2009.34
    Abstract
    This paper presents an integrated supporting tool for Attributed Goal-Oriented Requirements Analysis (AGORA), which is an extended version of goal-oriented analysis. Our tool assists seamlessly requirements analysts and stakeholders in their activities throughout AGORA steps including constructing goal graphs with group work, prioritizing goals, and version control of goal graphs.
    BibTeX
    @inproceedings{saeki-ase2009,
        author = {Motoshi Saeki and Shinpei Hayashi and Haruhiko Kaiya},
        title = {A Tool for Attributed Goal-Oriented Requirements Analysis},
        booktitle = {Proceedings of the 24th IEEE/ACM International Conference on Automated Software Engineering},
        pages = {670--672},
        year = 2009,
        month = {nov},
    }
    [saeki-ase2009]: as a page
  48. Rodion Moiseev, Shinpei Hayashi, Motoshi Saeki:"Generating Assertion Code from OCL: A Transformational Approach Based on Similarities of Implementation Languages".In Proceedings of the ACM/IEEE 12th International Conference on Model Driven Engineering Languages and Systems (MODELS 2009), Lecture Notes in Computer Science, vol. 5795, pp. 650-664. Denver, Colorado, USA,oct,2009.
    ID
    DOI: 10.1007/978-3-642-04425-0_52
    Abstract
    The Object Constraint Language (OCL) carries a platform independent characteristic allowing it to be decoupled from implementation details, and therefore it is widely applied in model transformations used by model-driven development techniques. However, OCL can be found tremendously useful in the implementation phase aiding assertion code generation and allowing system verification. Yet, taking full advantage of OCL without destroying its platform independence is a difficult task. This paper proposes an approach for generating assertion code from OCL constraints by using a model transformation technique to abstract language specific details away from OCL high-level concepts, showing wide applicability of model transformation techniques. We take advantage of structural similarities of implementation languages to describe a rewriting framework, which is used to easily and flexibly reformulate OCL constraints into any target language, making them executable on any platform. A tool is implemented to demonstrate the effectiveness of this approach.
    Slide
    BibTeX
    @inproceedings{rodion-models2009,
        author = {Rodion Moiseev and Shinpei Hayashi and Motoshi Saeki},
        title = {Generating Assertion Code from OCL: A Transformational Approach Based on Similarities of Implementation Languages},
        booktitle = {Proceedings of the ACM/IEEE 12th International Conference on Model Driven Engineering Languages and Systems},
        pages = {650--664},
        year = 2009,
        month = {oct},
    }
    [rodion-models2009]: as a page
  49. Hiroshi Kazato, Rafael Weiss, Shinpei Hayashi, Takashi Kobayashi, Motoshi Saeki:"Model-View-Controller Architecture Specific Model Transformation".In Proceedings of the 9th OOPSLA Workshop on Domain-Specific Modeling (DSM 2009), co-located with OOPSLA 2009. Orlando, Florida, USA,oct,2009.
    Abstract
    In this paper, we propose a model-driven development technique specific to the Model-View-Controller architecture domain. Even though a lot of application frameworks and source code generators are available for implementing this architecture, they do depend on implementation specific concepts, which take much effort to learn and use them. To address this issue, we define a UML profile to capture architectural concepts directly in a model and provide a bunch of transformation mappings for each supported platform, in order to bridge between architectural and implementation concepts. By applying these model transformations together with source code generators, our MVC-based model can be mapped to various kind of platforms. Since we restrict a domain into MVC architecture only, automating model transformation to source code is possible. We have prototyped a supporting tool and evaluated feasibility of our approach through a case study. It demonstrates model transformations specific to MVC architecture can produce source code for two different platforms.
    BibTeX
    @inproceedings{kazato-dsm2009,
        author = {Hiroshi Kazato and Rafael Weiss and Shinpei Hayashi and Takashi Kobayashi and Motoshi Saeki},
        title = {Model-View-Controller Architecture Specific Model Transformation},
        booktitle = {Proceedings of the 9th OOPSLA Workshop on Domain-Specific Modeling},
        year = 2009,
        month = {oct},
    }
    [kazato-dsm2009]: as a page
  50. Takashi Yoshikawa, Shinpei Hayashi, Motoshi Saeki:"Recovering Traceability Links between a Simple Natural Language Sentence and Source Code Using Domain Ontologies".In Proceedings of the 25th International Conference on Software Maintenance (ICSM 2009), pp. 551-554. Edmonton, Canada,sep,2009.
    ID
    DOI: 10.1109/ICSM.2009.5306390
    URL
    https://sites.google.com/site/ieeeicsm09/
    Abstract
    This paper proposes an ontology-based technique for recovering traceability links between a natural language sentence specifying features of a software product and the source code of the product. Some software products have been released without detailed documentation. To automatically detect code fragments associated with the functional descriptions written in the form of simple sentences, the relationships between source code structures and problem domains are important. In our approach, we model the knowledge of the problem domains as domain ontologies. By using semantic relationships of the ontologies in addition to method invocation relationships and the similarity between an identifier on the code and words in the sentences, we can detect code fragments corresponding to the sentences. A case study within a domain of painting software shows that we obtained results of higher quality than without ontologies.
    BibTeX
    @inproceedings{yoshikawa-icsm2009,
        author = {Takashi Yoshikawa and Shinpei Hayashi and Motoshi Saeki},
        title = {Recovering Traceability Links between a Simple Natural Language Sentence and Source Code Using Domain Ontologies},
        booktitle = {Proceedings of the 25th International Conference on Software Maintenance},
        pages = {551--554},
        year = 2009,
        month = {sep},
    }
    [yoshikawa-icsm2009]: as a page
  51. Kohei Uno, Shinpei Hayashi, Motoshi Saeki:"Constructing Feature Models using Goal-Oriented Analysis".In Proceedings of the 9th International Conference on Quality Software (QSIC 2009), pp. 412-417. aug,2009.
    ID
    DOI: 10.1109/QSIC.2009.61
    Abstract
    This paper proposes a systematic approach to derive feature models required in a software product line development. In our approach, we use goal graphs constructed by goal-oriented requirements analysis. We merge multiple goal graphs into a graph, and then regarding the leaves of the merged graph as the candidates of features, identify their commonality and variability based on the achievability of product goals. Through a case study of a portable music player domain, we obtained a feature model with high quality.
    BibTeX
    @inproceedings{uno-qsic2009,
        author = {Kohei Uno and Shinpei Hayashi and Motoshi Saeki},
        title = {Constructing Feature Models using Goal-Oriented Analysis},
        booktitle = {Proceedings of the 9th International Conference on Quality Software},
        pages = {412--417},
        year = 2009,
        month = {aug},
    }
    [uno-qsic2009]: as a page
  52. Shinpei Hayashi, Yasuyuki Tsuda, Motoshi Saeki:"Detecting Occurrences of Refactoring with Heuristic Search".In Proceedings of the 15th Asia-Pacific Software Engineering Conference (APSEC 2008), pp. 453-460. Beijing, China,dec,2008.
    ID
    DOI: 10.1109/APSEC.2008.9
    ISSN: 1530-1362
    ISBN: 978-0-7695-3446-6
    Abstract
    This paper proposes a novel technique to detect the occurrences of refactoring from a version archive, in order to reduce the effort spent in understanding what modifications have been applied. In a real software development process, a refactoring operation may sometimes be performed together with other modifications at the same revision. This means that understanding the differences between two versions stored in the archive is not usually an easily process. In order to detect these impure refactorings, we model the detection within a graph search. Our technique considers a version of a program as a state and a refactoring as a transition. It then searches for the path that approaches from the initial to the final state. To improve the efficiency of the search, we use the source code differences between the current and the final state for choosing the candidates of refactoring to be applied next and estimating the heuristic distance to the final state. We have clearly demonstrated the feasibility of our approach through a case study.
    Slide
    BibTeX
    @inproceedings{hayashi-apsec2008,
        author = {Shinpei Hayashi and Yasuyuki Tsuda and Motoshi Saeki},
        title = {Detecting Occurrences of Refactoring with Heuristic Search},
        booktitle = {Proceedings of the 15th Asia-Pacific Software Engineering Conference},
        pages = {453--460},
        year = 2008,
        month = {dec},
    }
    [hayashi-apsec2008]: as a page
  53. Takeshi Obayashi, Shinpei Hayashi, Motoshi Saeki, Hiroyuki Ohta, Kengo Kinoshita:"Preperation and usage of gene coexpression data".In the 19th International Conference on Arabidopsis Research (ICAR 2008). Montreal, Canada,jun,2008.
    Abstract
    Gene coexpression provides key information to understand living systems because coexpressed genes are often involved in the same or related biological pathways. Coexpression data are now used for a wide variety of experimental designs, such as gene targeting, regulatory investigations and/or identification of potential partners in protein-protein interactions. We constructed two databases for Arabidopsis (ATTED-II, http://www.atted.bio.titech.ac.jp) and mammals (COXPRESdb, http://coxpresdb.hgc.jp). Based on pairwise gene coexpression, coexpressed gene networks were prepared in these databases. To support gene coexpression, known protein-protein interactions, common metabolic pathways and conserved coexpression were also represented on the networks. We used Google Maps API to visualize large networks interactively. The relationships of the coexpression database with other large-scale data will be discussed, in addition to data construction procedures and typical usages of coexpression data.
    BibTeX
    @misc{obayashi-icar2008,
        author = {Takeshi Obayashi and Shinpei Hayashi and Motoshi Saeki and Hiroyuki Ohta and Kengo Kinoshita},
        title = {Preperation and usage of gene coexpression data},
        howpublished = {In the 19th International Conference on Arabidopsis Research},
        year = 2008,
        month = {jun},
    }
    [obayashi-icar2008]: as a page
  54. Shinpei Hayashi, Motoshi Saeki:"Extracting Prehistories of Software Refactorings from Version Archives".In Large-Scale Knowledge Resources. Construction and Application - Proceedings of the 3rd International Conference on Large-Scale Knowledge Resources (LKR 2008), Lecture Notes in Artificial Intelligence, vol. 4938, pp. 82-89. Tokyo Institute of Technology (Ookayama Campus), Tokyo, Japan,mar,2008.
    ID
    DOI: 10.1007/978-3-540-78159-2_9
    Abstract
    This paper proposes an automated technique to extract prehistories of software refactorings from existing software version archives, which in turn a technique to discover knowledge for finding refactoring opportunities. We focus on two types of knowledge to extract: characteristic modification histories, and fluctuations of the values of complexity measures. First, we extract modified fragments of code by calculating the difference of the Abstract Syntax Trees in the programs picked up from an existing software repository. We also extract past cases of refactorings, and then we create traces of program elements by associating modified fragments with cases of refactorings for finding the structures that frequently occur. Extracted traces help us identify how and where to refactor programs, and it leads to improve the program design.
    BibTeX
    @inproceedings{hayashi-lkr2008,
        author = {Shinpei Hayashi and Motoshi Saeki},
        title = {Extracting Prehistories of Software Refactorings from Version Archives},
        booktitle = {Large-Scale Knowledge Resources. Construction and Application -- Proceedings of the 3rd International Conference on Large-Scale Knowledge Resources},
        pages = {82--89},
        year = 2008,
        month = {mar},
    }
    [hayashi-lkr2008]: as a page
  55. Shinpei Hayashi, Motoshi Saeki:"Eclipse Plug-ins for Collecting and Analyzing Program Modifications".In Eclipse Technology eXchange Workshop (ETX 2006), co-located with OOPSLA 2006, Poster Session. Oregon Convention Center, Portland, Oregon, USA,oct,2006.
    Abstract
    In this poster, we discuss the need for collecting and analyzing program modification histories, sequences of fine-grained program editing operations. Then we introduce Eclipse plug-ins that can collect and analyze modification histories, and show its useful application technique that can suggest suitable refactoring opportunities to developers by analyzing histories.
    BibTeX
    @misc{hayashi-etx2006,
        author = {Shinpei Hayashi and Motoshi Saeki},
        title = {Eclipse Plug-ins for Collecting and Analyzing Program Modifications},
        howpublished = {In Eclipse Technology eXchange Workshop},
        year = 2006,
        month = {oct},
    }
    [hayashi-etx2006]: as a page

Research Talks Presented in Conferences, Workshops, or Symposia held in Japan

  1. 星野 友宏, 林 晋平, 佐伯 元司:"探索に基づくリファクタリング補完の実現に向けて".ソフトウェアエンジニアリングシンポジウム2017 (SES 2017). 早稲田大学 グリーンコンピューティングシステム研究開発センター,aug,2017.
    BibTeX
    @misc{hoshinot-ses2017,
        author = {星野 友宏 and 林 晋平 and 佐伯 元司},
        title = {探索に基づくリファクタリング補完の実現に向けて},
        howpublished = {ソフトウェアエンジニアリングシンポジウム2017},
        year = 2017,
        month = {aug},
    }
    [hoshinot-ses2017]: as a page
  2. Sarocha Sothornprapakorn, Shinpei Hayashi, Motoshi Saeki:"Visualizing a Tangled Change for Supporting Its Decomposition and Commit Construction".ソフトウェアエンジニアリングシンポジウム2017 (SES 2017). 早稲田大学 グリーンコンピューティングシステム研究開発センター,aug,2017. インタラクティブ特別賞 受賞.
    BibTeX
    @misc{sarocha-ses2017,
        author = {Sarocha Sothornprapakorn and Shinpei Hayashi and Motoshi Saeki},
        title = {Visualizing a Tangled Change for Supporting Its Decomposition and Commit Construction},
        howpublished = {ソフトウェアエンジニアリングシンポジウム2017},
        year = 2017,
        month = {aug},
    }
    [sarocha-ses2017]: as a page
  3. 平澤 一晃, 林 晋平, 佐伯 元司:"ゴール指向要求分析における語彙間の格関係によるゴール推薦".情報処理学会研究報告, vol. 2017-SE-195,no. 11, pp. 1-8. 早稲田大学 西早稲田キャンパス, 東京,mar,2017.
    ID
    ISSN: 0919-6072
    Abstract
    問題領域固有の知識(ドメイン知識) の不足による要求仕様の誤りや欠落は開発の手戻りや,実現するべきシステムの機能の欠落や,不要な機能の実装の原因となる.本論文では,ゴール指向要求分析法において,過去の事例等から得られたドメイン知識を利用してゴールの詳細化を支援する手法を提案する.この手法では単語概念と格フレームを表す単語の組の概念,そして概念間の関係により定義されたドメインオントロジを利用する.オントロジ上に定義された格フレームとゴール記述のマッチングを行い,マッチした格フレームと関係を持つ概念を注目しているゴールに必要な概念と考え,この概念を持つゴールをサブゴールとして推薦する.既存のゴール指向要求分析ツールに記述解析機構,マッチング機構,推論機構を組み込み,事例評価を行い有用な推薦が行われることを示した.
    BibTeX
    @article{kazuaki-sigse201703,
        author = {平澤 一晃 and 林 晋平 and 佐伯 元司},
        title = {ゴール指向要求分析における語彙間の格関係によるゴール推薦},
        journal = {情報処理学会研究報告},
        volume = {2017-SE-195},
        number = 11,
        pages = {1--8},
        year = 2017,
        month = {mar},
    }
    [kazuaki-sigse201703]: as a page
  4. 大内 裕晃, 林 晋平, 善明 晃由, 佐伯 元司:"イシュー上の議論構造の可視化とその理解支援ツール".電子情報通信学会技術研究報告, vol. 116,no. 512, pp. 49-54. てんぶす那覇, 沖縄,mar,2017.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/201703097bRX/
    Abstract
    ソフトウェアの開発ではイシュー管理システム(ITS)が広く利用されている.ITS上のイシュー内部のコメントによって構成される議論を把握することで,そのソフトウェアの問題点や今後の実装方針を知ることができるが,複雑な議論の場合その流れを把握することが難しいという課題がある.本論文ではイシュー上の議論についてコメントの記述内容からコメント間の関連性を抽出し,議論の流れをグラフとして可視化するための手法を提案する.提案手法はコメントの記述内容が議論参加者の名前を含むか,以前のコメントの内容を引用しているか, 議論参加者自身の以前のコメントの内容を補足するかの3つの観点からコメント間の関係を抽出し,これを用いて議論構造グラフを構築する.議論構造グラフがあることで,議論全体の流れを視覚的に把握することが可能になる.また提案手法に基づき構築したグラフと議論の内容を併せて表示することで読者の議論内容把握を支援するツールを実装した.支援ツールは提案手法により構築したグラフを修正する機能と,理解した内容を記録する機能を有し, 読者が議論の理解過程を保存することを可能にする.
    BibTeX
    @article{houchi-sigss201703,
        author = {大内 裕晃 and 林 晋平 and 善明 晃由 and 佐伯 元司},
        title = {イシュー上の議論構造の可視化とその理解支援ツール},
        journal = {電子情報通信学会技術研究報告},
        volume = 116,
        number = 512,
        pages = {49--54},
        year = 2017,
        month = {mar},
    }
    [houchi-sigss201703]: as a page
  5. 淺野 圭亮, 林 晋平, 佐伯 元司:"ゴール指向要求分析法における不適切なゴール詳細化の検出".電子情報通信学会技術研究報告, vol. 116,no. 512, pp. 127-132. てんぶす那覇, 沖縄,mar,2017.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20170310wbRr/
    Abstract
    要求獲得を支援する手法としてゴール指向要求分析法がある.ゴール指向要求分析法ではゴールグラフを利用し,システムにより達成したいゴールを繰り返し詳細化することでシステムが持つべき機能を特定する.ゴールグラフ中に不適切なゴール詳細化を行っている箇所があることは要求の見落としや不要な要求の獲得の原因となる.本論文では,不適切なゴール詳細化を自動的に検出することを目的とする.まず,不適切なゴール詳細化の具体例を収集し,これらを分析して不適切な詳細化の分類を行った.この分析をもとにゴール記述の意味とゴールグラフの構造の2つの観点から検出規則の定義を行った.ゴール記述の意味の観点では,ゴール記述の類似度に着目する.ゴールグラフの構造の観点では,兄弟枝の数および葉ゴールの相対的な深さに着目する.検出規則の有用性を評価するための被験者実験から,検出規則により不適切な詳細化を行っている箇所全部のうち60\%以上を検出でき,被験者の見落としていた不適切な詳細化も指摘できた.
    BibTeX
    @article{k_asano-sigss201703,
        author = {淺野 圭亮 and 林 晋平 and 佐伯 元司},
        title = {ゴール指向要求分析法における不適切なゴール詳細化の検出},
        journal = {電子情報通信学会技術研究報告},
        volume = 116,
        number = 512,
        pages = {127--132},
        year = 2017,
        month = {mar},
    }
    [k_asano-sigss201703]: as a page
  6. 森 達也, 小林 隆志, 林 晋平, 渥美 紀寿:"前処理命令による可変点を考慮した共変更ルール抽出".電子情報通信学会技術研究報告, vol. 116,no. 512, pp. 61-66. てんぶす那覇, 沖縄,mar,2017.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20170309Rbr4/
    Abstract
    プログラムを変更すると複数の依存箇所に変更が伝播するが,大規模なソフトウェア開発では開発者が必要な変更箇所を全て特定することは困難な作業となる.前処理命令を埋め込むことで実行環境の差異の吸収が可能なソフトウェアでは前処理命令が散在するため,必要な変更箇所の特定はより困難となる.本稿では,前処理命令の影響を受ける箇所に対する変更を考慮した共変更ルールの抽出手法を提案する.前処理命令の分岐条件と変更の関係を解析することで,改版履歴中の変更に属性を付与し,ルールを生成する.3つの中規模OSSを用いた評価実験の結果,提案手法によって得られた共変更ルールはリフト値の観点から質が高いことを明らかにした.また,既存手法と比較して推薦精度を表すMRRの最大値が向上することを示した.
    BibTeX
    @article{tmori-sigss201703,
        author = {森 達也 and 小林 隆志 and 林 晋平 and 渥美 紀寿},
        title = {前処理命令による可変点を考慮した共変更ルール抽出},
        journal = {電子情報通信学会技術研究報告},
        volume = 116,
        number = 512,
        pages = {61--66},
        year = 2017,
        month = {mar},
    }
    [tmori-sigss201703]: as a page
  7. 梅川 尚孝, 林 晋平, 佐伯 元司:"識別子名一括変更支援における推薦精度の向上に向けて".情報処理学会研究報告, vol. 2017-SE-195,no. 1, pp. 1-8. 早稲田大学 西早稲田キャンパス, 東京,mar,2017.
    ID
    ISSN: 0919-6072
    Abstract
    プログラム中の識別子は適切に名付けられるとプログラム理解に貢献するとされている.開発中に識別子名は様々な意図によって変更が加えられるが,大規模プロジェクトでは大きな手間となる.これに対して識別子名の一括変更を行う手法が提案されているが,検出精度に課題がある.本論文では識別子名一括変更を行う手法に対して,推測する変更意図の詳細化や識別子名の安定性を考慮等の拡張を行い,推薦精度の向上を図った.またツールによる自動化を行い,オープンソースソフトウェアで実際に行われた識別子名変更を用いて従来手法との比較を行った.
    BibTeX
    @article{umekawa-sigse201703,
        author = {梅川 尚孝 and 林 晋平 and 佐伯 元司},
        title = {識別子名一括変更支援における推薦精度の向上に向けて},
        journal = {情報処理学会研究報告},
        volume = {2017-SE-195},
        number = 1,
        pages = {1--8},
        year = 2017,
        month = {mar},
    }
    [umekawa-sigse201703]: as a page
  8. 梅川 尚孝, 林 晋平, 佐伯 元司:"関連する識別子名の一括変更支援に向けて".ソフトウェアエンジニアリングシンポジウム2016 (SES 2016). 東洋大学 白山キャンパス, 東京,aug,2016.
    BibTeX
    @misc{umekawa-ses2016,
        author = {梅川 尚孝 and 林 晋平 and 佐伯 元司},
        title = {関連する識別子名の一括変更支援に向けて},
        howpublished = {ソフトウェアエンジニアリングシンポジウム2016},
        year = 2016,
        month = {aug},
    }
    [umekawa-ses2016]: as a page
  9. 淺野 圭亮, 林 晋平, 佐伯 元司:"ゴールグラフにおける不適切な詳細化の検出に向けて".ソフトウェアエンジニアリングシンポジウム2016 (SES 2016). 東洋大学 白山キャンパス, 東京,aug,2016.
    BibTeX
    @misc{k_asano-ses2016,
        author = {淺野 圭亮 and 林 晋平 and 佐伯 元司},
        title = {ゴールグラフにおける不適切な詳細化の検出に向けて},
        howpublished = {ソフトウェアエンジニアリングシンポジウム2016},
        year = 2016,
        month = {aug},
    }
    [k_asano-ses2016]: as a page
  10. 陽 文樹, 林 晋平, 佐伯 元司:"コンポーネントの責務と依存制約に基づくリファクタリング支援".In ソフトウェアエンジニアリングシンポジウム2016予稿集 (SES 2016), pp. 94-103. 東洋大学 白山キャンパス, 東京,aug,2016.
    Abstract
    ソフトウェアアーキテクチャパターンに適合するコードの記述は保守コストの削減のために重要である.しかし,パターンで定義された制約に従うコードの記述は開発者の負担となり,実際にはこれに違反するコードが記述される.本稿では,アーキテクチャ適合のためのリファクタリングプロセスを支援するために,アーキテクチャ制約における違反コードを不吉な臭いとして検出する手法を提案する.提案手法はソースコードから抽出したコード片間の依存関係グラフ,およびアーキテクチャに則した推定規則を入力とし,グラフの各ノードに付加した所属可能なコンポーネントの集合の情報を段階的に更新していく.推定規則はコンポーネントの責務と依存制約を表現しており,周辺コード片の現推定状態から制約を満たさない各ノードのコンポーネント候補を除いていく.最終結果に現所属コンポーネントが含まれていない場合,そのコード片を違反として検出する.MVC2 アーキテクチャを対象として規則を定義し,Play Frameworkを用いたWebアプリケーション群に対して手法を適用したところ,高精度の検出結果を得た.
    BibTeX
    @incollection{minami-ses2016,
        author = {陽 文樹 and 林 晋平 and 佐伯 元司},
        title = {コンポーネントの責務と依存制約に基づくリファクタリング支援},
        booktitle = {ソフトウェアエンジニアリングシンポジウム2016予稿集},
        pages = {94--103},
        year = 2016,
        month = {aug},
    }
    [minami-ses2016]: as a page
  11. 中野 真明貴, 林 晋平, 小林 隆志:"動的機能捜索における関連度と探索戦略".電子情報通信学会技術研究報告, vol. 116,no. 127, pp. 169-174. 北海道立道民活動センター, 北海道,jul,2016.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20160715kbjp/
    Abstract
    形式概念分析を利用した動的機能捜索では,機能を実現する実装箇所は概念束内の複数の概念内に分散して現れる.このため捜索時には複数の概念を探索する必要がある.本稿ではこの探索効率の向上を目的として,機能との関連度に着目した概念束の探索戦略を提案する.機能との関連度を表す指標としては,欠陥箇所特定技法で利用される類似係数を用いる.代表的なオープンソースソフトウェアの複数の機能に対し提案手法による機能捜索を行い,既存手法との有用性の比較を行った.
    In dynamic feature location based on formal concept analysis, it is a hard problem that modules implementing focused feature distribute dispersively among many formal concepts. For this reason, in locating, users must investigate many formal concepts. To improve the efficiency of this feature location technique, we propose two investigation strategies using a relevance metric. We use a similarity that is used in area of fault localization as a relevance metric. We applied our investigation strategies to several features of a representative open source software product and compared them with an existing strategy.
    BibTeX
    @article{maaki-sigss201607,
        author = {中野 真明貴 and 林 晋平 and 小林 隆志},
        title = {動的機能捜索における関連度と探索戦略},
        journal = {電子情報通信学会技術研究報告},
        volume = 116,
        number = 127,
        pages = {169--174},
        year = 2016,
        month = {jul},
    }
    [maaki-sigss201607]: as a page
  12. 小俣 仁美, 林 晋平, 佐伯 元司:"命名方法の関連性に基づく識別子名の一括変更支援".情報処理学会研究報告, vol. 2016-SE-191,no. 23, pp. 1-8. 大阪大学 吹田キャンパス, 大阪,mar,2016.
    ID
    ISSN: 0919-6072
    Abstract
    プログラム全体で識別子の種類の表記方法とプログラム中の概念に対する表現を統一するためには,識別子の命名規約や使用する単語を変更する際に複数の識別子名を一括して変更する必要がある.しかし,既存の手法やツールで変更すべき全ての識別子を名前変更することはできず,開発者自身による特定では漏れが生じる.本論文では,ある名前変更操作と一括して行うべき他の識別子に対する名前変更操作を推薦する手法を提案する.実際のプログラムの改版履歴を調査したところ,型名や記号等を用いた識別子の種類の表記方法や,概念に対して使用される単語を統一するための複数の識別子に対する同時名前変更操作が頻繁に行われていた.そこで,提案手法では開発者による1 つの名前変更操作を受け取り,その操作における命名規約や単語の変更を検出する.検出結果に基づき,同一の命名規約で表されるべき同種の識別子及び同じ単語を使用している識別子をプログラム中から探索し,入力の名前変更操作と同様の変更を行って得られた新しい名前を推薦する.識別子名の一括変更操作の実例を再現できるかを確認したところ,平均再現率0.75で実際の名前変更履歴中の同時変更を推薦できた.
    BibTeX
    @article{hkomata-sigse201603,
        author = {小俣 仁美 and 林 晋平 and 佐伯 元司},
        title = {命名方法の関連性に基づく識別子名の一括変更支援},
        journal = {情報処理学会研究報告},
        volume = {2016-SE-191},
        number = 23,
        pages = {1--8},
        year = 2016,
        month = {mar},
    }
    [hkomata-sigse201603]: as a page
  13. 根岸 由, 林 晋平, 佐伯 元司:"法律に適合した要求獲得のためのゴールモデル作成支援".情報処理学会研究報告, vol. 2016-SE-191,no. 22, pp. 1-8. 大阪大学 吹田キャンパス, 大阪,mar,2016. 学生研究賞 受賞.
    ID
    ISSN: 0919-6072
    Abstract
    法律との整合性を保ったシステムを開発するためには,要求獲得段階での法律を遵守する機能の獲得が必要である.要求分析者の見落としを防ぎ,法律に違反する機能を入れないためには知識と結びついた計算機による支援が有効である.本論文では,ゴール指向要求分析法において法律文に関連するゴールを自動的に特定し,法律を遵守するためのゴールを挿入する手法を提案する.ゴール記述,法律文の意味表現である格フレーム同士をマッチングすることで法律文に関連するゴールを得る.その後,法律文の様相に応じて法律を遵守するためのゴールを挿入する.事例に対して提案手法を適用し,93%の違反修正で効果を示すなどの結果を得た.
    BibTeX
    @article{negishi-sigse201603,
        author = {根岸 由 and 林 晋平 and 佐伯 元司},
        title = {法律に適合した要求獲得のためのゴールモデル作成支援},
        journal = {情報処理学会研究報告},
        volume = {2016-SE-191},
        number = 22,
        pages = {1--8},
        year = 2016,
        month = {mar},
    }
    [negishi-sigse201603]: as a page
  14. 丸山 勝久, 林 晋平, 吉田 則裕, 崔 恩瀞:"フレームベースリファクタリング ~その概念と意義~".In 第22回ソフトウェア工学の基礎ワークショップ (FOSE 2015 in 天童), ポスター発表. 天童, 山形,nov,2015.
    BibTeX
    @misc{maruyama-fose2015,
        author = {丸山 勝久 and 林 晋平 and 吉田 則裕 and 崔 恩瀞},
        title = {フレームベースリファクタリング ~その概念と意義~},
        howpublished = {In 第22回ソフトウェア工学の基礎ワークショップ},
        year = 2015,
        month = {nov},
    }
    [maruyama-fose2015]: as a page
  15. 松田 淳平, 林 晋平, 佐伯 元司:"分散型版管理リポジトリでの作業履歴記録ツールの試作".電子情報通信学会技術研究報告, vol. 115,no. 153, pp. 45-50. 札幌市教育文化会館, 北海道,jul,2015.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20150722pbbl/
    Abstract
    複雑化する分散型版管理システムに対する操作を支援する上で,開発者による版管理システム操作に対する解析が十分に進んでいない.また分散型版管理システムでは集中型版管理システムと異なり,開発者間で共有される履歴の他に,開発者のローカル環境にのみ存在する履歴及び書き換えられて失われる履歴が存在する.これらの履歴の違いや開発者による版管理システムに対する操作を調査するため,我々は分散型版管理システムを利用する開発者のマシン上で観測される履歴及び対版管理システム操作を記録するツールを試作した.
    Although handling Distributed Version Control Systems (D-VCSs) is a complicated process for develop- ers, its empirical analysis is not sufficiently achieved. In particular, contrary to Centralized Version Control Systems (C-VCSs) only manage shared repositories, D-VCSs manage change histories only on a local repository and rewrite them without sharing with other developers. We have implemented a prototype tool for logging operations on the repository on D-VCS in order to explore such hidden histories and the operation for D-VCS by developers.
    BibTeX
    @article{jmatsu-sigss201507,
        author = {松田 淳平 and 林 晋平 and 佐伯 元司},
        title = {分散型版管理リポジトリでの作業履歴記録ツールの試作},
        journal = {電子情報通信学会技術研究報告},
        volume = 115,
        number = 153,
        pages = {45--50},
        year = 2015,
        month = {jul},
    }
    [jmatsu-sigss201507]: as a page
  16. セーリム ナッタウット, 林 晋平, 佐伯 元司:"プレファクタリングのための不吉な臭いの検出結果の優先順位付け".電子情報通信学会技術研究報告, vol. 115,no. 153, pp. 33-38. 札幌市教育文化会館, 北海道,jul,2015. 電子情報通信学会ソフトウェアサイエンス研究会研究奨励賞 受賞.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20150722xbbH/
    Abstract
    プレファクタリングの適用箇所を特定するため,ソースコード中の不吉な臭いの検出器が提案されている.しかし,既存の不吉な臭い検出器は,開発者の現在の開発コンテキストを考慮せず,関連する臭いと関連しない臭いを混在させて出力するため,特定のコンテキストに従っている開発者には適さない.その結果,開発者は適する臭いを特定するための時間を必要とするという課題がある.本稿では,不吉な臭いを開発者の持つコンテキストに従い優先順位付けする手法を提案する.我々は,イシュー管理システムに登録された,次のリリースまでに解決すべきイシューの一覧を開発のコンテキストと見なす.提案手法では,イシューの説明文に対して機能捜索手法を適用して得た結果のモジュール一覧を用いて,コンテキストに関連付く臭いを特定する.コンテキストに関連付く度合いによる優先順位に基づき,不吉な臭い検出器の出力を並べ替えて出力する.本稿では,オープンソースプロジェクトを用いて行った提案手法の予備評価についても述べる.
    In order to find the opportunities for applying prefactoring, several techniques for detecting bad smells in source code have been proposed. However, existing smell detectors are often not suitable for developers who have a specific context because these detectors do not consider their current context and output the results that are mixed with both smells that are and are not related to such context. Consequently, the developers have to spend a considerable amount of time identifying relevant smells. In this paper, we propose a technique to prioritize bad code smells by using developers' context, i.e., a list of issues in an issue tracking system that needs to be implemented before next release. We applied feature location technique to the list of issues and used the results to specify which smells are associated with the context. Thus, our approach can provide the developers with a list of prioritized bad code smells that is related to their current context. Several preliminary evaluations using open source project indicated the effectiveness of our technique.
    BibTeX
    @article{natthawute-sigss201507,
        author = {セーリム ナッタウット and 林 晋平 and 佐伯 元司},
        title = {プレファクタリングのための不吉な臭いの検出結果の優先順位付け},
        journal = {電子情報通信学会技術研究報告},
        volume = 115,
        number = 153,
        pages = {33--38},
        year = 2015,
        month = {jul},
    }
    [natthawute-sigss201507]: as a page
  17. 伊藤 翔一朗, 林 晋平, 佐伯 元司:"融合ゴール指向要求分析法におけるメトリクスを用いたAs-Isモデルの問題点発見手法".電子情報通信学会技術研究報告, vol. 115,no. 153, pp. 155-160. 札幌市教育文化会館, 北海道,jul,2015. 電子情報通信学会ソフトウェアサイエンス研究会研究奨励賞 受賞.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/201507241bbM/
    Abstract
    ゴール指向要求分析法は要求の構造理解や分解に有用であるが,システム実行時の振る舞いに関する要求を把握しづらい.プロブレムフレームはシステム動作や実行時の問題理解に焦点を当てるが,具体的な解決策を構築していくことは難しい.本論文では,これらの要求分析手法を組み合わせ,As-Is からTo-Be へのモデル化手法を提案する.また,このAs-Is モデルを評価するメトリクスを提案し,メトリクスを用いることによってAs-Is モデルの問題点の発見を試みる.
    Since goal-oriented requirements engineering is useful for understanding the structure of requirements and refining them, it cannot obtain enough requirements of system behavior. Also, since problem-oriented requirements analysis is used for understanding the requirements of system behavior, it cannot be used for refining and determining a To-Be system from an As-Is system. In this papaer, we propose an approach for modeling a To-Be system from an As-Is system using these methodologies. Also, we propose metrics that can be used to evaluate As-Is systems and to detect their problems.
    BibTeX
    @article{ito-sigss201507,
        author = {伊藤 翔一朗 and 林 晋平 and 佐伯 元司},
        title = {融合ゴール指向要求分析法におけるメトリクスを用いたAs-Isモデルの問題点発見手法},
        journal = {電子情報通信学会技術研究報告},
        volume = 115,
        number = 153,
        pages = {155--160},
        year = 2015,
        month = {jul},
    }
    [ito-sigss201507]: as a page
  18. 星野 大樹, 林 晋平, 佐伯 元司:"ソースコード編集履歴の不吉な臭いの検出".情報処理学会研究報告, vol. 2015-SE-187,no. 9, pp. 1-8. 化学会館, 東京,mar,2015.
    ID
    ISSN: 0919-6072
    Abstract
    ソースコード編集履歴の理解性や利用性を向上させるための履歴リファクタリング手法が提案されている.しかし,既存手法ではどのような編集履歴をどのようにリファクタリングすべきか明確でない.本稿ではリファクタリングが必要となる履歴の特徴を「履歴の臭い」として定義し,また,履歴の臭いを判別するためのメトリクスを提案する.提案したメトリクスによって各編集操作の結びつきを捉え,臭いの自動検出を可能とする.検出の精度について評価を行い,適合度0.86 など有用な結果を得た.
    History refactorings that improve the understandability and usability of a history of source code have been proposed. However, the proposed technique has not de ne where and how to refactor a history. We de ne bad smells in history and metrics for detecting them. Identifying the relationship between editing operations in a history by using the proposed metrics leads to automated detection of bad smells in history. We con rmed that our detection technique is useful due to its high accuracy.
    BibTeX
    @article{dhoshino-sigse201503,
        author = {星野 大樹 and 林 晋平 and 佐伯 元司},
        title = {ソースコード編集履歴の不吉な臭いの検出},
        journal = {情報処理学会研究報告},
        volume = {2015-SE-187},
        number = 9,
        pages = {1--8},
        year = 2015,
        month = {mar},
    }
    [dhoshino-sigse201503]: as a page
  19. 阿部 達也, 林 晋平, 佐伯 元司:"セキュリティターゲットを活用したセキュリティ機能要求獲得支援法".情報処理学会研究報告, vol. 2015-SE-187,no. 17, pp. 1-8. 化学会館, 東京,mar,2015.
    ID
    ISSN: 0919-6072
    Abstract
    システム設計段階において,あらかじめシステムに存在するセキュリティ脅威を検出し対策を講じることによって,より安全で高信頼度のシステムを開発することができる.しかし,脅威の検出と対策にはセキュリティに関する知識が必要であったり,見落としを極力減らす必要があったりすることから,コストや時間がかかる.そこで本稿では,入力されたシナリオシーケンスに対し,あらかじめ知識として保持している検出と対策のためのパターンとの比較によって,対象システムに発生しうる脅威を検出し,ミスシナリオと脅威が対策されたシナリオ,それを実現するためのセキュリティ機能を提示する手法を提案する.シナリオ記述及びパターンの記述において,セキュリティドメインに基づくプロファイルに従ったUML シーケンス図を利用し,パターン作成のための知識として,コモンクライテリアで定められているセキュリティターゲットを用いる.本稿では適用事例を用いて手法の有用性を確認した.
    Detecting and mitigating security threats of information systems in design phase helps to make them secure. However, the more threats we try to detect and mitigate, the more cost and knowledge of security threats are required. In this paper, we present a technique to detect security threats, show negative scenarios, mitigated scenarios and their security functions with comparing normal scenarios of a business process and the patterns created from knowledge of security. The scenarios of a business process are described with sequence diagrams. The knowledge is extracted from the documents called Security Target compliant to the international standard Common Criteria. We show the usefulness of our approach with several case studies.
    BibTeX
    @article{abe-sigse201503,
        author = {阿部 達也 and 林 晋平 and 佐伯 元司},
        title = {セキュリティターゲットを活用したセキュリティ機能要求獲得支援法},
        journal = {情報処理学会研究報告},
        volume = {2015-SE-187},
        number = 17,
        pages = {1--8},
        year = 2015,
        month = {mar},
    }
    [abe-sigse201503]: as a page
  20. 中村 遼太郎, 林 晋平, 佐伯 元司:"自然言語で書かれた要求文の規則への整合性検査手法".情報処理学会研究報告, vol. 2015-SE-187,no. 18, pp. 1-8. 化学会館, 東京,mar,2015.
    ID
    ISSN: 0919-6072
    Abstract
    自然言語で書かれた要求文と規則の整合性をモデル検査で検査するためには,要求文を状態遷移モデルに,規則を検査式に変換する必要がある.この際,状態遷移モデルと検査式を対応づけるには,要求文と規則の語彙マッチングを行わなければならない.本稿では,用意した格フレーム辞書と要求文とのマッチング法を開発し,これによる規則への整合性検査手法を提案する.提案手法は,類義語,同義語,上位下位語を処理し,要求文の単語と格スロットに入るべき単語の意味的制約に基づくマッチングを行う.これにより要求文を格フレーム化した後,要求文の意味を踏まえた状態遷移モデル及び該当モデルに対応する規則の検査式を生成する.要求文と規則文に提案手法を適用し有用性を評価した.
    When developers check the consistency between requirements specification documents and regulations by Model checking, they need state transition models of the documents and logic specifications of regulations. Moreover, they have to know which words in documents correspond to words in applicable regulations in respect of meaning so that they create logic specifications. In this paper, we propose a technique to reason the meaning of words in requirements specification documents by using co-occurrence restrictions in case frames and to create state transition models based on the reasoned meaning and logic specifications of applicable regulations. These specifications are created from these reasoned meaning and logic expressions which contain case frames as factors and express regulations.Our proposal is evaluated with a case study.
    BibTeX
    @article{nakamura-sigse201503,
        author = {中村 遼太郎 and 林 晋平 and 佐伯 元司},
        title = {自然言語で書かれた要求文の規則への整合性検査手法},
        journal = {情報処理学会研究報告},
        volume = {2015-SE-187},
        number = 18,
        pages = {1--8},
        year = 2015,
        month = {mar},
    }
    [nakamura-sigse201503]: as a page
  21. 星野 大樹, 林 晋平, 佐伯 元司:"ソースコード編集履歴の不吉な臭いの検出に向けて".In ソフトウェアエンジニアリングシンポジウム2014予稿集 (SES 2014), pp. 210-211. 芝浦工業大学 田町キャンパス, 東京,sep,2014. インタラクティブ賞 受賞.
    Abstract
    本稿では,ソースコード編集履歴における不吉な臭いとその検出法について議論する.ソースコード編集履歴の理解性や利用性を向上させるために編集履歴をリファクタリングする手法があるが,どのような履歴にどのようなリファクタリングが必要なのかは明確でない.現在我々が行っているソフトウェア開発プロジェクトにおいて蓄積された編集履歴の分析を行い,リファクタリングが必要となる履歴の特徴を「履歴の臭い」とし,臭いを検出する試みについて述べる.
    BibTeX
    @incollection{dhoshino-ses2014,
        author = {星野 大樹 and 林 晋平 and 佐伯 元司},
        title = {ソースコード編集履歴の不吉な臭いの検出に向けて},
        booktitle = {ソフトウェアエンジニアリングシンポジウム2014予稿集},
        pages = {210--211},
        year = 2014,
        month = {sep},
    }
    [dhoshino-ses2014]: as a page
  22. 中村 遼太郎, 林 晋平, 佐伯 元司:"ユースケース記述の規則への整合性検査に向けて".In ソフトウェアエンジニアリングシンポジウム2014予稿集 (SES 2014), pp. 192-193. 芝浦工業大学 田町キャンパス, 東京,sep,2014.
    Abstract
    ユースケースが示唆する機能要求が,法律をはじめとする規則を遵守するかについて,モデル検査によって検査する手法を述べる.ユースケースのドメインと規則の知識表現をもとに,ユースケースから,ユースケースに関わる規則の検査式と状態遷移モデルを生成する.生成された状態遷移モデルと検査式に,モデル検査を適用した結果から,機能要求が規則を遵守しているかを判定する.
    BibTeX
    @incollection{nakamura-ses2014,
        author = {中村 遼太郎 and 林 晋平 and 佐伯 元司},
        title = {ユースケース記述の規則への整合性検査に向けて},
        booktitle = {ソフトウェアエンジニアリングシンポジウム2014予稿集},
        pages = {192--193},
        year = 2014,
        month = {sep},
    }
    [nakamura-ses2014]: as a page
  23. 伊藤 翔一朗, 林 晋平, 佐伯 元司:"ゴール指向とプロブレムフレームの融合".In ソフトウェアエンジニアリングシンポジウム2014予稿集 (SES 2014), pp. 204-205. 芝浦工業大学 田町キャンパス, 東京,sep,2014.
    Abstract
    ゴール指向とプロブレムフレームを用いた,As-IsシステムからTo-Beシステムへのモデル化手法を提案する.本手法ではまずユースケースやゴールグラフ,プロブレムフレームのコンテクスト図などを元にAs-Isを記述および分析し,それらのモデルを用いて問題点を抽出する.次にその問題点を解決するためのゴールを設定しゴールグラフを構築,このグラフを用いてAs-Isのゴールグラフやコンテクスト図を修正してTo-Beモデルを構築していく.本稿では例題としてWebサービスのセキュリティシステムをとりあげて,手法の解説を行う.
    BibTeX
    @incollection{ito-ses2014,
        author = {伊藤 翔一朗 and 林 晋平 and 佐伯 元司},
        title = {ゴール指向とプロブレムフレームの融合},
        booktitle = {ソフトウェアエンジニアリングシンポジウム2014予稿集},
        pages = {204--205},
        year = 2014,
        month = {sep},
    }
    [ito-ses2014]: as a page
  24. 阿部 達也, 林 晋平, 佐伯 元司:"システム利用シナリオからのセキュリティ脅威の検出と対策シナリオの導出に向けて".In ソフトウェアエンジニアリングシンポジウム2014予稿集 (SES 2014), pp. 206-207. 芝浦工業大学 田町キャンパス, 東京,sep,2014.
    Abstract
    本稿では,システム利用シナリオからセキュリティ脅威を検出しミスシナリオを出力する手法と,Security Targetの記述から脅威の対策を抽出する手法を組み合わせることで,ミスシナリオに対応する脅威の対策がなされたシナリオを出力し,セキュリティ要求獲得を支援する手法について述べる.
    BibTeX
    @incollection{abe-ses2014,
        author = {阿部 達也 and 林 晋平 and 佐伯 元司},
        title = {システム利用シナリオからのセキュリティ脅威の検出と対策シナリオの導出に向けて},
        booktitle = {ソフトウェアエンジニアリングシンポジウム2014予稿集},
        pages = {206--207},
        year = 2014,
        month = {sep},
    }
    [abe-ses2014]: as a page
  25. 松田 淳平, 林 晋平, 佐伯 元司:"編集操作履歴の階層的なグループ化を用いたポリシー準拠のコミットの構築".In ソフトウェアエンジニアリングシンポジウム2014予稿集 (SES 2014), pp. 76-84. 芝浦工業大学 田町キャンパス, 東京,sep,2014. 最優秀論文賞 受賞.
    Abstract
    版管理システムを用いたソフトウェア開発において,コミットポリシーに従ったコミットは開発者らにとって有益である.しかしポリシーに従ったコミットの構成は開発者の負担となるため,その支援が望まれる.提案手法では,ポリシーに従った粒度のコミットをソースコード編集後に得るために,開発者による編集操作履歴を,開発環境が提供する編集の種類を用いて階層的に管理する.開発者が階層の構成要素である節を指定することにより,対応する粒度のコミットの列を,変更全体の整合性を維持したまま構成することができる.手動編集を含む大きなリファクタリングを適用したソースコードと記録した編集操作履歴に対し,本手法を適用した結果,複数のポリシーが定める粒度のコミットをそれぞれ適切に構成することができた.
    BibTeX
    @incollection{jmatsu-ses2014,
        author = {松田 淳平 and 林 晋平 and 佐伯 元司},
        title = {編集操作履歴の階層的なグループ化を用いたポリシー準拠のコミットの構築},
        booktitle = {ソフトウェアエンジニアリングシンポジウム2014予稿集},
        pages = {76--84},
        year = 2014,
        month = {sep},
    }
    [jmatsu-ses2014]: as a page
  26. 小松田 卓也, 林 晋平, 佐伯 元司:"機能捜索結果を用いたプレファクタリング支援".電子情報通信学会技術研究報告, vol. 114,no. 127, pp. 109-114. 富良野文化会館, 北海道,jul,2014.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20140711CBov/
    Abstract
    リファクタリングを適用すべき箇所を特定するために,ソースコード中の不吉な臭いを検出する手法がこれまでに提案されている.しかし,特定の機能を実装しようとしている開発者にとっては,現在のソースコード全体にわたって臭いを検出する既存手法の検出結果は適さない.本稿では,注目する機能の実装に関連する臭いを検出することにより,実装を容易にするために実装前にプログラムの構造を改善するプレファクタリングを支援する手法を提案する.提案手法では機能実装により起こる設計の劣化の度合いを機能実装前に推測するために,機能捜索手法によって得られたモジュール群に対して,機能実装によって引き起こる設計劣化を模倣するダミーコードを挿入する.ダミーコード挿入前後でのソースコードを臭い検出器に適用し,得られた臭いの検出結果を比較することで,対象としている機能の実装に強く関連する臭いを特定する.いくつかの予備評価により,提案手法が有効に機能する場合があることを確認した.
    In order to find the opportunities for applying refactoring, several techniques for detecting bad smells in source code have been proposed. However, existing smell detectors are not suitable for developers who are trying to implement a specific feature because the detectors detect too many smells from the whole source code. In this paper, we propose a technique to detect bad smells specific to the focused feature for supporting prefactoring to improve the extendibility of the program before implementing the feature. In order to estimate the effect of the feature introduction before implementing it, dummy code imitating the deterioration of the design quality is inserted to the modules obtained using the result of a feature location technique. Comparing the detected smells in source code before and after inserting dummy code, we can specify which smells are strongly related to the target feature. Several preliminary evaluations indicated the effectiveness of our technique.
    BibTeX
    @article{komatsuda-sigss201407,
        author = {小松田 卓也 and 林 晋平 and 佐伯 元司},
        title = {機能捜索結果を用いたプレファクタリング支援},
        journal = {電子情報通信学会技術研究報告},
        volume = 114,
        number = 127,
        pages = {109--114},
        year = 2014,
        month = {jul},
    }
    [komatsuda-sigss201407]: as a page
  27. 加藤 哲平, 林 晋平, 佐伯 元司:"下位概念間の依存関係を用いた機能捜索".情報処理学会研究報告, vol. 2014-SE-183,no. 17, pp. 1-8. 化学会館, 東京,mar,2014. 学生研究賞 受賞.
    ID
    ISSN: 0919-6072
    Abstract
    ソースコードの修正時には,各手順に対応するモジュールを特定する機能捜索が必要となる.しかし,既存の機能捜索手法は機能を構成する概念間の関係を考慮しておらず,高精度で各概念に対応するモジュールを特定することが難しい.本研究では,機能を構成する下位概念間の依存関係を用いて機能捜索を行う手法を提案する.各下位概念に対応する記述を入力として既存の概念捜索手法を適用し,対応するモジュールの一覧を得る.その後,下位概念間に存在する依存関係を満たさないモジュールを一覧から除外することで,得られた一覧の精度を向上させる.既存手法との比較実験により,提案手法の有用性の評価を行った.
    Since existing feature location techniques lack the relationship between concepts in a feature, it is hard to locate the concepts in source code of high accuracy. This paper proposes a technique to locate the concepts in a feature using the dependency between the concepts. We apply an existing concept location technique to the description for each concept and obtain the list of modules. Some of modules which do not match the dependency between concepts are filtered out, and we can obtain more precise list of modules. The experiment shows the effectiveness of our technique.
    BibTeX
    @article{kato-sigse201403,
        author = {加藤 哲平 and 林 晋平 and 佐伯 元司},
        title = {下位概念間の依存関係を用いた機能捜索},
        journal = {情報処理学会研究報告},
        volume = {2014-SE-183},
        number = 17,
        pages = {1--8},
        year = 2014,
        month = {mar},
    }
    [kato-sigse201403]: as a page
  28. 中村 遼太郎, 林 晋平, 佐伯 元司:"ユースケース記述の検査のための自然言語要求文の解析".電子情報通信学会技術研究報告, vol. 113,no. 489, pp. 25-30. てんぶす那覇, 那覇,mar,2014.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/201403115BMc/
    Abstract
    ユースケース記述は自然言語で記述されるため,内容をコンピュータで分析することは難しい.そこで,ユースケース記述に書かれた仕様を状態遷移モデルに変換しモデルチェッカで検査するために,ユースケース記述の各文を格フレームに変換する手法を提案する.提案手法では,まず,ユースケース記述の自然言語記述の係り受け解析を行う.次に,係り受け解析結果と辞書で定義される複数の格フレーム候補を照合し,入力文の格構造に対応する格フレームと考えられる順に格フレーム候補を順序付けて出力する.事例研究として,提案手法と入力文の格フレームから状態遷移モデルへの変換手法を用いて状態遷移モデルを生成し,モデル検査器に適用した.その結果,ユースケース記述が満たす性質と満たさない性質を判別することができた.
    Since use case descriptions written in a natural language are informal, it is difficult to analyze them automatically. To check whether descriptions satisfy their requirements by a model checker, this paper proposes a method to generate a case frame from a sentence in descriptions. First, we extract a verb from a sentence and find case frames associated with the verb from a dictionary. Then, we select the most adaptable one based on the analysis results of the sentence. We have implemented a supporting tool for the method. A case study for applying the tool and for translating the obtained case frames into a state transition model shows the feasibility of the method.
    BibTeX
    @article{nakamura-sigss201403,
        author = {中村 遼太郎 and 林 晋平 and 佐伯 元司},
        title = {ユースケース記述の検査のための自然言語要求文の解析},
        journal = {電子情報通信学会技術研究報告},
        volume = 113,
        number = 489,
        pages = {25--30},
        year = 2014,
        month = {mar},
    }
    [nakamura-sigss201403]: as a page
  29. 風戸 広史, 林 晋平, 小林 隆志, 大島 剛志, 宮田 俊介, 夏川 勝行, 星野 隆, 佐伯 元司:"反復的なソフトウェア機能捜索・識別の例題への適用".電子情報通信学会技術研究報告, vol. 113,no. 422, pp. 119-124. 豊田中央研究所, 愛知,jan,2014.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20140131tB96/
    Abstract
    機能捜索(feature location)はソフトウェアの機能とその実装箇所を対応付ける作業であり,ソフトウェアの理解や変更のための基礎となる.既存の機能捜索手法は分析者が機能を適切に認識していることを前提としており,認識があいまいな状況では十分な効果が得られない.本稿では,形式概念分析に基づく既存の動的な機能捜索手法を拡張し,機能の捜索と識別を反復的に改善する手法を提案する.例題のWeb アプリケーションに適用し,提案手法が正常シナリオのみを用いた機能捜索結果からの代替シナリオの発見に役立つことを示した.
    Feature location (FL) is an important activity for finding correspondence between features and modules in source code. However, recognizing features correctly is an inevitable prerequisite for existing FL techniques; otherwise the FL would end up with insufficient or incorrect modules for the features. In this paper, we propose an incremental technique for locating and identifying features by extending an existing dynamic FL technique based on formal concept analysis. We have applied the technique to an example web application and showed that the suggestions from our technique were useful for identifying alternative scenarios when the dynamic FL technique only covers its successful scenarios.
    BibTeX
    @article{kazato-sigss201401,
        author = {風戸 広史 and 林 晋平 and 小林 隆志 and 大島 剛志 and 宮田 俊介 and 夏川 勝行 and 星野 隆 and 佐伯 元司},
        title = {反復的なソフトウェア機能捜索・識別の例題への適用},
        journal = {電子情報通信学会技術研究報告},
        volume = 113,
        number = 422,
        pages = {119--124},
        year = 2014,
        month = {jan},
    }
    [kazato-sigss201401]: as a page
  30. 林 晋平, 丁 斌, 加藤 哲平, 佐伯 元司:"ソースコード差分の対話的修正法".In ソフトウェア工学の基礎XX — 第20回ソフトウェア工学の基礎ワークショップ予稿集 (FOSE 2013 in 加賀), pp. 41-46. 加賀, 石川,nov,2013. 貢献賞 受賞.
    ID
    ISBN: 978-4-7649-0452-1
    Abstract
    新旧2版のプログラム要素の対応付けは,差分の抽出やプログラム要素の起源の特定など,ソフトウェア保守における様々なアクティビティの基礎技術となっている.しかし,対応付けの正しさは開発者の意図に依存するため,高精度の構造的な対応付け条件を特定することは難しく,それゆえ自動対応付け手法の出力結果に含まれる不対応や誤対応への対策が求められる.本稿では,最長共通部分列に基づくソースコード差分を対話的に修正する手法を提案する.提案手法では,差分のひとつが得られた際に,その対応付けの好ましくない箇所を分析者が指摘する.指摘に基づき,対応付けに用いる編集グラフの辺のコストを修正し,再計算を行うことにより,分析者の求める差分へ近づけていく.提案手法をツールとして実装し,その実現可能性を示した.
    BibTeX
    @inproceedings{hayashi-fose2013,
        author = {林 晋平 and 丁 斌 and 加藤 哲平 and 佐伯 元司},
        title = {ソースコード差分の対話的修正法},
        booktitle = {ソフトウェア工学の基礎XX --- 第20回ソフトウェア工学の基礎ワークショップ予稿集},
        pages = {41--46},
        year = 2013,
        month = {nov},
    }
    [hayashi-fose2013]: as a page
  31. 星野 大樹, 林 晋平, 佐伯 元司:"ソースコード編集操作の自動グループ化".In ソフトウェア工学の基礎XX — 第20回ソフトウェア工学の基礎ワークショップ予稿集 (FOSE 2013 in 加賀), pp. 107-112. 加賀, 石川,nov,2013.
    ID
    ISBN: 978-4-7649-0452-1
    Abstract
    ソフトウェア構成管理では,ソースコード変更を開発者にとって意味のある単位ごとに分割してコミットを行うこと(分割コミット)が重要となる.しかし開発者は同時に複数の意図の変更を行うことがあり,分割コミットを行わずに様々な意図が混ざったコミットをすることがある.ソースコードの編集操作を収集し,それらをコミット前に分類することで分割コミットの支援を図る既存手法があるものの,分類を手動で行う必要があり,十分に労力の低減ができていない.本稿では複数の基準に基づき,ソースコード編集操作を自動で分類する手法を提案する.提案手法では,Javaソースコードにおけるファイルやクラス,メソッド,コメントおよび編集時間を分類の基準とし,開発者が選択する基準に基づき,編集操作を自動的に分類する.分類に必要な情報は,ソースコードの構文解析により得られた各構文要素の文字範囲情報と,編集操作の編集開始オフセットを比較することによって属性として抽出する.提案手法を実現するツールを開発し,例題へ適用することにより,提案手法が分類の労力を低減することを確認した.
    BibTeX
    @inproceedings{dhoshino-fose2013,
        author = {星野 大樹 and 林 晋平 and 佐伯 元司},
        title = {ソースコード編集操作の自動グループ化},
        booktitle = {ソフトウェア工学の基礎XX --- 第20回ソフトウェア工学の基礎ワークショップ予稿集},
        pages = {107--112},
        year = 2013,
        month = {nov},
    }
    [dhoshino-fose2013]: as a page
  32. 風戸 広史, 林 晋平, 小林 隆志, 大島 剛志, 宮田 俊介, 夏川 勝行, 星野 隆, 佐伯 元司:"反復型アプローチによるソフトウェア機能の捜索と識別の改善".電子情報通信学会技術研究報告, vol. 113,no. 159, pp. 55-60. 北海道立道民活動センター, 北海道,jul,2013.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20130725QBFY/
    Abstract
    機能捜索(feature location)はソフトウェアの機能とその実装箇所を対応づける作業であり,ソフトウェアの理解や変更のための基礎となる.既存の機能捜索手法は分析者が機能を適切に認識していることを前提としており,認識があいまいな状況では十分な効果が得られない.本稿では,機能捜索の結果を用いて機能に対する分析者の認識を更新し,次の機能捜索の入力に反映することにより,機能の捜索と識別を反復的に改善する手法を提案する.提案手法を例題のWebアプリケーションに適用し,その有効性を確認した.
    Feature location (FL) is an activity of developers which identifies correspondence between software features and program elements in source code. Existing FL techniques assumes that developers adequately recognize features to be located and thus are not fully effective when their recognition is ambiguous. This paper proposes an iterative technique for refining both location and definition of features. Using a result of FL, the technique helps developers to update their recognition of features and improve the input of FL in the next iteration. An application example indicates the effectiveness of the approach.
    BibTeX
    @article{kazato-sigss201307,
        author = {風戸 広史 and 林 晋平 and 小林 隆志 and 大島 剛志 and 宮田 俊介 and 夏川 勝行 and 星野 隆 and 佐伯 元司},
        title = {反復型アプローチによるソフトウェア機能の捜索と識別の改善},
        journal = {電子情報通信学会技術研究報告},
        volume = 113,
        number = 159,
        pages = {55--60},
        year = 2013,
        month = {jul},
    }
    [kazato-sigss201307]: as a page
  33. 柳田 拓人, 林 晋平, 佐伯 元司, 三村 秀典:"クラス責務割り当て問題へのファジィ制約充足問題の適用".電子情報通信学会技術研究報告, vol. 113,no. 159, pp. 13-18. 北海道立道民活動センター, 北海道,jul,2013.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20130725TBFZ/
    Abstract
    本稿ではクラスへの責務割り当てをファジィ制約充足問題として定式化することにより自動化を図り,例題に対して解を導出した結果を示す.責務とは各クラスのインスタンスが果たすべき役割を指し,それらをクラスへ適切に割り当てることによって,高品質な設計が実現される.割り当てに際しては,疎結合かつ高凝集な割り当てが望ましいなど,様々な条件を考慮することが望ましい.しかしながら,そのような条件の間にはトレードオフがあるため,現実的には条件を適度に満たす割り当てが求められ,計算機による支援が必要となる.そこで,様々な条件をファジィ制約として表現し,責務割り当てをファジィ制約充足問題として定式化する.これによって,既存の汎用的なアルゴリズムを適用出来るようになり,解としての責務割り当ての導出が可能となる.
    The authors formulate the class responsibility assignment (CRA) problem as the fuzzy constraint satisfaction problem (FCSP) to automate CRA, and show the results of automatic assignments of examples. Responsibilities are contracts or obligations of objects that they should assume; by aligning them to classes appropriately, quality designs realize. Typical conditions of a desirable design are having a low coupling between highly cohesive classes. However, because of a trade-off among such conditions, solutions that satisfy the conditions moderately are desired, and computer assistance is needed. The authors represent such conditions as fuzzy constraints, and formulate CRA as FCSP. That enables to apply common algorithms that solve FCSP to the problem, and to derive solution representing a CRA.
    BibTeX
    @article{takty-sigss201307,
        author = {柳田 拓人 and 林 晋平 and 佐伯 元司 and 三村 秀典},
        title = {クラス責務割り当て問題へのファジィ制約充足問題の適用},
        journal = {電子情報通信学会技術研究報告},
        volume = 113,
        number = 159,
        pages = {13--18},
        year = 2013,
        month = {jul},
    }
    [takty-sigss201307]: as a page
  34. 阿部 達也, 林 晋平, 佐伯 元司:"シーケンス図のパターンに基づくセキュリティ脅威の検出法".電子情報通信学会技術研究報告, vol. 113,no. 24, pp. 1-6. 香川大学, 香川,may,2013.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20130509QB3l/
    Abstract
    システム設計段階において,あらかじめシステムに存在するセキュリティ脅威を検出し対策を講じることによって,より安全で高信頼度のシステムを開発することができる.しかし,脅威の検出にはセキュリティに関する知識が必要であったり,見落としを極力減らす必要があることから,コストや時間がかかる.そこで本稿では,入力されたシナリオシーケンスに対し,あらかじめ知識として保持しているセキュリティ脅威パターンとの比較によって,対象システムに発生しうる脅威を検出し,ミスシナリオとして提示する手法を提案する.シナリオ記述及びセキュリティ脅威パターンの記述において,セキュリティドメインに基づくプロファイルに従ったUML シーケンス図を利用し,セキュリティ脅威パターン作成のための知識として,コモンクライテリアで定められているセキュリティターゲットを用いる.本稿では適用事例を用いて手法の有用性を確認した.
    Detecting security threats of information system in design phase helps to develop secure systems. However, the more threats we try to detect, the more cost and knowledge of security threats is required. In this paper, we present a technique to detect security threats and show negative scenarios with comparing normal scenarios of a business process and the threat patterns created from knowledge of security. The scenarios of a business process are described with sequence diagrams. The knowledge is extracted from the documents called Security Target compliant to the international standard Common Criteria. We show the usefulness of our approach with several case studies.
    BibTeX
    @article{abe-sigss201305,
        author = {阿部 達也 and 林 晋平 and 佐伯 元司},
        title = {シーケンス図のパターンに基づくセキュリティ脅威の検出法},
        journal = {電子情報通信学会技術研究報告},
        volume = 113,
        number = 24,
        pages = {1--6},
        year = 2013,
        month = {may},
    }
    [abe-sigss201305]: as a page
  35. 有賀 顕, 林 晋平, 佐伯 元司:"構文と文章構造に基づく要求仕様書の問題点発見支援".情報処理学会研究報告, vol. 2013-SE-179,no. 4, pp. 1-8. 化学会館, 東京,mar,2013.
    ID
    ISSN: 0919-6072
    Abstract
    要求仕様書は主に自然言語で記述されているため文意のあいまい性などの問題がある.要求分析者がこれらの問題点を認識し発見することが重要である.本論文ではIEEE 830で定義された品質特性をもとに,要求仕様書の文章構造と要求文の構文構造を用いて要求仕様書の問題点を検出する手法を提案する.提案手法では,要求仕様書全体と要求文の解析,さらに要求文間の関係解析を行い要求仕様書中の問題点を検出する.提案手法を自動化した問題点のチェッカーでは非あいまい性など6つの品質特性に関する問題点を提案手法により検出しマーキングを行うことで,使用者に対して問題点の発見を支援する.例題への適用および被験者実験によりチェッカーの有用性を評価した.評価の結果,チェッカーは低くない検出精度を持ち,また特に非あいまい性,検証可能性,追跡可能性について支援効果を持つことが示唆された.
    Some requirements specification documents have several problems such as the ambiguity of sentences because they are mainly written in natural language.It is important for requirements analysts to find and analyze these problems.In this paper, we propose a technique for detecting problems in a requirements specification documents based on the quality characteristics defined in IEEE 830, using the syntactical structure of the specification.Our technique analyzes the structure and relationships of the sentences and the whole of the given specification.A specification checker that automates our technique can support to find the problems over the six quality characteristics.The evaluation results show that the checker has acceptable detection accuracy and the high supporting effects for especially checking unambiguity, verifiability, and traceability.
    BibTeX
    @article{aruga-sigse201303,
        author = {有賀 顕 and 林 晋平 and 佐伯 元司},
        title = {構文と文章構造に基づく要求仕様書の問題点発見支援},
        journal = {情報処理学会研究報告},
        volume = {2013-SE-179},
        number = 4,
        pages = {1--8},
        year = 2013,
        month = {mar},
    }
    [aruga-sigse201303]: as a page
  36. 井上 渉, 林 晋平, 鵜飼 孝典, 佐伯 元司:"要求構造明確化のためのゴールグラフの多次元拡張".電子情報通信学会技術研究報告, vol. 112,no. 496, pp. 25-30. 芝浦工業大学, 東京,mar,2013.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/201303148BcS/
    Abstract
    本論文では, ゴール指向要求分析法において分析者の関心事に基づいたゴール間の関係の理解, および関係の修正を支援するため, 分析者の関心事をゴールの次元, 関心事同士の関係を次元にまたがるゴール間の分解関係に対応させ, ゴールグラフを多次元拡張する. 多次元ゴールグラフではゴール分解の意味が次元間の関係で表現でき, 関心事に基づいてゴールの分解関係を理解しやすくなり, また適切な関係への修正も行いやすくなる. 提案手法を支援するツールを実装し, 次元毎にゴールグラフを表示でき, 特定の関心事に関わるゴールを集中的に分析できるようにした.また要求獲得の事例にツールを適用してその有用性を評価した.
    In this paper, we propose a multi-dimensional extension of goal graphs in goal-oriented requirements analysis in order to support the understanding and modifying of relations between goals. In this method, concerns of a requirements analyst and their relations respectively correspond to dimensions and the decompositions of goals. Based on the definitions of goal decompositions, analysts can understand and repair the relations between goals with their concern using the goals' dimension. Additionally, the selection of goals to analyze is supported by showing goals which only belongs to the focused dimension by the analyst. We have developed a supporting tool and evaluated the efficiency of the method in experiments.
    BibTeX
    @article{inouew-sigkbse201303,
        author = {井上 渉 and 林 晋平 and 鵜飼 孝典 and 佐伯 元司},
        title = {要求構造明確化のためのゴールグラフの多次元拡張},
        journal = {電子情報通信学会技術研究報告},
        volume = 112,
        number = 496,
        pages = {25--30},
        year = 2013,
        month = {mar},
    }
    [inouew-sigkbse201303]: as a page
  37. 林 晋平:"Feature Locationベンチマークの現状と課題".In ウィンターワークショップ2013・イン・那須 論文集 [conference site], pp. 47-48. ラフォーレ那須, 栃木,jan,2013.
    Abstract
    本稿では,Feature Location手法評価のためのベンチマークとして改版履歴に基づくものを取り上げ,その特徴や問題点を分析しながら,ベンチマーク作成の課題について議論する.
    This paper discusses issues and challenges in feature location benchmarks using an existing benchmark based on revision histories.
    BibTeX
    @inproceedings{hayashi-wws2013,
        author = {林 晋平},
        title = {Feature Locationベンチマークの現状と課題},
        booktitle = {ウィンターワークショップ2013・イン・那須 論文集},
        pages = {47--48},
        year = 2013,
        month = {jan},
    }
    [hayashi-wws2013]: as a page
  38. 石尾 隆, 林 晋平:"セッション紹介:ソースコードと機能の対応関係を特定する技術".In ウィンターワークショップ2013・イン・那須 論文集 [conference site], pp. 37-38. ラフォーレ那須, 栃木,jan,2013.
    Abstract
    大規模なソフトウェアに対して適切な変更やテストを実施していくためには,ソフトウェアに対する要求や,開発者が変更したい機能を実現するソースコードを特定する作業が不可欠である. このような作業を支援するために,Concept Location,Feature Location,Impact Analysis,Concern Location,Traceability Recoveryなどの解析技術が提案されている.本セッションでは,これら技術の開発における問題意識,手法の実装や評価実験における技術的な課題について議論し,効果的な技術開発の方法に関する知識を整理したい.
    To maintain a large scale software, developers must identify source code where implements a requirement or a feature to be modified. Program analysis techniques including concept location, feature location, impact analysis, concern location and traceability recovery are proposed to support linking source code with requirements and features. In this session, we would like to discuss technical issues to design, implement and evaluate novel techniques in this area.
    BibTeX
    @inproceedings{ishio-wws2013,
        author = {石尾 隆 and 林 晋平},
        title = {セッション紹介:ソースコードと機能の対応関係を特定する技術},
        booktitle = {ウィンターワークショップ2013・イン・那須 論文集},
        pages = {37--38},
        year = 2013,
        month = {jan},
    }
    [ishio-wws2013]: as a page
  39. 風戸 広史, 大島 剛志, 石尾 隆, 林 晋平:"Feature Location技術を開発者は使いこなせるか".In 第19回ソフトウェア工学の基礎ワークショップ (FOSE 2012 in 湯布院), ポスター発表. 湯布院, 大分,dec,2012.
    BibTeX
    @misc{kazato-fose2012,
        author = {風戸 広史 and 大島 剛志 and 石尾 隆 and 林 晋平},
        title = {Feature Location技術を開発者は使いこなせるか},
        howpublished = {In 第19回ソフトウェア工学の基礎ワークショップ},
        year = 2012,
        month = {dec},
    }
    [kazato-fose2012]: as a page
  40. 林 晋平, 大森 隆行, 善明 晃由, 丸山 勝久, 佐伯 元司:"Historef:編集履歴リファクタリングの支援ツール".In 第19回ソフトウェア工学の基礎ワークショップ (FOSE 2012 in 湯布院), ポスター発表. 湯布院, 大分,dec,2012.
    BibTeX
    @misc{hayashi-fose2012,
        author = {林 晋平 and 大森 隆行 and 善明 晃由 and 丸山 勝久 and 佐伯 元司},
        title = {Historef:編集履歴リファクタリングの支援ツール},
        howpublished = {In 第19回ソフトウェア工学の基礎ワークショップ},
        year = 2012,
        month = {dec},
    }
    [hayashi-fose2012]: as a page
  41. 風戸 広史, 林 晋平, 岡田 敏, 宮田 俊介, 星野 隆, 佐伯 元司:"ソフトウェアの機能に対応する実装構造の抽出と可視化手法の提案".電子情報通信学会技術研究報告, vol. 112,no. 164, pp. 91-96. 公立はこだて未来大学, 北海道,jul,2012.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20120728o0tE/
    Abstract
    プログラムを変更する前に,開発者はまずFeature Locationにより機能に対応するソースコード上の実装箇所を特定し,続いてその箇所に関する静的構造や振る舞いを理解する.本稿では,実行トレースに系列マイニング,形式概念分析を組み合わせて適用することによって,機能の実装箇所を特定するだけではなく,その箇所の構造を半自動的に特定する手法を提案する.提案手法の支援ツールを試作し,Webアプリケーションの例題に適用した結果,提案手法が実現可能であり,また単に機能の実装箇所を特定するよりも理解に役立つことを確認した.
    After a feature is located in source code, developers understand implementation structure around the location from static and/or behavioral point of view. This paper proposes a semi-automatic technique both for locating features and exposing their implementation structures in source code, using a combination of dynamic analysis and two data analysis techniques, sequential pattern mining and formal concept analysis. We have implemented our technique in a supporting tool and applied it to an example of a web application. The result shows that the proposed technique is not only feasible but helpful to understand implementation of features just after they are located.
    BibTeX
    @article{kazato-sigss201207,
        author = {風戸 広史 and 林 晋平 and 岡田 敏 and 宮田 俊介 and 星野 隆 and 佐伯 元司},
        title = {ソフトウェアの機能に対応する実装構造の抽出と可視化手法の提案},
        journal = {電子情報通信学会技術研究報告},
        volume = 112,
        number = 164,
        pages = {91--96},
        year = 2012,
        month = {jul},
    }
    [kazato-sigss201207]: as a page
  42. 風戸 広史, 林 晋平, 岡田 敏, 宮田 俊介, 星野 隆, 佐伯 元司:"多層システムのための形式概念分析に基づくFeature Location手法の提案".電子情報通信学会技術研究報告, vol. 111,no. 481, pp. 139-144. てんぶす那覇, 沖縄,mar,2012.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20120314e0PI/
    Abstract
    複数のレイヤで構成されたソフトウェアでは,レイヤ間に分散したプログラム要素が協調動作して一つの機能を実現するために,機能とプログラム要素群を対応づける作業であるFeature Locationが難しい.そこで,本稿では機能とレイヤ間に分散したプログラム要素群の対応関係を半自動的に抽出する手法を提案する.提案手法ではレイヤごとの実行トレースを併合して形式概念分析への入力として用いることにより,協調動作するプログラム要素を形式概念としてグループ化し,実行トレースの集合と結びつける.Webアプリケーションの例題に提案手法を適用し,3つのレイヤに分散したプログラム要素と機能の対応関係を抽出した事例を示すことにより,手法の実現可能性を示すとともに,現実的なプログラム理解の支援に向けた応用可能性について議論する.
    In multi-layer systems such as web applications, locating features is a challenging problem because each feature is often realized through a collaboration of program elements belonging to different layers. This paper proposes a semi-automatic technique to extract correspondence between features and program elements among layers, by merging execution traces of every layer to feed into formal concept analysis. To show the feasibility of our technique, we applied it to a web application which conforms to the typical three-layer architecture of Java EE and discuss its applicability to other layer systems in the real world.
    BibTeX
    @article{kazato-sigss201203,
        author = {風戸 広史 and 林 晋平 and 岡田 敏 and 宮田 俊介 and 星野 隆 and 佐伯 元司},
        title = {多層システムのための形式概念分析に基づくFeature Location手法の提案},
        journal = {電子情報通信学会技術研究報告},
        volume = 111,
        number = 481,
        pages = {139--144},
        year = 2012,
        month = {mar},
    }
    [kazato-sigss201203]: as a page
  43. 大森 隆行, 丸山 勝久, 林 晋平, 沢田 篤史:"ソフトウェア進化研究に関する動向調査 - IWPSEシリーズを題材に -".電子情報通信学会技術研究報告, vol. 111,no. 481, pp. 121-126. てんぶす那覇, 沖縄,mar,2012.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20120314E0p1/
    Abstract
    著者らが実施したソフトウェア進化研究に関する動向調査について紹介する.本稿ではまず,ソフトウェア進化研究を分類するための新たな基準を提案する.この分類基準では,進化研究を,手法,対象,目的の三つの視点から捉える.ついで,この基準を国際ワークショップであるIWPSEシリーズで発表された文献に適用した分類結果を示す.さらに,この結果から進化研究の動向について考察する.
    We have recently carried out a comprehensive literature review on software evolution. In the review process, we have proposed and adopted a new taxonomy of software evolution research to classify research papers. In this paper we explain our software evolution taxonomy which consists of three perspectives: methods, targets, and objectives. We also discuss research trends on software evolution based on a classification result for papers published in the series of IWPSE proceedings.
    BibTeX
    @article{omori-sigss201203,
        author = {大森 隆行 and 丸山 勝久 and 林 晋平 and 沢田 篤史},
        title = {ソフトウェア進化研究に関する動向調査 -- IWPSEシリーズを題材に --},
        journal = {電子情報通信学会技術研究報告},
        volume = 111,
        number = 481,
        pages = {121--126},
        year = 2012,
        month = {mar},
    }
    [omori-sigss201203]: as a page
  44. 林 晋平:"細粒度のプログラム理解コンテキストの採取と利用について".In ウィンターワークショップ2012・イン・琵琶湖 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2012,no. 1, pp. 91-92. 琵琶湖コンファレンスセンター, 滋賀,jan,2012.
    ID
    ISSN: 1344-0640
    Abstract
    本稿では,プログラム理解の際の開発者のコンテキストを細粒度で採取し,またそれらを対象のプログラム理解の支援に利用する手法について議論する.
    This paper discusses a technique for gathering fine-grained context of program understanding and using them for supporting the understanding activity.
    BibTeX
    @inproceedings{hayashi-wws2012,
        author = {林 晋平},
        title = {細粒度のプログラム理解コンテキストの採取と利用について},
        booktitle = {ウィンターワークショップ2012・イン・琵琶湖 論文集},
        pages = {91--92},
        year = 2012,
        month = {jan},
    }
    [hayashi-wws2012]: as a page
  45. 丸山 勝久, 木津 栄二郎, 大森 隆行, 林 晋平:"プログラム理解支援を目的とした編集操作スライスとその再生".In ソフトウェア工学の基礎XVIII — 第18回ソフトウェア工学の基礎ワークショップ予稿集 (FOSE 2011 in 浅虫温泉), pp. 121-126. 浅虫温泉, 青森,nov,2011.
    ID
    ISBN: 978-4-7649-0419-4
    Abstract
    プログラマが行った編集操作を記録し,それらを自由に再生可能な環境を提供することで,プログラムの時系列的変化を容易に調査できるようになってきた.しかしながら,あるプログラム要素に関係する編集操作が特定の時間帯に集中しているとは限らない.このため,編集操作の再生において,関心のない編集操作を飛ばすための早送りや巻き戻しが繰り返し発生する.本論文では,編集操作履歴全体から特定のメソッドやフィールドに関係のある編集操作だけを抜き出すスライシング手法と,抜き出した編集操作だけを再生するツールを提案する.このツールを用いることで,編集操作を再生する際に無駄な早送りや巻き戻しを削減することができ,プログラム理解の効率的な実施が期待できる.
    BibTeX
    @incollection{maruyama-fose2011,
        author = {丸山 勝久 and 木津 栄二郎 and 大森 隆行 and 林 晋平},
        title = {プログラム理解支援を目的とした編集操作スライスとその再生},
        booktitle = {ソフトウェア工学の基礎XVIII --- 第18回ソフトウェア工学の基礎ワークショップ予稿集},
        pages = {121--126},
        year = 2011,
        month = {nov},
    }
    [maruyama-fose2011]: as a page
  46. 林 晋平, 大森 隆行, 善明 晃由, 丸山 勝久, 佐伯 元司:"ソースコード編集履歴のリファクタリング手法".In ソフトウェア工学の基礎XVIII — 第18回ソフトウェア工学の基礎ワークショップ予稿集 (FOSE 2011 in 浅虫温泉), pp. 61-70. 浅虫温泉, 青森,nov,2011. IEEE Young Researcher Award 受賞.
    ID
    ISBN: 978-4-7649-0419-4
    Abstract
    本稿では,ソースコード編集履歴のリファクタリング手法を提案する.ソフトウェア開発では,ソースコード本体のみならず,その編集の履歴もさまざまに利用されるため,適切に管理された履歴が後段のプロセスに貢献する.しかし,現実には複雑に絡み合った不適切な履歴が生じうる.我々のアプローチでは,編集履歴を,理解性や利用性を向上させるために,その編集内容を変えないよう書き換えるリファクタリングを行う.我々は4つの基本的なリファクタリング及びそれらを組み合わせた2つの大きなリファクタリングを,それらの事前条件も含めて定義した.また,定義したリファクタリングを自動化しコードエディタに組み込んだ支援ツールを実現した.支援ツールを用いることにより,実際に編集履歴のリファクタリングが行えること,またリファクタリングにより分割コミットや変更取り消しなどの有益な応用が可能となることを示す.
    BibTeX
    @incollection{hayashi-fose2011a,
        author = {林 晋平 and 大森 隆行 and 善明 晃由 and 丸山 勝久 and 佐伯 元司},
        title = {ソースコード編集履歴のリファクタリング手法},
        booktitle = {ソフトウェア工学の基礎XVIII --- 第18回ソフトウェア工学の基礎ワークショップ予稿集},
        pages = {61--70},
        year = 2011,
        month = {nov},
    }
    [hayashi-fose2011a]: as a page
  47. 林 晋平, 小林 隆志:"ソフトウェア工学勉強会への誘い".In 第18回ソフトウェア工学の基礎ワークショップ (FOSE 2011 in 浅虫温泉), ポスター発表. 浅虫温泉, 青森,nov,2011.
    BibTeX
    @misc{hayashi-fose2011b,
        author = {林 晋平 and 小林 隆志},
        title = {ソフトウェア工学勉強会への誘い},
        howpublished = {In 第18回ソフトウェア工学の基礎ワークショップ},
        year = 2011,
        month = {nov},
    }
    [hayashi-fose2011b]: as a page
  48. 秋山 幹博, 林 晋平, 小林 隆志, 佐伯 元司:"責務記述に基づくクラスの責務割り当て支援".電子情報通信学会技術研究報告, vol. 110,no. 458, pp. 73-78. 沖縄県青年会館, 沖縄,mar,2011.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20110307h0fS/
    Abstract
    オブジェクト指向開発では,設計にあたって各クラスに適切に責務を割り当てることにより,後の開発工程をより円滑に進めることができる.適切な責務割り当ての基準としてGRASPなどの指針があるが,その適用方針は定かではなく,依然として責務割り当ては困難である.これを解決するため,責務割り当てが適切でない箇所を自動的に検出して改善案を作業者に提示することにより,適切な責務割り当ての実現を支援する手法を提案する.提案手法では,責務の主な処理やその対象に関する情報を細分化する責務記述形式と,それに基づく責務割り当ての代替案の提示規則を定義する.代替案の提示規則はGRASPに基づいている.作業者は,提示された代替案に基づいて責務割り当てを洗練し,最終的な責務割り当てを決定する.提案手法を実現するツールを実装し,予備実験を行ったところ,提案手法によって高品質な責務割り当てが実現できる傾向があることを確認した.
    In object-oriented design, Class Responsibility Assignment (CRA) is important. However, it is not easy to detect where to improve CRA though there are some principles of CRA such as GRASP. In this paper, we propose a technique for supporting achievement of appropriate CRA by detecting inappropriate CRA automatically and suggesting candidates of appropriate CRAs to designers. In the technique, we have defined a responsibility description form which information included in a responsibility can be separately specified. Moreover, recommendation rules of alternatives of CRA based on GRASP are defined. Responsibility descriptions are analyzed with these rules. A designer improves a CRA based on suggested alternatives and achieves a more appropriate CRA. We have implemented a tool supporting the proposed technique and validated its usefulness by preliminary experiments.
    BibTeX
    @article{akiyama-sigss201103,
        author = {秋山 幹博 and 林 晋平 and 小林 隆志 and 佐伯 元司},
        title = {責務記述に基づくクラスの責務割り当て支援},
        journal = {電子情報通信学会技術研究報告},
        volume = 110,
        number = 458,
        pages = {73--78},
        year = 2011,
        month = {mar},
    }
    [akiyama-sigss201103]: as a page
  49. 鵜飼 孝典, 林 晋平, 佐伯 元司:"ソフトウェア開発会議におけるステークホルダと関心事の可視化ツール".情報処理学会研究報告, vol. 2011-GN-79,no. 16, pp. 1-8. 熊本市現代美術館, 熊本,mar,2011. 優秀発表賞 受賞.
    ID
    ISSN: 0919-6072
    URL
    http://www.bookpark.ne.jp/cm/ipsj/search.asp?flag=6&keyword=IPSJ-GN11079016
    Abstract
    ソフトウェア開発は, ステークホルダによる協調作業である. プロジェクトマネージャや分析者にとって, ステークホルダの関心事を理解し, ステークホルダの偏りや不足などの潜在的な問題を知っておくことは重要である. 我々は, システムの信頼性, 効率性, 使用性等のシステム品質に関する重要な関心事をもれなく獲得するためにステークホルダの不足や偏りを発見することを支援するツールを提案している. 提案ツールでは, ゴール指向分析手法の一つであるAGORA の成果物であるゴールグラフを対象に, 要求分析作業中にステークホルダと, ステークホルダのシステム品質に関する関心事の関係をアンカーマップを使って可視化する. 本論では, ステークホルダとステークホルダの関心事の関係を可視化するツールの実装と, その評価実験について, 少ないサンプルではあるが, 良好な結果が得られたことを述べる.
    Software development is a cooperative work by stakeholders. It is important for project managers and analysts to understand stakeholder concerns and to identify potential problems such as imbalance of stakeholders or lack of stakeholders. A tool which visualizes the strength of stakeholders' interest of concern on two dimensional screens has been proposed. The proposed tool generates an anchored map from an attributed goal graph by AGORA, which is an extended version of goal-oriented analysis methods. It has information on stakeholders' interest to concerns and its degree as the attributes of goals. In this paper, an integrated implementation of an anchored map viewer and an goal graph editor is shown and experimental evaluation is described. Results show the tool's usefulness.
    BibTeX
    @article{ugai-siggn201103,
        author = {鵜飼 孝典 and 林 晋平 and 佐伯 元司},
        title = {ソフトウェア開発会議におけるステークホルダと関心事の可視化ツール},
        journal = {情報処理学会研究報告},
        volume = {2011-GN-79},
        number = 16,
        pages = {1--8},
        year = 2011,
        month = {mar},
    }
    [ugai-siggn201103]: as a page
  50. 鵜飼 孝典, 林 晋平, 佐伯 元司:"ゴールグラフの品質向上支援ツールとその評価".電子情報通信学会技術研究報告, vol. 110,no. 468, pp. 1-6. 別府国際コンベンションセンター, 大分,mar,2011.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20110310O04W/
    Abstract
    本稿では, 属性つきゴールグラフの品質向上を支援するツールを提案し, このツールの有効性を示す実験について述べる. ゴールに対する品質特性を, IEEE Std 830に記された要求仕様書が備えるべき品質特性に準じて, 定義した. 支援ツールでは, これらの品質特性を満たさないゴールをユーザに提示する. 検証実験により, ユーザが考慮すべき範囲のしぼり込みが短時間で行なえるため, 効率的に作業が行なえることが分かり, ツールの有効性を示すことができた.
    In this article, a supporting tool to develop high-quality goal graphs is proposed and the result of an experiment is described. The tool highlights the goals which do not satisfy quality properties. The quality properties are defined based on IEEE Std 830. The result of an experiment shows that users can modify goal graphs rapidly because they can focus on parts that were not satisfy the quality properties.
    BibTeX
    @article{ugai-sigkbse201103,
        author = {鵜飼 孝典 and 林 晋平 and 佐伯 元司},
        title = {ゴールグラフの品質向上支援ツールとその評価},
        journal = {電子情報通信学会技術研究報告},
        volume = 110,
        number = 468,
        pages = {1--6},
        year = 2011,
        month = {mar},
    }
    [ugai-sigkbse201103]: as a page
  51. 鵜飼 孝典, 林 晋平, 佐伯 元司:"ゴールグラフの品質向上支援ツール".In ウィンターワークショップ2011・イン・修善寺 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2011,no. 2, pp. 39-40. ラフォーレ修善寺, 静岡,jan,2011.
    ID
    ISSN: 1344-0640
    Abstract
    本稿では, 属性つきゴールグラフの品質向上を支援するツールを提案し, このツールの有効性を示す実験について述べる. ゴールに対する品質特性を, IEEE Std 830に記された要求仕様書が備えるべき品質特性に準じて, 定義した. 支援ツールでは, これらの品質特性を満たさないゴールをユーザに示す. 検証実験により, 調査すべき範囲のしぼり込みが短時間で行なえるため, 効率的に作業が行なえることが分かり, ツールの有効性を示すことができた.
    In this article, a supporting tool to high-quality goal graphs is proposed and the result of an experiment is described. The tool highlights the goals which do not satisfy quality properties. The quality properties are defined based on IEEE Std 830. The result of an experiment shows that users can modify goal graphs in a shorter time because they can narrow down the area to focus.
    BibTeX
    @inproceedings{ugai-wws2011,
        author = {鵜飼 孝典 and 林 晋平 and 佐伯 元司},
        title = {ゴールグラフの品質向上支援ツール},
        booktitle = {ウィンターワークショップ2011・イン・修善寺 論文集},
        pages = {39--40},
        year = 2011,
        month = {jan},
    }
    [ugai-wws2011]: as a page
  52. 林 晋平:"変更履歴のリファクタリングに向けて".In ウィンターワークショップ2011・イン・修善寺 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2011,no. 2, pp. 21-22. ラフォーレ修善寺, 静岡,jan,2011.
    ID
    ISSN: 1344-0640
    Abstract
    本稿では,後の理解や利用が容易となるよう変更をその効果を変えないまま再構成する,変更履歴のリファクタリング手法について議論する.
    This paper discusses techniques for {\it refactoring change histories} for improving understandability and usability of them without modifying their effects.
    BibTeX
    @inproceedings{hayashi-wws2011,
        author = {林 晋平},
        title = {変更履歴のリファクタリングに向けて},
        booktitle = {ウィンターワークショップ2011・イン・修善寺 論文集},
        pages = {21--22},
        year = 2011,
        month = {jan},
    }
    [hayashi-wws2011]: as a page
  53. 小林 隆志, 林 晋平:"データマイニング技術を応用したソフトウェア構築・保守支援".In ソフトウェア工学の基礎XVII — 第17回ソフトウェア工学の基礎ワークショップ予稿集 (FOSE 2010 in 越後湯沢), pp. 1-2. 越後湯沢, 新潟,nov,2010.
    ID
    ISBN: 978-4-7649-0399-9
    Slide
    BibTeX
    @incollection{tkobaya-fose2010,
        author = {小林 隆志 and 林 晋平},
        title = {データマイニング技術を応用したソフトウェア構築・保守支援},
        booktitle = {ソフトウェア工学の基礎XVII --- 第17回ソフトウェア工学の基礎ワークショップ予稿集},
        pages = {1--2},
        year = 2010,
        month = {nov},
    }
    [tkobaya-fose2010]: as a page
  54. 鵜飼 孝典, 林 晋平, 佐伯 元司:"属性つきゴールグラフにおけるゴールの品質特性".In ソフトウェア工学の基礎XVII — 第17回ソフトウェア工学の基礎ワークショップ予稿集 (FOSE 2010 in 越後湯沢), pp. 5-14. 越後湯沢, 新潟,nov,2010.
    ID
    ISBN: 978-4-7649-0399-9
    Abstract
    この論文では,属性つきゴール指向要求分析法(AGORA)において,ゴールや枝に付加された属性値を活用し,ゴール指向分析の成果物であるゴールグラフの各ゴールの品質特性を評価する手法を提案する.ゴール指向分析で得られるゴールグラフの各ゴールに対して品質特性を形式的に定義することにより,ゴールグラフの品質を下げる要因になるゴールを計算により同定することが可能になる.ゴールに対する品質特性は,ステークホルダの関心に基づいて行なう.さらに実験により,これらの特性が要求仕様の品質向上に貢献することを示す.
    This paper proposes a technique to measure quality characteristics of goals by using attribute values attached to goals and edges, in attributed goal-oriented analysis (AGORA). It enables to identify the goal that is a factor to lower the quality in the goal graph to define the quality property in each goal in a goal graph. The quality property to the goal is defined in a formal way based on stakeholder's concern. In addition, the goal where each quality property is not filled is formally defined from this definition. It is shown that these characteristics contribute to the quality improvement of the specification by the experiment.
    BibTeX
    @incollection{ugai-fose2010,
        author = {鵜飼 孝典 and 林 晋平 and 佐伯 元司},
        title = {属性つきゴールグラフにおけるゴールの品質特性},
        booktitle = {ソフトウェア工学の基礎XVII --- 第17回ソフトウェア工学の基礎ワークショップ予稿集},
        pages = {5--14},
        year = 2010,
        month = {nov},
    }
    [ugai-fose2010]: as a page
  55. 関根 克幸, 林 晋平, 佐伯 元司:"Feature Locationを用いたソースコード理解の対話的支援".In ソフトウェアエンジニアリング最前線2010 — ソフトウェアエンジニアリングシンポジウム2010予稿集 (SES 2010), pp. 9-16. 東洋大学 白山キャンパス, 東京,aug,2010. 最優秀論文賞, 山下記念研究賞 受賞.
    ID
    ISBN: 978-4764903944
    Abstract
    本稿ではFeature Location(FL)を用いて対話的にソフトウェア機能の実装を理解する手法を提案する.既存のFL手法は理解コストの削減に寄与するものの,機能に対応するコード片特定のための入力の構築は依然として難しい.提案手法では,FLの入力は利用者とシステムとの対話により段階的に改善されていく.利用者は,FLにより発見したコード片を実際に読み,得た理解をもとに入力クエリを改善する.さらに,読んだコード片が理解に貢献したかの判断をシステムに与える適応フィードバックによりFLの評価関数を改善し,より適切な結果を得る.FLとコード片の読解,フィードバックを対話的に繰り返すことにより,利用者は効率的に機能の実装を理解する.事例により非対話的手法との比較を行った結果,提案手法は理解の効率化に貢献することがわかった.
    This paper proposes an interactive approach for effectively understanding a feature implementation by applying feature location (FL). Although existing FL techniques can reduce the understanding cost, it is still open issue to construct the appropriate inputs for which we identify the locations of features in source code. In our approach, the inputs of FL are incrementally improved by the interaction between users and the FL system. By understanding a code fragment obtained by FL, we can find more appropriate queries from the identifiers in the fragment. Furthermore, the relevance feedback mechanism by partially judging whether a fragment is required to understand improves the evaluation function of FL, and users then can obtain more accurate results. Case studies show that our interactive approach is feasible and can reduce the understanding cost more effectively than the non-interactive approach.
    BibTeX
    @incollection{sekine-ses2010,
        author = {関根 克幸 and 林 晋平 and 佐伯 元司},
        title = {Feature Locationを用いたソースコード理解の対話的支援},
        booktitle = {ソフトウェアエンジニアリング最前線2010 --- ソフトウェアエンジニアリングシンポジウム2010予稿集},
        pages = {9--16},
        year = 2010,
        month = {aug},
    }
    [sekine-ses2010]: as a page
  56. タンタムマチット シリナット, 林 晋平, 佐伯 元司:"リファクタリングの抽出・適用によるソースコード差分の理解支援".In ソフトウェアエンジニアリング最前線2010 — ソフトウェアエンジニアリングシンポジウム2010予稿集 (SES 2010), pp. 17-20. 東洋大学 白山キャンパス, 東京,aug,2010. 学生奨励賞 受賞.
    ID
    ISBN: 978-4764903944
    Abstract
    ソフトウェア開発では,様々な場面で,同じプロジェクトの新旧版を比較し,そのソースコード差分を理解する.しかし,リファクタリングが行われた版間ではリファクタリングとそうでない変更の差分が混在し,理解が難しくなる.本稿では,ソースコード差分からリファクタリングを抽出し, ソースコードに適用することにより,新旧版間のリファクタリングの影響を除外する手法を提案する.また,抽出したリファクタリングの逆操作を新版に適用し,旧版の識別子で表す差分の表示方法も提案した.支援ツールを実装し,予備評価を行った結果では,平均で19\%以上のソースコード差分を減少させることができた.
    In various situations of software development, comparing and understanding the difference between old and new versions of project is required. However, if refactorings are performed between those versions, the source code difference will be intermingled and the understanding will become difficult. In this paper, we propose a technique to support the understanding of source code difference by extracting the refactorings and performing them to the source code. We also propose the old-version-view which shows the difference by using the elements of the old version. Finally, we have developed a support tool and applied it to several programs. The result shown that our technique can decrease more than 19 percent of source code difference in average.
    BibTeX
    @incollection{zui-ses2010,
        author = {タンタムマチット シリナット and 林 晋平 and 佐伯 元司},
        title = {リファクタリングの抽出・適用によるソースコード差分の理解支援},
        booktitle = {ソフトウェアエンジニアリング最前線2010 --- ソフトウェアエンジニアリングシンポジウム2010予稿集},
        pages = {17--20},
        year = 2010,
        month = {aug},
    }
    [zui-ses2010]: as a page
  57. 林 晋平, 佐伯 元司:"編集操作の分類に基づくソースコード差分の構造化".電子情報通信学会技術研究報告, vol. 109,no. 456, pp. 61-66. 鹿児島大学 郡元キャンパス, 鹿児島,mar,2010.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20100308naws/
    Abstract
    本稿ではソースコードの編集操作を変更意図ごとに分類することにより,修正を表す差分を意図ごとに構造化する手法を提案する.提案手法では,開発者はソフトウェア開発環境上でソースコードの編集に加えて意図の切り替えのタイミングを明示することにより,各編集操作を意図ごとに分類する.分類結果をもとに編集操作を並べ替えることにより,ソースコード差分を意図ごとのまとまりに分割できる.本稿では,並べ替えのアルゴリズムを与え,その自動化ツールのプロトタイプを実現した.
    This paper proposes a technique for structuring source code deltas on a developer's intentions. In this technique, the developer classifies his/her editing operations by annotating the time series of the editing history with the switching information of the intentions. Based on the classification, the history is automatically sorted and converted to appropriate patches to be committed. This paper also shows algorithms for automating the structuring process and a prototyping tool to implement them.
    BibTeX
    @article{hayashi-sigss201003,
        author = {林 晋平 and 佐伯 元司},
        title = {編集操作の分類に基づくソースコード差分の構造化},
        journal = {電子情報通信学会技術研究報告},
        volume = 109,
        number = 456,
        pages = {61--66},
        year = 2010,
        month = {mar},
    }
    [hayashi-sigss201003]: as a page
  58. 善明 晃由, 林 晋平, 佐伯 元司:"振る舞いモデルを用いたフレームワーク利用支援ツール".電子情報通信学会技術研究報告, vol. 109,no. 456, pp. 31-36. 鹿児島大学 郡元キャンパス, 鹿児島,mar,2010.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/201003084awT/
    Abstract
    本稿では,振る舞いモデルからスケルトンコードや設定ファイルを生成することで,フレームワークの利用を支援するツールを提案する.提案するツールでは,フレームワークの動作モデルにカスタマイズ操作を関連付け,動作モデルと振る舞い要求との対応関係に基づきカスタマイズ操作を適用することでコード生成を行う.振る舞い要求がツールによりフレームワークモデルと自動的に対応付けられるため,利用者はフレームワークの詳細を理解することなくフレームワークの利用法を特定できる.
    This paper proposes a tool which generates a skeleton code and configuration files to support framework-based software development. The framework models that the tool uses include behavior and customization operations. The skeleton code and configuration files are generated by applying the customization operations based on mappings of requirements specifications to the behavioral model of frameworks. The requirements specification is automatically mapped to the framework model by the tool. Therefore, users of the tool can identify the usage of the framework without deep understanding of the framework.
    BibTeX
    @article{zenmyo-sigss201003,
        author = {善明 晃由 and 林 晋平 and 佐伯 元司},
        title = {振る舞いモデルを用いたフレームワーク利用支援ツール},
        journal = {電子情報通信学会技術研究報告},
        volume = 109,
        number = 456,
        pages = {31--36},
        year = 2010,
        month = {mar},
    }
    [zenmyo-sigss201003]: as a page
  59. 高久 陽平, 林 晋平, 佐伯 元司:"ユースケース記述からの状態遷移モデル生成".情報処理学会研究報告, vol. 2010-SE-167,no. 17, pp. 1-8. 国立情報学研究所,東京,mar,2010. 学生研究賞,CS領域奨励賞 受賞.
    ID
    ISSN: 0919-6072
    URL
    http://fw8.bookpark.ne.jp/cm/ipsj/search.asp?flag=6&keyword=IPSJ-SE10167017
    Abstract
    ユースケース記述はソフトウェア開発における要求分析工程で用いられる.しかし,自然言語での記述は非形式的なため,ユースケース記述を網羅的に分析することは困難である.そこで,本論文ではユースケース記述からの状態遷移モデルの生成法を提案する.提案手法ではまず,ユースケース記述中の自然言語記述を解析し,格フレームを用いた形式的表現に変換する.次に,動詞の類義・対義語関係を用いて格フレームから状態変数を抽出する.ユースケース記述中の動作系列間の順序関係と,ユースケース間の関係を遷移として抽出し,状態遷移モデルを生成する.生成された状態遷移モデルをモデルチェッカに適用することで,ユースケース記述の分析を支援する.提案手法を実装した支援ツールを用いてユースケース記述を分析した結果,ユースケース記述が満たしている性質とそうでない性質を正確に判別することができた.
    Use case descriptions are often used at the requirements analysis phase in a software development process. Since descriptions written by a natural language are informal, it is difficult to analyze them exhaustively. This paper proposes a method to generate state transition models from use case descriptions. First, we transform the descriptions to case frames. Second, we generate state variables from the case frames by the synonym and antonym relationships of the verbs. Finally, we generate state transition models, extracting inner use case transitions by the execution order of each use case and inter use case transitions by the pre/post-conditions of them. We have implemented a supporting tool for automating the method. A case study for applying the tool to use case descriptions shows the feasibility of the method.
    BibTeX
    @article{yohei-sigse201003,
        author = {高久 陽平 and 林 晋平 and 佐伯 元司},
        title = {ユースケース記述からの状態遷移モデル生成},
        journal = {情報処理学会研究報告},
        volume = {2010-SE-167},
        number = 17,
        pages = {1--8},
        year = 2010,
        month = {mar},
    }
    [yohei-sigse201003]: as a page
  60. 佐伯 元司, 林 晋平, 海谷 治彦:"コモンクライテリアをドメイン知識としたゴール指向セキュリティ要求獲得法".電子情報通信学会技術研究報告, vol. 109,no. 432, pp. 37-42. 九州工業大学 天神サテライトキャンパス, 福岡,mar,2010.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20100305GauS/
    Abstract
    本稿では,セキュリティ機能要求を抽出するために,コモンクライテリアに準拠して書かれた文書(セキュリティターゲット)を活用する手法を述べる.セキュリティターゲットを機能要求から,脅威やセキュリティ対策を識別するための知識ソースとして用いる.我々の手法はオントロジを用いたゴール指向要求分析法(GOORE)に組み込まれている.
    This paper proposes the usage of security targets, which are documents compliant to Common Criteria (ISO/IEC 15408), as related knowledge sources to identify security functional requirements from functional requirements through eliciting threats and security objectives. Our proposed technique has been combined with GOORE.
    BibTeX
    @article{saeki-sigkbse201003,
        author = {佐伯 元司 and 林 晋平 and 海谷 治彦},
        title = {コモンクライテリアをドメイン知識としたゴール指向セキュリティ要求獲得法},
        journal = {電子情報通信学会技術研究報告},
        volume = 109,
        number = 432,
        pages = {37--42},
        year = 2010,
        month = {mar},
    }
    [saeki-sigkbse201003]: as a page
  61. 林 晋平:"時系列への注釈に基づくソースコード変更の再構成".In ウィンターワークショップ2010・イン・倉敷 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2010,no. 3, pp. 15-16. 倉敷市芸文館, 岡山,jan,2010.
    ID
    ISSN: 1344-0640
    Abstract
    本稿では,ソースコードの編集履歴を開発者の編集意図ごとの集まりに再構成する手法を提案する.提案手法では,時系列に基づき記録したソースコード編集履歴に意図の切替の注釈を加えることによりこれを行う.
    This paper proposes a technique to reorganize source code changes on a developer's intentions. The technique is done by annotating the time series of edit operations with the switching information of the intentions.
    BibTeX
    @inproceedings{hayashi-wws2010,
        author = {林 晋平},
        title = {時系列への注釈に基づくソースコード変更の再構成},
        booktitle = {ウィンターワークショップ2010・イン・倉敷 論文集},
        pages = {15--16},
        year = 2010,
        month = {jan},
    }
    [hayashi-wws2010]: as a page
  62. 林 晋平:"類似コードをまとめるためのコード記述時における開発者の利用".In ソースコードの類似性ワークショップ (JWSCS 2009), co-located with SES 2009. sep,2009.
    URL
    http://ses2009.minnie.ai.kyutech.ac.jp/cfpws3.html#ws-3
    Abstract
    類似しているソースコード片を1つにまとめることは有用だが,そのためにはまとめる効果とコストのトレードオフを考慮した判断が求められる.効果や変更可能性の判断の一部を該当コードの開発者によりコード記述時に行うことが,コード片をまとめる判断のコスト低下につながる.
    BibTeX
    @misc{hayashi-jwscs2009,
        author = {林 晋平},
        title = {類似コードをまとめるためのコード記述時における開発者の利用},
        howpublished = {In ソースコードの類似性ワークショップ},
        year = 2009,
        month = {sep},
    }
    [hayashi-jwscs2009]: as a page
  63. 下滝 亜里, 林 晋平, 青山 幹雄:"モデルに基づくデザインパターンの進化".In ソフトウェアエンジニアリング最前線2009 — ソフトウェアエンジニアリングシンポジウム2009予稿集 (SES 2009), pp. 83-88. 東京女子大学, 東京,sep,2009.
    ID
    ISBN: 978-4764903715
    Abstract
    デザインパターンの有効性を保つためには,デザインパターンの適切な進化が必要である.しかし,デザインパターンは非形式的に記述されるため,その構造の把握は容易でなく,誤った進化を引き起こす.デザインパターンの進化を支援する手法とツールは,明確化された各デザインパターンの構造,および進化の妥当性の確認基準を必要とする.本稿では,デザインパターンの構造のモデル化と構造モデルに基づくパターン進化を提案する.DECORATORパターンの進化を事例とし,モデルに基づきパターン進化を表現できることを示す.また,進化の妥当性の確認基準として利用できる構造特性が得られることを示す.
    To preserve the effectiveness of design patterns, we must evolve design patterns appropriately. However, evolving design patterns is not an easy task because informally described design patterns are difficult to understand the underlying structure. To develop methods and tools for supporting the evolution, we first need to make the structure of design patterns explicit, and need a set of criteria for validating the evolution. In this article we propose a model-based approach for evolving design patterns in terms of their structures. We validate our approach with the evolution of the DECORATOR pattern as a case study. We then propose a structural property to be used as an evolution criterion.
    BibTeX
    @incollection{asato-ses2009,
        author = {下滝 亜里 and 林 晋平 and 青山 幹雄},
        title = {モデルに基づくデザインパターンの進化},
        booktitle = {ソフトウェアエンジニアリング最前線2009 --- ソフトウェアエンジニアリングシンポジウム2009予稿集},
        pages = {83--88},
        year = 2009,
        month = {sep},
    }
    [asato-ses2009]: as a page
  64. Motoshi Saeki, Shinpei Hayashi, Haruhiko Kaiya:"Tool Support for Requirements Changes in AGORA".In ソフトウェアエンジニアリング最前線2009 — ソフトウェアエンジニアリングシンポジウム2009予稿集 (SES 2009), pp. 49-50. 東京女子大学, 東京,sep,2009.
    ID
    ISBN: 978-4764903715
    Abstract
    This paper presents a supporting tool for requirements changes in Attributed Goal Oriented Requirements Analysis (AGORA), which is an extended version of goal-oriented analysis. It is based on the presentation that the authors had in Requirements Engineering Conference 2008 (RE2008).
    BibTeX
    @incollection{saeki-ses2009,
        author = {Motoshi Saeki and Shinpei Hayashi and Haruhiko Kaiya},
        title = {Tool Support for Requirements Changes in AGORA},
        booktitle = {ソフトウェアエンジニアリング最前線2009 --- ソフトウェアエンジニアリングシンポジウム2009予稿集},
        pages = {49--50},
        year = 2009,
        month = {sep},
    }
    [saeki-ses2009]: as a page
  65. 関根 克幸, 善明 晃由, 林 晋平, 佐伯 元司:"動的スライシングを用いた漸進的Feature Location手法".電子情報通信学会技術研究報告, vol. 109,no. 170, pp. 25-30. 北見工業大学, 北海道,aug,2009.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20090806LaoL/
    Abstract
    ソフトウェアの保守プロセスでは,保守対象の機能の実装上の振る舞いを理解する必要があるため,対象機能の実装箇所特定(Feature Location)が重要である.Feature Locationでは,対象ソフトウェアに対する十分な事前知識なしに,必要な情報を過不足なく取得できることが望まれる.本論文では動的スライシングを応用したFeature Location手法を提案する.提案手法では実行系列から抽出されるスライスを対象機能に対応する実装箇所の候補とみなし,スライスとその包含関係からなるグラフ上で最適なスライスを探索する.入力された対象機能の特徴とスライスの類似性に基づいて対話的に探索することで,漸進的なFeature Locationが行える.本研究では手法を実現するツールを実装するとともに,事例によってその有用性を確認した.
    To understand the behavior of a feature in the software maintenance process, identifying the location in which the feature is implemented, i.e., feature location, is important. Feature location should be performed without rich knowledge of the implementation. In this paper, we propose an incremental feature location technique using dynamic slicing. In the technique, slices extracted from an execution trace are regarded as candidate portions in which the feature is implemented. To assist maintainers to find the suitable slice, similarity between the slices and characteristics of the feature is calculated. By inputting the characteristics, the maintainers can interactively search for the suitable slice on the graph consisting of the slices and the inclusion relations based on the similarity.
    BibTeX
    @article{sekine-sigss200908,
        author = {関根 克幸 and 善明 晃由 and 林 晋平 and 佐伯 元司},
        title = {動的スライシングを用いた漸進的Feature Location手法},
        journal = {電子情報通信学会技術研究報告},
        volume = 109,
        number = 170,
        pages = {25--30},
        year = 2009,
        month = {aug},
    }
    [sekine-sigss200908]: as a page
  66. 風戸 広史, Rafael Weiss, 林 晋平, 小林 隆志, 佐伯 元司:"ベイジアンネットワークを用いた実装プラットフォームの選択支援".情報処理学会研究報告, vol. 2009-SE-165,no. 3, pp. 1-8. 北陸先端科学技術大学院大学,金沢,jul,2009.
    ID
    ISSN: 0919-6072
    URL
    http://id.nii.ac.jp/1001/00062654/
    Abstract
    実装プラットフォームの組み合わせがシステム全体の品質特性にどのような影響を及ぼすかを把握することは重要である.本稿では品質特性と実装プラットフォームの因果関係をベイジアンネットワークでモデル化し,実装プラットフォームの選択を支援する手法を提案する.また,ベイジアンネットワークの検証ツール上に提案手法を実装し,業務アプリケーションの例題へ適用することによりその有効性を示す.
    It is important to understand how a combination of implementation platforms influences quality attributes on a system. In this paper, we propose a technique to choose implementation platforms by modeling casual dependencies between requirements and platforms probabilistically using Bayesian networks. We have implemented our technique on a Bayesian network tool and applied it to a case study of a business application to show its effectiveness.
    BibTeX
    @article{kazato-sigse200907,
        author = {風戸 広史 and Rafael Weiss and 林 晋平 and 小林 隆志 and 佐伯 元司},
        title = {ベイジアンネットワークを用いた実装プラットフォームの選択支援},
        journal = {情報処理学会研究報告},
        volume = {2009-SE-165},
        number = 3,
        pages = {1--8},
        year = 2009,
        month = {jul},
    }
    [kazato-sigse200907]: as a page
  67. Rafael Weiss, Hiroshi Kazato, Shinpei Hayashi, Motoshi Saeki:"Platform Independent Model Transformation based on Architectural Patterns".情報処理学会研究報告, vol. 2009-SE-165,no. 4, pp. 1-10. 北陸先端科学技術大学院大学,金沢,jul,2009.
    ID
    ISSN: 0919-6072
    URL
    http://id.nii.ac.jp/1001/00062655/
    Abstract
    In this paper, we present the development of a model-driven approach to transform platform independent models (PIMs) based on architectural patterns. Model Transformation is a fundamental concept in nowadays software development to manipulate models during its lifecycle e.g. due to changing requirements or platform technologies. We use model transformation techniques to transform profile-enriched UML2 models into platform specific models (PSMs). These PSMs could be used later as an input for common code generation frameworks to derive platform specific implementations (PSIs). As an example of a possible architectural pattern, we define a UML profile that is based on the well-known Model-View-Controller (MVC) pattern, an architectural pattern commonly used in software engineering to isolate business logic from user interface considerations.
    BibTeX
    @article{rweiss-sigse200907,
        author = {Rafael Weiss and Hiroshi Kazato and Shinpei Hayashi and Motoshi Saeki},
        title = {Platform Independent Model Transformation based on Architectural Patterns},
        journal = {情報処理学会研究報告},
        volume = {2009-SE-165},
        number = 4,
        pages = {1--10},
        year = 2009,
        month = {jul},
    }
    [rweiss-sigse200907]: as a page
  68. 佐伯 元司, 林 晋平, 海谷 治彦:"属性つきゴール指向要求分析法の支援のための統合ツール".電子情報通信学会技術研究報告, vol. 109,no. 40, pp. 13-18. 秋田大学, 秋田,may,2009.
    ID
    ISSN: 0913-5685
    URL
    http://www.ieice.org/ken/paper/20090521CaM5/
    Abstract
    著者らが開発した属性を付加したゴールグラフに基づく要求分析法を支援するツールについて述べる.このツールは要求獲得から要求管理までのプロセスを継ぎ目なく支援する.
    This paper presents an integrated supporting tool for requirements analysis using attributed goal graphs. The tool assists seemlessly requirements analysts and stakeholders in their activities for requirements analysis.
    BibTeX
    @article{saeki-sigss200905,
        author = {佐伯 元司 and 林 晋平 and 海谷 治彦},
        title = {属性つきゴール指向要求分析法の支援のための統合ツール},
        journal = {電子情報通信学会技術研究報告},
        volume = 109,
        number = 40,
        pages = {13--18},
        year = 2009,
        month = {may},
    }
    [saeki-sigss200905]: as a page
  69. 吉川 嵩志, 林 晋平, 佐伯 元司:"ドメインオントロジを用いた自然言語文書とソースコード間の追跡可能性の復元".情報処理学会研究報告, vol. 2009,no. 31, pp. 129-136. 化学会館,東京,mar,2009.
    ID
    ISSN: 0919-6072
    Abstract
    ソフトウェアに関わる自然言語文書とソースコードの間の追跡可能性を復元する手法が望まれる.本稿では,ドメインオントロジを用いてソフトウェアの機能を記述した自然言語文書とソースコードとを対応付ける手法を提案する.文書中の単語とコード上の識別子との類似性に基づく関係と,コード上のメソッド呼び出し関係の評価にオントロジによる意味的関係を考慮することで,詳細ではない文書に対しても高精度の対応付けを行う.オープンソースソフトウェアJDraw に対する適用事例では,オントロジを用いない場合と比較して高精度の対応付け結果を得た.
    Recovering traceability links between a source code and their NL documents is significant. In this paper, we propose a technique for recovering the links between functional descriptions and a source code using domain ontologies. By using semantic relationships of the domain ontologies in addition to method-call relationships and the similarity between an identifier on the code and words in the descriptions, we can detect source code fragments corresponding to the descriptions. Through a case study using open-source software JDraw, we obtained results of higher quality than without ontologies.
    BibTeX
    @article{yoshikawa-sigse200903,
        author = {吉川 嵩志 and 林 晋平 and 佐伯 元司},
        title = {ドメインオントロジを用いた自然言語文書とソースコード間の追跡可能性の復元},
        journal = {情報処理学会研究報告},
        volume = 2009,
        number = 31,
        pages = {129--136},
        year = 2009,
        month = {mar},
    }
    [yoshikawa-sigse200903]: as a page
  70. 朱峰 錦司, 善明 晃由, 林 晋平, 佐伯 元司:"要求仕様と再利用可能な実現構造の振る舞いの差分検出に基づく要求分析".情報処理学会研究報告, vol. 2009,no. 31, pp. 33-40. 化学会館,東京,mar,2009.
    ID
    ISSN: 0919-6072
    Abstract
    ソフトウェア開発の要求分析工程において,要求の欠落を補填する支援法が望まれている.本稿では,パッケージソフトウェアをはじめとする,再利用可能な実現構造を知識資源として用いて,ユースケース記述における事前条件や動作系列の欠落を補填する手法を提案する.提案手法では,ユースケース記述と実現構造をラベル付き状態遷移システムに基づいてモデル化する.両モデルを合成し,実現構造の機能が実行される条件を満たしていないユースケース記述の箇所を特定することにより,条件を満たすようにユースケース記述の補填を行う.新規にSNSを開発する事例に対し,SNSパッケージOpenPNEから構築した知識資源を用いて本手法を適用した結果,1つのユースケース記述から,欠落が妥当に補填された8通りのユースケース記述を得ることができた.
    In a requirements analysis process, supporting requirements elicitation is important. In this paper, we propose a technique to derive preconditions and events to be added to use case descriptions by using reusable implementation structures as knowledge resources. The descriptions and the implementation structures are modeled by labeled transition systems (LTS). The two models are composed, and then, the composed model is examined whether preconditions of the functions in the implementation structure do not hold. If such situation exists, the ways for completing the descriptions are identified based on the differences between two models. As a case study, we have applied the proposed technique to a use case of an SNS site with OpenPNE as knowledge resources. As a result, we have obtained eight appropriate use case descriptions from one use case description including missing requirements.
    BibTeX
    @article{akemine-sigse200903,
        author = {朱峰 錦司 and 善明 晃由 and 林 晋平 and 佐伯 元司},
        title = {要求仕様と再利用可能な実現構造の振る舞いの差分検出に基づく要求分析},
        journal = {情報処理学会研究報告},
        volume = 2009,
        number = 31,
        pages = {33--40},
        year = 2009,
        month = {mar},
    }
    [akemine-sigse200903]: as a page
  71. 宇野 耕平, 林 晋平, 佐伯 元司:"ゴールグラフからのフィーチャモデル導出".情報処理学会研究報告, vol. 2009,no. 31, pp. 1-8. 化学会館,東京,mar,2009. 学生研究賞 受賞.
    ID
    ISSN: 0919-6072
    Abstract
    本論文ではゴール指向要求分析法の成果物であるゴールグラフを用いてフィーチャモデルを体系的に導出する手法を提案する.ソフトウェアプロダクトライン開発を始めるにあたってフィーチャモデルを作成する必要がある.そのためにはフィーチャの特定及びフィーチャの共通性と可変性の分析が求められる.提案手法では,まず複数の派生製品のゴールグラフを統合することでプロダクトファミリ全体の要求を把握する.統合したゴールグラフの葉ゴールからフィーチャを特定し,初期ゴールを達成するための各葉ゴールの達成条件からフィーチャの共通性と可変性を分析する.さらにフィーチャに対応する葉ゴールの親ゴールからフィーチャの存在理由であるラショナーレを導出することにより,フィーチャモデルの妥当性を調べることが可能となる.提案手法を自動化するツールを実装し,携帯音楽プレイヤーに手法を適用したところ,高品質のフィーチャモデルを得ることができた.
    This paper proposes a systematic approach to derive feature models required by a softwareproduct line development. In order to construct a feature model, we have to detect features and their commonalities/variabilities. In our approach, we use goal graphs constructed by goal-oriented requirements analysis. We first merge multiple goal graphs into a graph representing the product family’s requirements. We then regard the leaves of the merged graph as the candidates of features. Commonalities and variabilities are analyzed by the differences among graphs. Feature rationales derived from the graph enables us to validate the feature model. Through a case study of a portable music player domain, we obtained a feature model with high quality.
    BibTeX
    @article{uno-sigse200903,
        author = {宇野 耕平 and 林 晋平 and 佐伯 元司},
        title = {ゴールグラフからのフィーチャモデル導出},
        journal = {情報処理学会研究報告},
        volume = 2009,
        number = 31,
        pages = {1--8},
        year = 2009,
        month = {mar},
    }
    [uno-sigse200903]: as a page
  72. 林 晋平, 小林 隆志:"情報検出手法の評価について: デザインパターン検出を例に".In ウインターワークショップ2009・イン・宮崎 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2009,no. 3, pp. 27-28. 宮崎市民プラザ/宮崎観光ホテル, 宮崎,jan,2009.
    ID
    ISSN: 1344-0640
    Abstract
    情報検索においては,検出結果と正解セットとを比較して算出した適合率や再現率を用いて手法を評価することが一般である.本稿では,筆者らのデザインパターン検出研究経験を例に,ソースコードからの情報抽出結果の評価法について議論する.
    In information retrieval, we evaluate detecting techniques by calculating precisions and recalls with comparing the results and the control set. This paper discusses issues and concerns of information extraction from a source code through our experiences for detecting design patterns.
    BibTeX
    @inproceedings{hayashi-wws2009,
        author = {林 晋平 and 小林 隆志},
        title = {情報検出手法の評価について: デザインパターン検出を例に},
        booktitle = {ウインターワークショップ2009・イン・宮崎 論文集},
        pages = {27--28},
        year = 2009,
        month = {jan},
    }
    [hayashi-wws2009]: as a page
  73. 小林 隆志, 林 晋平:"多量のソフトウェア関連データを用いた開発支援—「プログラム解析」セッションの紹介".In ウインターワークショップ2009・イン・宮崎 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2009,no. 3, pp. 1-2. 宮崎市民プラザ/宮崎観光ホテル, 宮崎,jan,2009.
    ID
    ISSN: 1344-0640
    Abstract
    本稿では,「プログラム解析」セッションで予定される議論テーマについて紹介する.
    This paper briefly introduces the topics to be discussed in the ``Program Analysis'' session.
    BibTeX
    @inproceedings{tkobaya-wws2009,
        author = {小林 隆志 and 林 晋平},
        title = {多量のソフトウェア関連データを用いた開発支援---「プログラム解析」セッションの紹介},
        booktitle = {ウインターワークショップ2009・イン・宮崎 論文集},
        pages = {1--2},
        year = 2009,
        month = {jan},
    }
    [tkobaya-wws2009]: as a page
  74. 田原 貴光, 林 晋平, 佐伯 元司:"仕様書とJavaソースコードの構造の類似性に基づく対応付け".情報処理学会研究報告, vol. 2008,no. 29, pp. 139-146. 化学会館,東京,mar,2008.
    ID
    ISSN: 0919-6072
    Abstract
    ソフトウェア開発を効率よく行うために,仕様書とソースコードは互いに対応付いていなければならない.本稿では,自然言語で書かれた仕様書とJavaソースコードの対応付けを行う手法を提案する.ソースコードを文書の一種とみなし,単語の類似性により対応付く箇所を探す.提案手法では,仕様書の章構造とソースコードから抽出できる構造の類似性を用いて対応付けを行うことにより,精度の向上をはかる.適用事例を通して,本手法の有用性を確認した.
    The specification document and the source code of a software project have to be traceable each other for developing the software effectively. In this paper, we propose a technique how to recover the traceability links between a specification written in a natural language and a Java source code. In our approach, we consider a source code as a kind of a document, and detect the parts of a specification corresponding to the source code fragment using a similarity of word occurrences. Furthermore, to improve the detection precision, we use the similarity of the document structures of the specification and the source code. Through a case study, we validate the feasibility of our approach.
    BibTeX
    @article{tahara-sigse200803,
        author = {田原 貴光 and 林 晋平 and 佐伯 元司},
        title = {仕様書と{Java}ソースコードの構造の類似性に基づく対応付け},
        journal = {情報処理学会研究報告},
        volume = 2008,
        number = 29,
        pages = {139--146},
        year = 2008,
        month = {mar},
    }
    [tahara-sigse200803]: as a page
  75. 佐々木 祐輔, 林 晋平, 佐伯 元司:"ソフトウェアメトリクスの統合によるソースコード変更の選択".情報処理学会研究報告, vol. 2008,no. 29, pp. 123-130. 化学会館,東京,mar,2008.
    ID
    ISSN: 0919-6072
    Abstract
    ソースコードに対する変更として適切なものを選択することは難しい.本稿では,ソフトウェア開発プロジェクトの方針に基づいて,各開発者が適切な変更を選択することを支援する手法を提案する.提案手法では,開発者個人の主観による影響を抑制するために,複数のソフトウェアメトリクスを統合した評価関数によって変更の選択肢の優劣を判断する.また,プロジェクトの方針に基づいた選択を実現するために,ソースコードに対する変更の選択を,複数のメトリクスを評価項目とする多目的意思決定とみなすことにより,評価関数の作成を階層分析法を応用した方法によって行う.本稿で行った評価では,提案手法は変更の選択の支援に有用であるという結論を得た.
    Selecting the most appropriate alternatives of source code modification is difficult. This paper proposes a technique to help have each developer of software development project selecting appropriate modifications based on the project's commitment. In the technique, we judge the order of superiority of alternative modifications by creating an evaluation function with integrating multiple software metrics to suppress the influence of each developer's subjectivity. Considering selecting an alternative of source code modification as a multiple criteria decision making, we create the function with Analytic Hierarchy Process. An evaluation shows the efficiency of the technique.
    BibTeX
    @article{sasaki-y-sigse200803,
        author = {佐々木 祐輔 and 林 晋平 and 佐伯 元司},
        title = {ソフトウェアメトリクスの統合によるソースコード変更の選択},
        journal = {情報処理学会研究報告},
        volume = 2008,
        number = 29,
        pages = {123--130},
        year = 2008,
        month = {mar},
    }
    [sasaki-y-sigse200803]: as a page
  76. 林 晋平, 佐伯 元司:"メトリクス値の変化の可視化によるプログラム変更の支援".情報処理学会研究報告, vol. 2008,no. 29, pp. 115-122. 化学会館,東京,mar,2008.
    ID
    ISSN: 0919-6072
    Abstract
    本稿では,ソフトウェアメトリクスの値の変化をコードエディタ上に可視化することにより,開発者のプログラム変更を支援する手法を提案する.プログラムの保守品質を高く保つためには,プログラム変更時にそれを低下させないことが望ましい.提案手法では,開発者が対象プログラムに対して行った変更を,それによって生じた対象プログラムでのメトリクス値の変化で評価する.評価値をコードエディタなどのソフトウェア開発環境上に可視化することにより,開発者は不適切な変更を早期に認識し,改善することができる.メトリクス値の変化の評価の際には,その基準を対象プログラムの過去の変更履歴を考慮して与えることにより可視化すべき対象のプログラム片を制限し,可視化が開発者のコーディング作業に与える負の影響を抑制する.
    This paper proposes a novel technique for supporting program modifications by visualizing the fluctuations of software metric values. In program editing processes, it is useful to modify programs without depressing its maintainability. Our technique evaluates program modifications on the changes of software metric values caused by them. In order to detect and refine ill-modifications, we immediately visualize the changes after the program modifications on a software development environment such as a code editor. Inferring evaluation criteria with the version archive of the program, we then can restrict the target of visualization for reducing affects of the developers' coding process.
    BibTeX
    @article{hayashi-sigse200803,
        author = {林 晋平 and 佐伯 元司},
        title = {メトリクス値の変化の可視化によるプログラム変更の支援},
        journal = {情報処理学会研究報告},
        volume = 2008,
        number = 29,
        pages = {115--122},
        year = 2008,
        month = {mar},
    }
    [hayashi-sigse200803]: as a page
  77. 林 晋平:"プログラム改善の分析のための変更閲覧環境".In ウインターワークショップ2008・イン・道後 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2008,no. 3, pp. 25-26. 愛媛大学, 愛媛,jan,2008.
    ID
    ISSN: 1344-0640
    Abstract
    本稿では,プログラム改善の再利用支援に利用する,既存の版管理履歴中の改善例に関わる変更を閲覧・分析するためのツールについて述べる.
    This paper proposes an automated tool for analyzing program modifications corresponding to examples of program refinements included in existing software version archives. The tool contributes to reuse the refinements to current software.
    BibTeX
    @inproceedings{hayashi-wws2008,
        author = {林 晋平},
        title = {プログラム改善の分析のための変更閲覧環境},
        booktitle = {ウインターワークショップ2008・イン・道後 論文集},
        pages = {25--26},
        year = 2008,
        month = {jan},
    }
    [hayashi-wws2008]: as a page
  78. Rodion Moiseev, Shinpei Hayashi, Motoshi Saeki:"Implementing OCL Evaluators Based on Structural Similarities of Programming Languages".情報処理学会研究報告, vol. 2007,no. 97, pp. 119-126. キャンパスプラザ京都, 京都,sep,2007.
    ID
    ISSN: 0919-6072
    URL
    http://fw8.bookpark.ne.jp/cm/ipsj/search.asp?flag=6&keyword=IPSJ-SE07157016
    http://ci.nii.ac.jp/naid/110006404889/
    http://www.ipsj.or.jp/09sig/kaikoku/2007/SE157.html
    Abstract
    The Object Constraint Language carries a platform independent characteristic, which allows is to be decoupled from the platform specific implementation details, yet on the other hand, it can be found tremendously useful in the implementation phase aiding test case generation and allowing system verification. However, taking full advantage of OCL without destroying its platform independence is a difficult task. This paper proposes an approach to tackle this problem, by taking advantage of hierarchical structural similarities of programming languages to describe a rewriting framework, which is used to easily and flexibly reformulate OCL constraints into any target language, thus making them executable on any platform. A tool is implemented to demonstrate the effectiveness of this approach.Extracting refactorings from the development history is useful for software understanding. This paper proposes a technique to identify refactorings performed between two revisions using a search algorithm. In this technique, we consider a program as a state and refactoring as a transition, and then search for refactorings that reach from the initial state to the final state. In searching, we calculate the difference between the current state and the final state for choosing the next refactoring to apply and also estimate the heuristic distance to the final state. By using this tecnique we can detect related refactorings performed at the same time. Finally, we implemented a tool and evaluated its effectiveness.
    BibTeX
    @article{rodion-sigse200709,
        author = {Rodion Moiseev and Shinpei Hayashi and Motoshi Saeki},
        title = {Implementing {OCL} Evaluators Based on Structural Similarities of Programming Languages},
        journal = {情報処理学会研究報告},
        volume = 2007,
        number = 97,
        pages = {119--126},
        year = 2007,
        month = {sep},
    }
    [rodion-sigse200709]: as a page
  79. 津田 泰幸, 林 晋平, 佐伯 元司:"探索手法を用いたリファクタリング情報の抽出".情報処理学会研究報告, vol. 2007,no. 33, pp. 135-142. 化学会館,東京,mar,2007. 学生研究賞 受賞.
    ID
    ISSN: 0919-6072
    URL
    http://fw8.bookpark.ne.jp/cm/ipsj/search.asp?flag=6&keyword=IPSJ-SE07155018
    http://ci.nii.ac.jp/naid/110006249962/
    http://www.ipsj.or.jp/09sig/kaikoku/2006/SE155.html
    Abstract
    開発履歴中のリファクタリング操作を識別することはソフトウェア理解に有用である.本研究では,履歴中の二つのリビジョン間で行われたリファクタリング操作列を特定する手法を提案する.提案手法では,プログラムを状態,リファクタリング操作を状態遷移とみなし,旧リビジョンから新リビジョンへ至るリファクタリング操作列を探索する.探索の際には,現在の状態と目標状態とのプログラム間の差分を求め,リファクタリング操作の選択と,目標状態までの距離の見積もりに用いる.提案手法では,同時に行われた関連する複数のリファクタリングも抽出することができる.リファクタリング操作列の探索を行うツールを実装し,適用実験を行うことで,提案手法の有用性を確認した.
    Extracting refactorings from the development history is useful for software understanding. This paper proposes a technique to identify refactorings performed between two revisions using a search algorithm. In this technique, we consider a program as a state and refactoring as a transition, and then search for refactorings that reach from the initial state to the final state. In searching, we calculate the difference between the current state and the final state for choosing the next refactoring to apply and also estimate the heuristic distance to the final state. By using this tecnique we can detect related refactorings performed at the same time. Finally, we implemented a tool and evaluated its effectiveness.
    BibTeX
    @article{tsuda-sigse200703,
        author = {津田 泰幸 and 林 晋平 and 佐伯 元司},
        title = {探索手法を用いたリファクタリング情報の抽出},
        journal = {情報処理学会研究報告},
        volume = 2007,
        number = 33,
        pages = {135--142},
        year = 2007,
        month = {mar},
    }
    [tsuda-sigse200703]: as a page
  80. Shinpei Hayashi:"A Technique for Supporting Refactoring Activities by Using Software Repositories".In Proceedings of the Symposium on Large-scale Knowledge Resources (LKR 2007), pp. 147-150. Tokyo Institute of Technology (Ookayama Campus), Tokyo, Japan,mar,2007.
    BibTeX
    @inproceedings{hayashi-lkr2007,
        author = {Shinpei Hayashi},
        title = {A Technique for Supporting Refactoring Activities by Using Software Repositories},
        booktitle = {Proceedings of the Symposium on Large-scale Knowledge Resources},
        pages = {147--150},
        year = 2007,
        month = {mar},
    }
    [hayashi-lkr2007]: as a page
  81. 林 晋平:"プログラム解析手法の選択・適用のための軽量解析の枠組み".In ウィンターワークショップ2007・イン・那覇 論文集 [conference site], 情報処理学会シンポジウムシリーズ, vol. 2007,no. 3, pp. 25-26. ホテルオーシャン, 沖縄,jan,2007.
    ID
    ISSN: 1344-0640
    Abstract
    本稿では,既存の多くのプログラム解析手法がオンライン型の利用に向かないことを示す.またそれを改善するために,別途軽量解析を行い,解析手法を選択的に適用する枠組みについて述べる.
    In this paper, we describe previous program analyzing methods hardly can be applied online, then we discuss the framework of lightweight analysis for selecting and applying these analyzing methods.
    BibTeX
    @inproceedings{hayashi-wws2007,
        author = {林 晋平},
        title = {プログラム解析手法の選択・適用のための軽量解析の枠組み},
        booktitle = {ウィンターワークショップ2007・イン・那覇 論文集},
        pages = {25--26},
        year = 2007,
        month = {jan},
    }
    [hayashi-wws2007]: as a page
  82. 林 晋平:"ソースコードへの注釈付与による集合知を利用したソフトウェア理解".In Proceedings of the Workshop on Leveraging Web2.0 Technologies in Software Development Environments (WebSDE), co-located with ASE 2006, pp. 12-13. 国立情報学研究所,東京,sep,2006.
    Abstract
    本稿では,オープンソースソフトウェアリポジトリ中のソースコード片に注釈を付与することにより,ソフトウェア理解を支援するシステムを提案する.提案システムでは,コード片を指し示す識別子を介して注釈付与を行うことにより,注釈サービスと版管理リポジトリとの結合を緩めている.
    In this paper, we propose the system which enhances comprehensions of open source software by allowing anybody to annotate snippets of source code. We use identifiers which uniquely locate snippets of source code allowing us to loosen dependency on external annotation services.
    BibTeX
    @inproceedings{hayashi-websde2006,
        author = {林 晋平},
        title = {ソースコードへの注釈付与による集合知を利用したソフトウェア理解},
        booktitle = {Proceedings of the Workshop on Leveraging Web2.0 Technologies in Software Development Environments},
        pages = {12--13},
        year = 2006,
        month = {sep},
    }
    [hayashi-websde2006]: as a page
  83. 林 晋平, 佐伯 元司:"リファクタリング支援に用いる知識抽出のためのソフトウェアリポジトリの解析".電子情報通信学会技術研究報告, vol. 106,no. 16, pp. 1-6. 新潟大学(五十嵐キャンパス), 新潟,apr,2006.
    ID
    ISSN: 0913-5685
    URL
    http://ci.nii.ac.jp/naid/110004718945/
    http://www.ieice.org/ken/paper/20060421YA9I/
    Abstract
    リファクタリングの適用候補を特定することは,ソフトウェアの品質の向上につながるため有用である.筆者らはこれまでに,ソフトウェア開発環境に対して開発者が行った変更操作の履歴を利用して適用すべきリファクタリングを特定する手法について取り組んできた.しかし,この手法では識者が変更履歴の特徴をパターンとして事前に作成する必要があった.本稿では,リファクタリングの兆候となる変更履歴の特徴を既存のソフトウェアリポジトリから発見する手法の枠組みを提案する.提案手法では,まず開発者が過去に行った変更の履歴をソフトウェアリポジトリから抽出する.履歴は,プログラムの抽象構文木から差分を計算することにより編集スクリプトの列として求める.続いて,同リポジトリから過去に行われたリファクタリングの事例を取り出し,行われたリファクタリングに関連する構文要素の過去の変更履歴を調べることにより,変更履歴のパターンを作成する.本稿では,例として Jakarta Commons リポジトリに対して手法を適用し,その有用性について検討する.
    It is effective to identify how and where to refactor programs because it improves the program design. We have so far proposed a technique to suggest refactoring opportunities by using a sequence of its modifications. However, the approach requires its users to describe the characteristic modification histories as modification patterns. In this paper, we propose a basic technique to discover characteristic modification histories from its repository, which in turn a technique to find refactoring opportunities. First, we extract modified snippets of code, or Edit Scripts, from a software repository. The Edit Scripts are prepared by calculating the difference of the Abstract Syntax Trees in the programs. We also extract past cases of refactorings, and then we create modification patterns by searching the modifications corresponding with cases of refactorings for frequented structures. We consider the effectiveness of our technique by applying it to Jakarta Commons software repository.
    BibTeX
    @article{hayashi-sigss200604,
        author = {林 晋平 and 佐伯 元司},
        title = {リファクタリング支援に用いる知識抽出のためのソフトウェアリポジトリの解析},
        journal = {電子情報通信学会技術研究報告},
        volume = 106,
        number = 16,
        pages = {1--6},
        year = 2006,
        month = {apr},
    }
    [hayashi-sigss200604]: as a page
  84. 坂本 良太, 林 晋平, 佐伯 元司:"デザインパターン検出のためのテストケース作成支援".電子情報通信学会技術研究報告, vol. 106,no. 16, pp. 7-12. 新潟大学(五十嵐キャンパス), 新潟,apr,2006.
    ID
    ISSN: 0913-5685
    URL
    http://ci.nii.ac.jp/naid/110004718946/
    http://www.ieice.org/ken/paper/20060421mA9i/
    Abstract
    既存プログラムの理解を助けるために,使用されているデザインパターンを動的解析を用いて検出する研究が行われている.検出が有効に行われるためには,動的解析の際にパターンが使用されている部分を実行する必要があり,これを満たすテストケースを作成することが求められる.そこで,本稿ではデザインパターン検出の際に行う動的解析に用いるテストケースの作成を効果的に行う手法を提案する.提案手法では,まずプログラムを静的解析し,パターン候補を識別する.そして,各候補に対して,あらかじめ用意しておいた雛型からテストケースを作成する.このとき,人手で行うメソッドの入力引数の決定を容易にするために支援情報を提示する.提案手法を実装し,動的解析を行う既存のデザインパターン検出ツールを用いて適用実験を行い,本手法の有効性を示した.
    To help with understanding of existing programs, some researches to detect occurrences of design patterns via dynamic analysis has been carried out. In order to detect patterns via dynamic analysis, we need the test cases to execute the part where patterns are actually used. In this paper, we propose the technique for generating test cases effectively which are used for dynamic analysis of design pattern detection. First, to pick pattern candidates up, we analyze the program statically. Then, for each candidates, we generate test cases from the templates which are already defined. At this time, we decide arguments of methods by hands with provided support information. We show the effectiveness of our technique by implementing the supporting tool, and conducting experiments with the existing design pattern detection tool which performed dynamic analysis.
    BibTeX
    @article{rsakamoto-sigss200604,
        author = {坂本 良太 and 林 晋平 and 佐伯 元司},
        title = {デザインパターン検出のためのテストケース作成支援},
        journal = {電子情報通信学会技術研究報告},
        volume = 106,
        number = 16,
        pages = {7--12},
        year = 2006,
        month = {apr},
    }
    [rsakamoto-sigss200604]: as a page
  85. 林 晋平, 栗原 正仁:"プログラムの変更履歴に基づくリファクタリング支援".電子情報通信学会技術研究報告, vol. 104,no. 242, pp. 13-18. はこだて未来大学, 北海道,aug,2004.
    ID
    ISSN: 0913-5685
    URL
    http://ci.nii.ac.jp/naid/110003276714/
    http://www.ieice.org/ken/paper/200408028AaB/
    Abstract
    リファクタリングはソフトウェアの外的振る舞いを保存したままその品質を改善するための有効な手法であるが,適切なリファクタリングの選択やその適用箇所の決定には高度な知識や経験を必要とし,簡単ではない.本稿では,プログラムの変更履歴を用いてそれらを示す手法を提案する.システムが変更履歴を参照することにより,開発者の意図を汲んだ提示を迅速かつ自動的に行うことが可能になる.本稿では,一連の変更と変更パターンとをパターンマッチさせることにより提示すべきリファクタリングを決定するシステムを作成し,提案手法の実現可能性を示した.
    Refactoring is one of the promising techniques for improving software design by means of program transformation with preserving behavior, and is widely taken into practice. But it isn't easy that identifying where to apply which refactoring because it requires proper knowledges and experiences. In this paper, we propose the technique to suggesting refactoring using a sequence of program modifications. Our technique could suggest which refactoring is suitable by considering developer's intentions. It is done by efficiently and automatically. We illustrate the feasibility of our approach with the development of system which selects refactoring by matching between a sequence of modifications and modification patterns.
    BibTeX
    @article{hayashi-sigss200408,
        author = {林 晋平 and 栗原 正仁},
        title = {プログラムの変更履歴に基づくリファクタリング支援},
        journal = {電子情報通信学会技術研究報告},
        volume = 104,
        number = 242,
        pages = {13--18},
        year = 2004,
        month = {aug},
    }
    [hayashi-sigss200408]: as a page

Conference Reports

  1. 中川 博之, 小林 努, 林 晋平, 吉岡 信和, 鵜林 尚靖:"ER 2016参加報告".コンピュータソフトウェア, vol. 34,no. 3, pp. 75-80. aug,2017.
    ID
    DOI: 10.11309/jssst.34.3_75
    BibTeX
    @article{nakagawa-jssst2017,
        author = {中川 博之 and 小林 努 and 林 晋平 and 吉岡 信和 and 鵜林 尚靖},
        title = {ER 2016参加報告},
        journal = {コンピュータソフトウェア},
        volume = 34,
        number = 3,
        pages = {75--80},
        year = 2017,
        month = {aug},
    }
    [nakagawa-jssst2017]: as a page
  2. 松本 卓大, 三浦 圭裕, 崔 恩瀞, 伊原 彰紀, 林 晋平:"第22回SANERの参加報告".情報処理学会研究報告, vol. 2015-SE-188,no. 10, pp. 1-2. 株式会社東芝 スマートコミュニティセンター, 神奈川,jun,2015.
    ID
    ISSN: 0919-6072
    Abstract
    本稿では,2015年3月にモントリオールで開催されたInternational Conference on Software Analysis, Evolution, and Reengineering(SANER 2015)の内容について報告する.
    BibTeX
    @article{matsumoto-sigse201506,
        author = {松本 卓大 and 三浦 圭裕 and 崔 恩瀞 and 伊原 彰紀 and 林 晋平},
        title = {第22回SANERの参加報告},
        journal = {情報処理学会研究報告},
        volume = {2015-SE-188},
        number = 10,
        pages = {1--2},
        year = 2015,
        month = {jun},
    }
    [matsumoto-sigse201506]: as a page
  3. 丸山 勝久, 沢田 篤史, 小林 隆志, 大森 隆行, 林 晋平, 飯田 元, 吉田 則裕, 角田 雅照, 岩政 幹人, 今井 健男, 遠藤 侑介, 村田 由香里, 位野木 万里, 白石 崇, 長岡 武志, 林 千博, 吉村 健太郎, 大島 敬志, 三部 良太, 福地 豊:"産学連携によるソフトウェア進化パターン収集の試み".情報処理学会研究報告, vol. 2014-SE-184,no. 1, pp. 1-8. 株式会社日立製作所 日立研究所, 茨城,may,2014.
    ID
    ISSN: 0919-6072
    Abstract
    ソフトウェア進化を実践する上での指針や慣例がソフトウェア進化パターンである.我々は,Demeyerらのオブジェクト指向リエンジニアリングパターンを補完することを目的に,産学連携でパターンの収集を試みた.本稿では,その結果として,ソフトウェアプロダクトライン,コードクローン,ソフトウェア変更支援,プログラム理解支援,リファクタリングプロセスに関する進化パターンを提案する.
    BibTeX
    @article{maruyama-sigse201405,
        author = {丸山 勝久 and 沢田 篤史 and 小林 隆志 and 大森 隆行 and 林 晋平 and 飯田 元 and 吉田 則裕 and 角田 雅照 and 岩政 幹人 and 今井 健男 and 遠藤 侑介 and 村田 由香里 and 位野木 万里 and 白石 崇 and 長岡 武志 and 林 千博 and 吉村 健太郎 and 大島 敬志 and 三部 良太 and 福地 豊},
        title = {産学連携によるソフトウェア進化パターン収集の試み},
        journal = {情報処理学会研究報告},
        volume = {2014-SE-184},
        number = 1,
        pages = {1--8},
        year = 2014,
        month = {may},
    }
    [maruyama-sigse201405]: as a page
  4. 野田 夏子, 岡野 浩三, 早水 公二, 戸田 航史, 上野 秀剛, 石尾 隆, 林 晋平, 妻木 俊彦, 中村 匡秀, 岸 知二, 本橋 正成, 鷲崎 弘宜:"ウィンターワークショップ2013・イン・那須報告".情報処理学会研究報告, vol. 2013-SE-181,no. 11, pp. 1-8. 和歌山県立情報交流センター ビッグ・ユー, 和歌山,jul,2013.
    ID
    ISSN: 0919-6072
    Abstract
    情報処理学会ソフトウェア工学研究会では,毎年1回参加者同士の議論を中心とした合宿形式のワークショップを開催している.2012年度は2013年1月に那須においてワークショップを開催し,例年同様活発な議論が行われた.本稿では,各テーマのセッションでの議論内容を中心に,本ワークショップについて報告する.
    IPSJ Special Interest Group of Software Engineering (SIGSE) holds a workshop focusing on deep discussion among participants once a year. In the fiscal year of 2012, we had a workshop in Nasu, Tochigi prefecture, January 2013. We had a deep discussion about recent issues and future direction of software engineering. In this paper, we report each discussion held in each special theme session and the whole workshop.
    BibTeX
    @article{nnoda-sigse201307,
        author = {野田 夏子 and 岡野 浩三 and 早水 公二 and 戸田 航史 and 上野 秀剛 and 石尾 隆 and 林 晋平 and 妻木 俊彦 and 中村 匡秀 and 岸 知二 and 本橋 正成 and 鷲崎 弘宜},
        title = {ウィンターワークショップ2013・イン・那須報告},
        journal = {情報処理学会研究報告},
        volume = {2013-SE-181},
        number = 11,
        pages = {1--8},
        year = 2013,
        month = {jul},
    }
    [nnoda-sigse201307]: as a page
  5. 林 晋平, 丸山 勝久, 佐伯 元司:"第27回ソフトウェア工学の自動化国際会議(ASE 2012)参加報告".電子情報通信学会技術研究報告, vol. 112,no. 275, pp. 75-80. nov,2012.
    ID
    ISSN: 0913-5685
    Abstract
    2012年9月にドイツ・エッセンにて開催された第27回ソフトウェア工学の自動化国際会議(ASE 2012)に参加したので,取り上げられた内容を報告し,参加と運営の両方の観点から我々の見解を述べる.
    This paper gives our views on the 27th IEEE/ACM International Conference on Automated Software Engineering (ASE 2012) held at Essen, Germany on September 3-7, 2012 with the perspectives of both participation and organization.
    BibTeX
    @article{hayashi-sigss201211,
        author = {林 晋平 and 丸山 勝久 and 佐伯 元司},
        title = {第27回ソフトウェア工学の自動化国際会議(ASE 2012)参加報告},
        journal = {電子情報通信学会技術研究報告},
        volume = 112,
        number = 275,
        pages = {75--80},
        year = 2012,
        month = {nov},
    }
    [hayashi-sigss201211]: as a page
  6. 丸山 勝久, 大森 隆行, 井垣 宏, 中村 匡秀, 伏田 享平, 角田 雅照, 風戸 広史, 岡田 譲二, 岡野 浩三, 坂本 一憲, 本橋 正成, 岸 知二, 野田 夏子, 小林 隆志, 林 晋平:"ウィンターワークショップ2012・イン・琵琶湖開催報告".情報処理学会研究報告,no. 11, pp. 1-8. nov,2012.
    ID
    ISSN: 0919-6072
    Abstract
    2012年1月19日,20日の2日間に,琵琶湖コンファレンスセンター(滋賀県彦根市)にて開催したウィンターワークショップ2011・イン琵琶湖(WW2012)の概要について報告する.
    This paper reports on ``Winter Workshop 2012 in Biwako(WW2012)'', which was held at Biwako Conference Center in Hikone, Shiga from January 19 through 20, 2012.
    BibTeX
    @article{maruyama-sigse201211,
        author = {丸山 勝久 and 大森 隆行 and 井垣 宏 and 中村 匡秀 and 伏田 享平 and 角田 雅照 and 風戸 広史 and 岡田 譲二 and 岡野 浩三 and 坂本 一憲 and 本橋 正成 and 岸 知二 and 野田 夏子 and 小林 隆志 and 林 晋平},
        title = {ウィンターワークショップ2012・イン・琵琶湖開催報告},
        journal = {情報処理学会研究報告},
        number = 11,
        pages = {1--8},
        year = 2012,
        month = {nov},
    }
    [maruyama-sigse201211]: as a page
  7. 大森 隆行, 大山 勝徳, 林 晋平, 青山 幹雄:"第18回アジア太平洋ソフトウェア工学国際会議(APSEC2011)参加報告".情報処理学会研究報告, vol. 2012-SE-178,no. 12, pp. 1-8. mar,2012.
    ID
    ISSN: 0919-6072
    Abstract
    本稿では,2011年12月5日から8日まで,ベトナムのホーチミン市にて開催された第18回アジア太平洋ソフトウェア工学国際会議(APSEC2011)について紹介する.
    This paper gives our views on the 18th Asia-Pacific Software Engineering Conference (APSEC2011) held in Ho Chi Minh City, Vietnam on December 5-8, 2011.
    BibTeX
    @article{omori-sigse201203,
        author = {大森 隆行 and 大山 勝徳 and 林 晋平 and 青山 幹雄},
        title = {第18回アジア太平洋ソフトウェア工学国際会議(APSEC2011)参加報告},
        journal = {情報処理学会研究報告},
        volume = {2012-SE-178},
        number = 12,
        pages = {1--8},
        year = 2012,
        month = {mar},
    }
    [omori-sigse201203]: as a page
  8. 紫合 治, 松下 誠, 野中 誠, 丸山 勝久, 大杉 直樹, 鹿糠 秀行, 川口 真司, 菊地 奈穂美, 林 晋平, 真鍋 雄貴:"ソフトウェアエンジニアリングシンポジウム2010開催報告".情報処理学会研究報告, vol. 2010-SE-170,no. 23, pp. 1-8. nov,2010.
    ID
    ISSN: 0919-6072
    Abstract
    2010年8月30日から9月1日の3日間に東洋大学(東京都文京区)にて開催したソフトウェアエンジニアリングシンポジウム2010(SES2010)の概要いついて報告する.
    This paper reports on ``Software Engineering Symposium 2010 (SES2010)'' held at Toyo University from August 30th to September 1st.
    BibTeX
    @article{shigo-sigse201011,
        author = {紫合 治 and 松下 誠 and 野中 誠 and 丸山 勝久 and 大杉 直樹 and 鹿糠 秀行 and 川口 真司 and 菊地 奈穂美 and 林 晋平 and 真鍋 雄貴},
        title = {ソフトウェアエンジニアリングシンポジウム2010開催報告},
        journal = {情報処理学会研究報告},
        volume = {2010-SE-170},
        number = 23,
        pages = {1--8},
        year = 2010,
        month = {nov},
    }
    [shigo-sigse201011]: as a page
  9. 小林 隆志, 林 晋平, 外村 慶二, 天嵜 聡介:"第15回アジア太平洋ソフトウェア工学国際会議(APSEC 2008)参加報告".情報処理学会研究報告, vol. 2009-SE-165,no. 10, pp. 1-7. 北陸先端科学技術大学院大学,金沢,jul,2009.
    ID
    ISSN: 0919-6072
    Abstract
    2008年12月2-5日に北京にて開催された第15回アジア太平洋ソフトウェア工学国際会議(APSEC 2008)に関して,我々の見解を述べる.
    This paper gives our views on the 15th Asia-Pacific Software Engineering Conference (APSEC 2008) held at Beijing on December 2-5, 2008.
    BibTeX
    @article{tkobaya-sigse200907,
        author = {小林 隆志 and 林 晋平 and 外村 慶二 and 天嵜 聡介},
        title = {第15回アジア太平洋ソフトウェア工学国際会議(APSEC 2008)参加報告},
        journal = {情報処理学会研究報告},
        volume = {2009-SE-165},
        number = 10,
        pages = {1--7},
        year = 2009,
        month = {jul},
    }
    [tkobaya-sigse200907]: as a page
  10. 福安 直樹, 小林 隆志, 林 晋平, 中鉢 欣秀, 中村 匡秀, 鹿糠 秀行, 羽生田 栄一, 鷲崎 弘宜, 阿萬 裕久:"ウインターワークショップ2009・イン・宮崎 開催報告".情報処理学会研究報告, vol. 2009-SE-164,no. 20, pp. 1-7. 株式会社インターネットイニシアティブ(IIJ),東京,may,2009.
    ID
    ISSN: 0919-6072
    URL
    http://fw8.bookpark.ne.jp/cm/ipsj/search.asp?flag=6&keyword=IPSJ-SE09164020
    Abstract
    2009年1月23日~24日の2日間に渡り宮崎市にて開催したウインターワークショップ2009・イン・宮崎(WW2009)の概要について報告する.
    This paper reports on ``Winter Workshop 2009 in Miyazaki (WW2009)'' held in Miyazaki City from 23rd to 24th January 2009.
    BibTeX
    @article{fukuyasu-sigse200905,
        author = {福安 直樹 and 小林 隆志 and 林 晋平 and 中鉢 欣秀 and 中村 匡秀 and 鹿糠 秀行 and 羽生田 栄一 and 鷲崎 弘宜 and 阿萬 裕久},
        title = {ウインターワークショップ2009・イン・宮崎 開催報告},
        journal = {情報処理学会研究報告},
        volume = {2009-SE-164},
        number = 20,
        pages = {1--7},
        year = 2009,
        month = {may},
    }
    [fukuyasu-sigse200905]: as a page
  11. 丸山 勝久, 川口 真司, 名倉 正剛, 林 晋平, 鷲崎 弘宜, 羽生田 栄一:"第14回アジア太平洋ソフトウェア工学国際会議(APSEC 2007)開催および参加報告".情報処理学会研究報告, vol. 2008,no. 29, pp. 227-234. 化学会館,東京,mar,2008.
    ID
    ISSN: 0919-6072
    URL
    http://fw8.bookpark.ne.jp/cm/ipsj/search.asp?flag=6&keyword=IPSJ-SE08159029
    http://www.ipsj.or.jp/09sig/kaikoku/2007/SE159.html
    Abstract
    2007年12月3-5日名古屋にて開催された第14回アジア太平洋ソフトウェア工学国際会議(APSEC 2007)に関して,主催者側および参加者側からの見解を述べる.
    This paper gives our views on the 14th Asia-Pacific Software Engineering Conference (APSEC 2007) held at Nagoya on December 3-7, 2007.
    BibTeX
    @article{maruyama-sigse200803,
        author = {丸山 勝久 and 川口 真司 and 名倉 正剛 and 林 晋平 and 鷲崎 弘宜 and 羽生田 栄一},
        title = {第14回アジア太平洋ソフトウェア工学国際会議({APSEC 2007})開催および参加報告},
        journal = {情報処理学会研究報告},
        volume = 2008,
        number = 29,
        pages = {227--234},
        year = 2008,
        month = {mar},
    }
    [maruyama-sigse200803]: as a page
  12. 鷲崎 弘宜, 林 晋平, 羽生田 栄一:"第14回アジア太平洋ソフトウェア工学国際会議APSEC開催".In エンジニアマインド, vol. 8, pp. 204-205. jan,2008.
    ID
    ISBN: 978-4774133508
    URL
    http://www.amazon.co.jp/dp/4774133507/
    http://gihyo.jp/magazine/emind/archive/2008/vol8/
    BibTeX
    @inbook{washizaki-engineermind200801,
        author = {鷲崎 弘宜 and 林 晋平 and 羽生田 栄一},
        title = {第14回アジア太平洋ソフトウェア工学国際会議{APSEC}開催},
        booktitle = {エンジニアマインド},
        pages = {204--205},
        publisher = {技術評論社},
        year = 2008,
        month = {jan},
    }
    [washizaki-engineermind200801]: as a page
  13. 鷲崎 弘宜, 久保 淳人, 下滝 亜里, 中川 博之, 林 晋平, 丸山 勝久, 本位田 真一:"第21回ソフトウェア工学の自動化国際会議(ASE2006)開催および参加報告".情報処理学会研究報告, vol. 2006,no. 125, pp. 81-88. 大阪大学(吹田キャンパス),大阪,nov,2006.
    ID
    ISSN: 0919-6072
    URL
    http://fw8.bookpark.ne.jp/cm/ipsj/search.asp?flag=6&keyword=IPSJ-SE06154011
    http://ci.nii.ac.jp/naid/110005717727/
    http://www.ipsj.or.jp/09sig/kaikoku/2006/SE154.html,
    http://www-ise4.ist.osaka-u.ac.jp/~o-mizuno/154sigse.html
    Abstract
    2006年9月に東京にて第21回ソフトウェア工学の自動化国際会議(ASE2006)を開催および参加したので,取り上げられた主な内容を紹介する.会議の傾向として,モデル検査/記号実行に基づくプログラム解析/検証の取り組み,および,プログラム変更履歴からの特定の情報(例えばアスペクト)発掘の取り組みが多く見られ,両分野への取り組みの活発化を伺えた.会議には約 220 名の参加があり,国内外の研究者がソフトウェア工学自動化の最先端の取り組みについて議論し交流する良い機会となった.
    This paper reports major topics of the 21st IEEE/ACM International Conference on Automated Software Engineering held at September 2006 in Tokyo. There were many presentations on program analysis/verification and pattern/aspect mining.
    BibTeX
    @article{washizaki-sigse2006,
        author = {鷲崎 弘宜 and 久保 淳人 and 下滝 亜里 and 中川 博之 and 林 晋平 and 丸山 勝久 and 本位田 真一},
        title = {第21回ソフトウェア工学の自動化国際会議({ASE2006})開催および参加報告},
        journal = {情報処理学会研究報告},
        volume = 2006,
        number = 125,
        pages = {81--88},
        year = 2006,
        month = {nov},
    }
    [washizaki-sigse2006]: as a page

etc. Talks

  1. 中野 真明貴, 林 晋平, 小林 隆志:"動的機能捜索に基づく機能間関係特定に向けて".ウィンターワークショップ2017・イン・飛騨高山 (WWS 2017). 高山市民文化会館, 岐阜,jan,2017.
    BibTeX
    @misc{maaki-wws2017,
        author = {中野 真明貴 and 林 晋平 and 小林 隆志},
        title = {動的機能捜索に基づく機能間関係特定に向けて},
        howpublished = {ウィンターワークショップ2017・イン・飛騨高山},
        year = 2017,
        month = {jan},
    }
    [maaki-wws2017]: as a page
  2. Shinpei Hayashi, Wataru Inoue, Haruhiko Kaiya, Motoshi Saeki:"Annotating Goals with Concerns in Goal-Oriented Requirements Engineering".In Software Technologies (Revised Selected Papers of ICSOFT 2015), Communications in Computer and Information Science, vol. 586, pp. 269-286. feb,2016.
    ID
    DOI: 10.1007/978-3-319-30142-6_15
    Abstract
    In goal-oriented requirements analysis, goals specify multiple concerns such as functions, strategies, and non-functions, and they are refined into sub goals from mixed views of these concerns. This intermixture of concerns in goals makes it difficult for a requirements analyst to understand and maintain goal refinements. Separating concerns and specifying them explicitly is one of the useful approaches to improve the understandability of goal refinements, i.e., the relations between goals and their sub goals. In this paper, we propose a technique to annotate goals with the concerns they have in order to support the understanding of goal refinement. In our approach, goals are refined into sub goals referring to the annotated concerns, and these concerns annotated to a goal and its sub goals provide the meaning of its goal refinement. By tracing and focusing on the annotated concerns, requirements analysts can understand goal refinements and modify unsuitable ones. We have developed a supporting tool and made an exploratory experiment to evaluate the usefulness of our approach.
    BibTeX
    @incollection{hayashi-icsoft2015-ccis,
        author = {Shinpei Hayashi and Wataru Inoue and Haruhiko Kaiya and Motoshi Saeki},
        title = {Annotating Goals with Concerns in Goal-Oriented Requirements Engineering},
        booktitle = {Software Technologies (Revised Selected Papers of ICSOFT 2015)},
        pages = {269--286},
        year = 2016,
        month = {feb},
    }
    [hayashi-icsoft2015-ccis]: as a page
  3. 林 晋平, 佐伯 元司:"ソフトウェア開発履歴の改変例の分析に向けて".In 日本ソフトウェア科学会第32回大会 予稿集. 早稲田大学 西早稲田キャンパス, 東京,sep,2015.
    Abstract
    ソフトウェア構成管理において,開発者はしばしば,ソフトウェア開発履歴に記録される変更の理解性や利用性の向上を目的として,履歴の改変を行う.本稿では,履歴をより適した形に改変するための支援手法や自動化手法の開発を目指し,履歴改変の実例を収集・分析する試みについて述べる.
    BibTeX
    @inproceedings{hayashi-ncjssst2015,
        author = {林 晋平 and 佐伯 元司},
        title = {ソフトウェア開発履歴の改変例の分析に向けて},
        booktitle = {日本ソフトウェア科学会第32回大会 予稿集},
        year = 2015,
        month = {sep},
    }
    [hayashi-ncjssst2015]: as a page
  4. 林 晋平:"コモンクライテリアを用いたセキュリティ要求の獲得".In 日本セキュリティ・マネジメント学会 先端技術・情報犯罪とセキュリティ研究会(招待講演). 中央大学後楽園キャンパス, 東京,mar,2014.
    BibTeX
    @misc{hayashi-jssm201403,
        author = {林 晋平},
        title = {コモンクライテリアを用いたセキュリティ要求の獲得},
        howpublished = {In 日本セキュリティ・マネジメント学会 先端技術・情報犯罪とセキュリティ研究会(招待講演)},
        year = 2014,
        month = {mar},
    }
    [hayashi-jssm201403]: as a page
  5. 井上 渉, 鵜飼 孝典, 林 晋平, 佐伯 元司:"質問回答形式を用いた機能要求記述の解釈の齟齬の検出支援".In 情報処理学会 第73回全国大会 講演論文集 [conference site],no. 1L-6. 東京工業大学, 東京,mar,2011.
    BibTeX
    @inproceedings{inouew-ncipsj2011,
        author = {井上 渉 and 鵜飼 孝典 and 林 晋平 and 佐伯 元司},
        title = {質問回答形式を用いた機能要求記述の解釈の齟齬の検出支援},
        booktitle = {情報処理学会 第73回全国大会 講演論文集},
        year = 2011,
        month = {mar},
    }
    [inouew-ncipsj2011]: as a page
  6. Armstrong Nhlabatsi, Arosha Bandara, Shinpei Hayashi, Charles B. Haley, Jan Jurjens, Haruhiko Kaiya, Atsuto Kubo, Robin Laney, Haralambos Mouratidis, Bashar Nuseibeh, Thein T. Tun, Hironori Washizaki, Nobukazu Yoshioka, Yijun Yu:"Security Patterns: Comparing Modeling Approaches".In Software Engineering for Secure Systems: Industrial and Research Perspectives, pp. 75-111. jan,2011.
    ID
    DOI: 10.4018/978-1-61520-837-1.ch004
    ISBN: 978-1615208371
    URL
    http://www.igi-global.com/Bookstore/TitleDetails.aspx?TitleId=41914
    Abstract
    Addressing the challenges of developing secure software systems remains an active research area in software engineering. Current research efforts have resulted in the documentation of recurring security problems as security patterns. Security patterns provide encapsulated solutions to specific security problems and can be used to build secure systems by designers with little knowledge of security. Despite this benefit, there is lack of work that focus on evaluating the capabilities of security analysis approaches for their support in incorporating security analysis patterns. This chapter presents evaluation results of a study we conducted to examine the extent to which constructs provided by security requirements engineering approaches can support the use of security patterns as part of the analysis of security problems. To achieve this general objective, the authors used a specific security pattern and examined the challenges of representing this pattern in some security modeling approaches. The authors classify the security modeling approaches into two categories: problem and solution and illustrate their capabilities with a well-known security patterns and some practical security examples. Based on the specific security pattern they have used our evaluation results suggest that current approaches to security engineering are, to a large extent, capable of incorporating security analysis patterns.
    BibTeX
    @incollection{armstrong-sess,
        author = {Armstrong Nhlabatsi and Arosha Bandara and Shinpei Hayashi and Charles B. Haley and Jan Jurjens and Haruhiko Kaiya and Atsuto Kubo and Robin Laney and Haralambos Mouratidis and Bashar Nuseibeh and Thein T. Tun and Hironori Washizaki and Nobukazu Yoshioka and Yijun Yu},
        title = {Security Patterns: Comparing Modeling Approaches},
        booktitle = {Software Engineering for Secure Systems: Industrial and Research Perspectives},
        pages = {75--111},
        publisher = {IGI Global},
        year = 2011,
        month = {jan},
    }
    [armstrong-sess]: as a page
  7. 林 晋平:"開発履歴を用いたリファクタリング支援の研究".情報処理, vol. 51,no. 7, p. 899. jul,2010.
    BibTeX
    @article{hayashi-ipsjm201007,
        author = {林 晋平},
        title = {開発履歴を用いたリファクタリング支援の研究},
        journal = {情報処理},
        volume = 51,
        number = 7,
        pages = 899,
        year = 2010,
        month = {jul},
    }
    [hayashi-ipsjm201007]: as a page
  8. 山本 具英, 佐藤 宏之, 小林 透, 高橋 健司, 林 晋平, 佐伯 元司:"セマンティックWebのソフトウェア資産への適用".In In セマンティックWebコンファレンス2010 予稿集 [conference site]. 慶應義塾大学 三田キャンパス,mar,2010.
    Abstract
    近年ますます大規模化するソフトウェアの生産性・保守性向上のためには既存のソフトウェア資産を再利用して新規開発量を減らすことが大切だと考える。 NTT情報流通プラットフォーム研究所では、ソフトウェア開発リポジトリ内で要件定義書、機能設計書、ソースコード等のソフトウェア資産を有機的に結びつけ、それらの「再利用」、「トレーサビリティの確保」および「ソフトウェア共通部分のプラットフォーム化に向けた分析の実現」を目標としている。また、東京工業大学の佐伯研究室では、要件定義書などからソフトウェアが対象とする分野のオントロジを作成し、要求分析や同じ分野のソフトウェア開発支援に活用する研究が行われている。本発表では東工大の研究成果を利用し、NTT保有のソフトウェア資産に基づくオントロジを活用した開発リポジトリの取り組みを紹介する。
    BibTeX
    @inproceedings{yamamoto-swc2010,
        author = {山本 具英 and 佐藤 宏之 and 小林 透 and 高橋 健司 and 林 晋平 and 佐伯 元司},
        title = {セマンティックWebのソフトウェア資産への適用},
        booktitle = {In セマンティックWebコンファレンス2010 予稿集},
        year = 2010,
        month = {mar},
    }
    [yamamoto-swc2010]: as a page
  9. 林 晋平:"ソフトウェア芸術主義 vs. ソフトウェア工学".情報セキュリティ研究室 プログラミング講習(招待講演). 東京電機大学, 神田,jul,2008.
    BibTeX
    @misc{hayashi-dendai-seminar2008,
        author = {林 晋平},
        title = {ソフトウェア芸術主義 vs. ソフトウェア工学},
        howpublished = {情報セキュリティ研究室 プログラミング講習(招待講演)},
        year = 2008,
        month = {jul},
    }
    [hayashi-dendai-seminar2008]: as a page
  10. 林 晋平:"ソフトウェア芸術主義とソフトウェア工学".In 情報セキュリティ研究室 プログラミング講習(招待講演). 東京電機大学, 神田,jul,2007.
    BibTeX
    @misc{hayashi-dendai-seminar2007,
        author = {林 晋平},
        title = {ソフトウェア芸術主義とソフトウェア工学},
        howpublished = {In 情報セキュリティ研究室 プログラミング講習(招待講演)},
        year = 2007,
        month = {jul},
    }
    [hayashi-dendai-seminar2007]: as a page

Theses

  1. 林 晋平:"開発履歴を用いたリファクタリング支援の研究".Ph.D. thesis. nov,2008.
    BibTeX
    @phdthesis{hayashi-dthesis,
        author = {林 晋平},
        title = {開発履歴を用いたリファクタリング支援の研究},
        school = {東京工業大学},
        year = 2008,
        month = {nov},
    }
    [hayashi-dthesis]: as a page

Services

プログラム委員 / 査読委員

  1. ICSME 2018
  2. MSR 2018
  3. VISSOFT 2017
  4. ICPC 2017
  5. SANER 2016, 2017, 2018
  6. WM2SP-16
  7. IWSR 2016
  8. GECCO 2015 SBSE-SS Track, 2016 SBSE Track
  9. NasBASE 2015
  10. IWESEP 2010, 2011, 2012, 2013, 2014, 2016 (Co-chairs), 2017
  11. AsianPLoP 2014, 2015, 2016, 2017
  12. ICSEA 2014, 2015, 2016, 2017
  13. APSEC 2012, 2012-ER, 2013
  14. IWSM/MENSURA 2011
  15. SES 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017
  16. FOSE 2012, 2013, 2014, 2015, 2016, 2017

査読委員

  1. 情報処理学会 論文誌査読委員(2013/6/1-)
  2. 電子情報通信学会 ソサイエティ論文誌編集委員会 査読委員(2010/8/27-)

編集・運営委員

  1. ICPC 2018: Proceedings Chair
  2. ER 2016: Publicity Chair and Web Master
  3. SANER 2016: Student Volunteer Co-chairs
  4. IWESEP 2016: Program Co-chairs
  5. ACM ICPC Asia Regional Contest 2012 in Tokyo (2012)
  6. ASE 2006: Student Volunteer
  7. RE'04: Student Volunteer
  8. 電子情報通信学会 ソフトウェアサイエンス研究会 研究専門委員 (2016年4月-)
  9. SES 2007: 学生ボランティアチェア, 2010: ローカルアレンジ, 2013: ポスター委員長, 2014: 出版委員長, 2015: 出版委員長, 2016: ローカル委員長, 2017: 企画委員長, 2018: 副プログラム委員長
  10. 情報処理学会 ソフトウェア工学研究会 国際的研究活動活性化WG 主査 (2013年6月-)
  11. 日本ソフトウェア科学会 コンピュータソフトウェア 編集委員 (2013年4月-)
  12. 情報処理学会 ソフトウェア工学研究会 運営委員 (2009年4月-2013年3月)
  13. 情報処理学会 第73回全国大会 運営委員 (2011)
  14. WW 2013: セッションリーダー(with Dr. Ishio, Osaka U.)
  15. WW 2009: セッションリーダー(with Dr. Kobayashi, Nagoya U.)

受賞

  1. 東京工業大学 平成29年度 挑戦的研究賞
  2. The 15th International Conference on Intelligent Software Methodologies, Tools and Techniques Best Paper Award
  3. 電子情報通信学会ソフトウェアサイエンス研究会研究奨励賞 at Jul., 2016.
  4. 電子情報通信学会ソフトウェアサイエンス研究会研究奨励賞 at Jul., 2016.
  5. 貢献賞 at FOSE 2013, Nov. 30, 2013.
  6. 平成23年度 情報処理学会山下記念研究賞 from IPSJ, Mar. 7, 2012.
  7. IEEE Computer Society Japan Chapter FOSE Young Researcher Award at FOSE 2011, Nov. 26, 2011.
  8. Best Paper Award from SES 2010, Aug. 31, 2010.
  9. 手島精一記念研究賞(博士論文賞) from 東京工業大学, Feb. 24, 2010.
  10. Clark Awards 2003 from Hokkaido University, Mar. 24, 2004.
  11. The Best Score Award from Programming Contest 2003, IPSJ Hokkaido Branch, Mar. 22, 2003.

Was

--
HAYASHI, Shinpei [[ e-mail address ]] [PGP pubkey(C5F14DA2)]