Testcase generation tool for combinatorial interaction testing
Révision | 694443ebbc9f1805666b68e0c9199babaf4b654d (tree) |
---|---|
l'heure | 2017-05-15 16:51:25 |
Auteur | t-tutiya <tatsuhiro@ieee...> |
Commiter | t-tutiya |
I have copied the CIT-bach project.
@@ -1,6 +1,6 @@ | ||
1 | 1 | <?xml version="1.0" encoding="UTF-8"?> |
2 | 2 | <projectDescription> |
3 | - <name>cit_bach</name> | |
3 | + <name>IPOG_bach</name> | |
4 | 4 | <comment></comment> |
5 | 5 | <projects> |
6 | 6 | </projects> |
@@ -16,8 +16,9 @@ P10 (1 2 3 4) | ||
16 | 16 | |
17 | 17 | # 制約(禁則)を列挙 |
18 | 18 | |
19 | -(or | |
20 | - (> [P1] [P2]) (> [P3] [P4]) (> [P5] [P6]) (> [P7] [P8]) (> [P9] [P2]) | |
19 | +(and | |
20 | + (< [P1] [P2]) (> [P3] [P4]) (<= [P5] [P6]) (>= [P7] [P8]) | |
21 | + (=== [P9] 2.0) (!== [P10] 3.0) | |
21 | 22 | ) |
22 | 23 | |
23 | 24 | # 単項演算子:not |
@@ -25,5 +26,9 @@ P10 (1 2 3 4) | ||
25 | 26 | # 3項演算子:ite (if-then-elseの意味) |
26 | 27 | # 多項演算子:or, and |
27 | 28 | |
28 | -# 算術演算子(因子の値に対する演算.結果はブール値) | |
29 | -# ==, <> | |
\ No newline at end of file | ||
29 | +# 比較演算子(因子の値に対する演算.結果はブール値) | |
30 | +# ==, <> | |
31 | + | |
32 | +# 算術演算子 (double型に変換) | |
33 | +# ===, !==, <, >, <=, >= | |
34 | + |
@@ -3,6 +3,7 @@ package v1; | ||
3 | 3 | import jdd.bdd.*; |
4 | 4 | |
5 | 5 | import java.util.ArrayList; |
6 | +import java.util.Collections; | |
6 | 7 | import java.util.List; |
7 | 8 | import java.util.TreeSet; |
8 | 9 |
@@ -170,7 +171,14 @@ class ConstraintHandler { | ||
170 | 171 | private int extendBddConstraint(int constraint) { |
171 | 172 | int f = constraint; |
172 | 173 | |
174 | + int count = 0; | |
175 | + | |
176 | + long start = System.currentTimeMillis(); | |
177 | + | |
178 | + Collections.reverse(parameters); | |
179 | + | |
173 | 180 | for (VariableAndBDD p : parameters) { |
181 | + // System.err.println(count++); | |
174 | 182 | int cube = p.var[0]; |
175 | 183 | bdd.ref(cube); |
176 | 184 | for (int i = 1; i < p.var.length; i++) { |
@@ -189,6 +197,13 @@ class ConstraintHandler { | ||
189 | 197 | |
190 | 198 | f = newf; |
191 | 199 | } |
200 | + // | |
201 | + | |
202 | + Collections.reverse(parameters); | |
203 | + | |
204 | +// long end = System.currentTimeMillis(); | |
205 | +// System.err.println((end - start) + "ms"); | |
206 | + | |
192 | 207 | return f; |
193 | 208 | } |
194 | 209 |
@@ -14,7 +14,7 @@ public class Main { | ||
14 | 14 | static final int MAX_LEVEL = 63; |
15 | 15 | |
16 | 16 | static final int MAX_ITERATIONS = 100000; |
17 | - static final int MAX_STRENGTH = 5; | |
17 | + static final int MAX_STRENGTH = 5; | |
18 | 18 | static final int Max_RandomSeed = 65535; |
19 | 19 | // static final int Max_RandomSeed = 10; |
20 | 20 |
@@ -29,6 +29,8 @@ public class Main { | ||
29 | 29 | // Start the whole process |
30 | 30 | public static void main(String[] args) { |
31 | 31 | |
32 | + long start = System.currentTimeMillis(); | |
33 | + | |
32 | 34 | try { |
33 | 35 | // コマンド引数処理 |
34 | 36 | String errorMessage = processCommandArgument(args); |
@@ -141,6 +143,9 @@ public class Main { | ||
141 | 143 | Error.printError(Main.language == Main.Language.JP ? "プログラムが異常終了しました." |
142 | 144 | : "Abnormal termination"); |
143 | 145 | } |
146 | + | |
147 | +// long end = System.currentTimeMillis(); | |
148 | +// System.err.println("time: " + (end - start) + "ms"); | |
144 | 149 | } |
145 | 150 | |
146 | 151 | // コマンド引数処理 |
@@ -152,7 +157,7 @@ public class Main { | ||
152 | 157 | // policyの表示 |
153 | 158 | if (args.length == 1 && args[0].equals("-policy")) { |
154 | 159 | System.out |
155 | - .println("This software (CIT-BACH 1.02) is distributed under the zlib license.\n" | |
160 | + .println("This software (CIT-BACH 1.1) is distributed under the zlib license.\n" | |
156 | 161 | + "The software contains Java classes from JDD, a Java BDD library " |
157 | 162 | + "developed by Arash Vahidi.\n" |
158 | 163 | + "JDD is free software distributed under the zlib license.\n" |