Automatic Test Case Generation for Combinatorial Testing Using Various Logical Inference Engines
| Project/Area Number |
22700032
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Software
|
|---|
| Research Institution | Kobe University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
|---|
| Keywords | 組合せテスト / SAT / 制約プログラミング / 解集合プログラミング / SAT技術 / テストケース生成 / 被覆配列 / 制約充足問題 / 論理プログラミング |
|---|
| Research Abstract |
We studied automatic test case generation of combinatorial testing by using several logical inference engines such as SAT solvers, constraint solvers, and ASP solvers. We carried out experiments on some benchmark sets in Handbook of Combinatorial Designs. Our proposed methods succeeded either in improving the bounds or producing the same bounds for many instances, compared with the previous best known bounds.
|
Report
(4 results)
Research Products
(40 results)
