• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Practical combinatorial interaction testing with fault locating capability

Research Project

Project/Area Number 15K00098
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Software
Research InstitutionOsaka University

Principal Investigator

Tsuchiya Tatsuhiro  大阪大学, 情報科学研究科, 教授 (30283740)

Project Period (FY) 2015-04-01 – 2018-03-31
Project Status Completed (Fiscal Year 2017)
Budget Amount *help
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2017: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2015: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Keywordsソフトウェアテスト / 組み合わせインタラクションテスト / ロケーティングアレイ / ソフトウェア工学 / テスト / 組み合わせテスト
Outline of Final Research Achievements

The purpose of this research was to extend Combinatorial Interaction Testing (CIT) to add the capability of fault detection to it. We focused on locating arrays as an enabling technique for this. However, the original definition of locating arrays does not assume the existence of constraints among test parameters, which prohibited locating arrays from being used in real-world CIT. In this research we proposed an extension of locating arrays aiming at addressing this problem. We showed some mathematical properties of this new notion. In addition, we developed a few algorithms that automatically generate locating arrays. Using one of the algorithms, we were successful in finding the minimum (optimal) locating arrays for several cases. These optimal results were used as baseline in the evaluation of the other generation algorithms.

Report

(4 results)
  • 2017 Annual Research Report   Final Research Report ( PDF )
  • 2016 Research-status Report
  • 2015 Research-status Report
  • Research Products

    (11 results)

All 2018 2017 2016 2015 Other

All Journal Article (3 results) (of which Peer Reviewed: 2 results,  Acknowledgement Compliant: 3 results) Presentation (7 results) (of which Invited: 1 results) Remarks (1 results)

  • [Journal Article] Generating High Strength Test Suites for Combinatorial Interaction Testing Using ZDD-Based Graph Algorithms2017

    • Author(s)
      Teru Ohashi, Tatsuhiro Tsuchiya
    • Journal Title

      Proceedings of 22nd IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'17)

      Volume: - Pages: 78-85

    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] Finding Minimum Locating Arrays Using a SAT Solver2017

    • Author(s)
      Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya
    • Journal Title

      Proceedings of 10th IEEE International Conference on Software Testing, Verification and Validation Workshops

      Volume: - Pages: 276-277

    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] ソフトウェアテストと安全性2016

    • Author(s)
      土屋達弘
    • Journal Title

      信頼性学会誌「信頼性」

      Volume: 38 Pages: 80-85

    • Related Report
      2015 Research-status Report
    • Acknowledgement Compliant
  • [Presentation] ブール論理に基づく,情報システムのテスト・検証のためのアプローチ2018

    • Author(s)
      土屋達弘
    • Organizer
      人工知能学会人工知能基本問題研究会 (SIG-FPAI)
    • Related Report
      2017 Annual Research Report
    • Invited
  • [Presentation] 焼きなまし法によるロケーティングアレイの生成2017

    • Author(s)
      小西達也,小島英春,中川博之,土屋達弘
    • Organizer
      電子情報通信学会 ディペンダブルコンピューティング研究会(SIG-DC)
    • Related Report
      2017 Annual Research Report
  • [Presentation] SATソルバを使用したロケーティングアレイの生成手法について2017

    • Author(s)
      小西達也,小島英春,中川博之,土屋達弘
    • Organizer
      電子情報通信学会 システム数理と応用研究会(SIG-MSS)
    • Related Report
      2017 Annual Research Report
  • [Presentation] ZDDアルゴリズムを用いた高強度テストケース生成法2016

    • Author(s)
      大橋輝,土屋達弘
    • Organizer
      電子情報通信学会 ディペンダビリティコンピューティング研究会
    • Place of Presentation
      彦根勤労福祉会館(彦根市)
    • Year and Date
      2016-10-27
    • Related Report
      2016 Research-status Report
  • [Presentation] 貪欲法による組み合わせテスト集合生成における高速化について2015

    • Author(s)
      大橋 輝,土屋達弘
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      東大寺総合文化センター,奈良市
    • Year and Date
      2015-10-13
    • Related Report
      2015 Research-status Report
  • [Presentation] 組み合わせテスト集合生成におけるテストケース候補数の最適化について2015

    • Author(s)
      大橋 輝,土屋達弘
    • Organizer
      第14回情報科学技術フォーラム
    • Place of Presentation
      愛媛大学,松山市
    • Year and Date
      2015-09-15
    • Related Report
      2015 Research-status Report
  • [Presentation] ソフトウェアテスト用テストケース生成における2分決定図を用いた制約処理2015

    • Author(s)
      土屋達弘
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      機械振興会館,東京
    • Year and Date
      2015-06-16
    • Related Report
      2015 Research-status Report
  • [Remarks] 土屋達弘個人のwebページ

    • URL

      http://www-ise4.ist.osaka-u.ac.jp/~t-tutiya/jp/

    • Related Report
      2016 Research-status Report

URL: 

Published: 2015-04-16   Modified: 2019-03-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi