Commit: 8a74ddaed8b64ede9d3608c955e0f96862c58588 - cit_bach (git)

Testcase generation tool for combinatorial interaction testing

Commit MetaInfo

• Revision: 8a74ddaed8b64ede9d3608c955e0f96862c58588 (tree)
• Time: 2018-07-27 13:35:25
• Author: Tatsuhiro Tsuchiya <t-tutiya@ist....>
• Commiter: Tatsuhiro Tsuchiya

Log Message

Create new program to find forbidden pairs

Change Summary

• modified: .classpath
• modified: .project
• modified: inputsamples/test1.txt
• modified: src/v1/ConstraintHandler.java
• modified: src/v1/Error.java
• modified: src/v1/Inputer.java
• modified: src/v1/Main.java
• modified: src/v1/Parameter.java
• modified: src/v1/ParameterModel.java
• modified: src/v1/TestcaseHandler.java

Incremental Difference

--- a/.classpath
+++ b/.classpath
@@ -1,7 +1,11 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <classpath>
 	<classpathentry kind="src" path="src"/>
-	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.7"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER">
+		<attributes>
+			<attribute name="module" value="true"/>
+		</attributes>
+	</classpathentry>
 	<classpathentry kind="lib" path="lib/jdd_104.jar"/>
 	<classpathentry kind="output" path="bin"/>
 </classpath>

--- a/.project
+++ b/.project
@@ -1,6 +1,6 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <projectDescription>
-	<name>IPOG_bach</name>
+	<name>cit_bach</name>
 	<comment></comment>
 	<projects>
 	</projects>

--- a/inputsamples/test1.txt
+++ b/inputsamples/test1.txt
@@ -10,11 +10,11 @@ Disk2 (SDD HDD)
 {OS ƒƒ‚ƒŠ Disk}  {ƒƒ‚ƒŠ Disk CPU}
 
 # §–ñ(‹Ö‘¥)‚ð—ñ‹“
-(if (and (== [ƒƒ‚ƒŠ] 8GB) (== [Disk] HDD) ) (or (== Vista [OS]) (<> [OS] Windows7) (<> [Disk] [Disk2]) ))
+# (if (and (== [ƒƒ‚ƒŠ] 8GB) (== [Disk] HDD) ) (or (== Vista [OS]) (<> [OS] Windows7) (<> [Disk] [Disk2]) ))
 
-(ite (== [Disk] [Disk2]) (== [ƒƒ‚ƒŠ] 4GB) (<> [ƒƒ‚ƒŠ] 2GB))
+# (ite (== [Disk] [Disk2]) (== [ƒƒ‚ƒŠ] 4GB) (<> [ƒƒ‚ƒŠ] 2GB))
 
-(and (not (and (<> [OS] Windows7_64) (== 8GB [ƒƒ‚ƒŠ]))) (or (<> [OS] [ƒƒ‚ƒŠ]) (<> 4GB [ƒƒ‚ƒŠ]) (== [Disk] [CPU] )))
+# (and (not (and (<> [OS] Windows7_64) (== 8GB [ƒƒ‚ƒŠ]))) (or (<> [OS] [ƒƒ‚ƒŠ]) (<> 4GB [ƒƒ‚ƒŠ]) (== [Disk] [CPU] )))
 
 # ’P€‰‰ŽZŽqFnot
 # ‚Q€‰‰ŽZŽqF==C<>, if

--- a/src/v1/ConstraintHandler.java
+++ b/src/v1/ConstraintHandler.java
@@ -7,7 +7,7 @@ import java.util.Collections;
 import java.util.List;
 import java.util.TreeSet;
 
-class ConstraintHandler {
+public class ConstraintHandler {
 	static final int sizeOfNodetable = 10000;
 	static final int sizeOfCache = 10000;
 
@@ -34,7 +34,7 @@ class ConstraintHandler {
 
 	
 	// With constrainedParameters BDD is reduced by excluding irrelevant parameters
-	ConstraintHandler(PList parameterList, List<Node> constraintList, TreeSet<Integer> constrainedParameters) {
+	public ConstraintHandler(PList parameterList, List<Node> constraintList, TreeSet<Integer> constrainedParameters) {
 		bdd = new BDD(sizeOfNodetable, sizeOfCache);
 //		bdd = new jdd.bdd.debug.DebugBDD(1000,1000);
 
@@ -227,7 +227,7 @@ class ConstraintHandler {
 		}
 	}
 
-	boolean isPossible(Testcase test) {
+	public boolean isPossible(Testcase test) {
 		int node = bddConstraint;
 		boolean[] bv = binarizeReduced(test);
 

--- a/src/v1/Error.java
+++ b/src/v1/Error.java
@@ -10,11 +10,11 @@ public class Error {
 	// default ‚ŃGƒ‰[‚Í•W€o—Í
 	static String filename = null;
 
-	static void setOutputFile(String filename) {
+	public static void setOutputFile(String filename) {
 		Error.filename = filename;
 	}
 
-	static void printError(String str) {
+	public static void printError(String str) {
 		BufferedWriter writer;
 		try {
 			if (filename == null) {

--- a/src/v1/Inputer.java
+++ b/src/v1/Inputer.java
@@ -182,7 +182,7 @@ public class Inputer {
 			return tokenList;
 	}
 
-	static InputFileData readModel(String filename) {
+	public static InputFileData readModel(String filename) {
 
 		BufferedReader reader = openFile(filename);
 		List<String> tokenList = makeTokenList(reader);

--- a/src/v1/Main.java
+++ b/src/v1/Main.java
@@ -30,7 +30,7 @@ public class Main {
 	public static void main(String[] args) {
 
 		long start = System.currentTimeMillis();
-		
+
 		try {
 			// ƒRƒ}ƒ“ƒhˆø”ˆ—
 			String errorMessage = processCommandArgument(args);
@@ -48,7 +48,7 @@ public class Main {
 
 			// §–ñˆ— BDDì¬
 			// System.err.println("starting building bdd");
-			
+
 			// old version where all parameters are considered in BDD
 			//			ConstraintHandler conhndl = new ConstraintHandler(
 			//					inputfiledata.parameterList, inputfiledata.constraintList);
@@ -74,7 +74,7 @@ public class Main {
 					Error.printError(Main.language == Main.Language.JP ? "ƒeƒXƒgƒP[ƒX”‚ªãŒÀ"
 							+ Generator.MaxNumOfTestcases + "‚ð’´‚¦‚Ü‚µ‚½"
 							: "The number of test cases exceeded the upper bound "
-									+ Generator.MaxNumOfTestcases);
+							+ Generator.MaxNumOfTestcases);
 				}
 
 				new Outputer(outputFile).outputResult(testSet, inputfiledata,
@@ -125,7 +125,7 @@ public class Main {
 					Error.printError(Main.language == Main.Language.JP ? "ƒeƒXƒgƒP[ƒX”‚ªãŒÀ"
 							+ Generator.MaxNumOfTestcases + "‚ð’´‚¦‚Ü‚µ‚½"
 							: "The number of test cases exceeded the upper bound "
-									+ Generator.MaxNumOfTestcases);
+							+ Generator.MaxNumOfTestcases);
 
 				new Outputer(outputFile).outputResult(testSet, inputfiledata,
 						randomSeed, modelFile, seedFile, outputFile, strength,
@@ -143,9 +143,9 @@ public class Main {
 			Error.printError(Main.language == Main.Language.JP ? "ƒvƒƒOƒ‰ƒ€‚ªˆÙíI—¹‚µ‚Ü‚µ‚½D"
 					: "Abnormal termination");
 		}
-		
-//		long end = System.currentTimeMillis();
-//		System.err.println("time: " + (end - start) + "ms");
+
+		//		long end = System.currentTimeMillis();
+		//		System.err.println("time: " + (end - start) + "ms");
 	}
 
 	// ƒRƒ}ƒ“ƒhˆø”ˆ—
@@ -157,30 +157,30 @@ public class Main {
 		// policy‚Ì•\Ž¦
 		if (args.length == 1 && args[0].equals("-policy")) {
 			System.out
-					.println("This software (CIT-BACH 1.1) is distributed under the zlib license.\n"
-							+ "The software contains Java classes from JDD, a Java BDD library "
-							+ "developed by Arash Vahidi.\n"
-							+ "JDD is free software distributed under the zlib license.\n"
-							+ "\n"
-							+ "Copyright (c) 2015, Tatsuhiro Tsuchiya\n"
-							+ "This software is provided 'as-is', without any express or implied \n"
-							+ "warranty. In no event will the authors be held liable for any damages \n"
-							+ "arising from the use of this software. \n"
-							+ "\n"
-							+ "Permission is granted to anyone to use this software for any purpose, \n"
-							+ "including commercial applications, and to alter it and redistribute it \n"
-							+ "freely, subject to the following restrictions: \n"
-							+ " \n"
-							+ "   1. The origin of this software must not be misrepresented; you must not \n"
-							+ "   claim that you wrote the original software. If you use this software \n"
-							+ "   in a product, an acknowledgment in the product documentation would be \n"
-							+ "   appreciated but is not required. \n"
-							+ "   \n"
-							+ "   2. Altered source versions must be plainly marked as such, and must not be \n"
-							+ "   misrepresented as being the original software. \n"
-							+ "   \n"
-							+ "   3. This notice may not be removed or altered from any source \n"
-							+ "   distribution. \n");
+			.println("This software (CIT-BACH 1.1) is distributed under the zlib license.\n"
+					+ "The software contains Java classes from JDD, a Java BDD library "
+					+ "developed by Arash Vahidi.\n"
+					+ "JDD is free software distributed under the zlib license.\n"
+					+ "\n"
+					+ "Copyright (c) 2015, Tatsuhiro Tsuchiya\n"
+					+ "This software is provided 'as-is', without any express or implied \n"
+					+ "warranty. In no event will the authors be held liable for any damages \n"
+					+ "arising from the use of this software. \n"
+					+ "\n"
+					+ "Permission is granted to anyone to use this software for any purpose, \n"
+					+ "including commercial applications, and to alter it and redistribute it \n"
+					+ "freely, subject to the following restrictions: \n"
+					+ " \n"
+					+ "   1. The origin of this software must not be misrepresented; you must not \n"
+					+ "   claim that you wrote the original software. If you use this software \n"
+					+ "   in a product, an acknowledgment in the product documentation would be \n"
+					+ "   appreciated but is not required. \n"
+					+ "   \n"
+					+ "   2. Altered source versions must be plainly marked as such, and must not be \n"
+					+ "   misrepresented as being the original software. \n"
+					+ "   \n"
+					+ "   3. This notice may not be removed or altered from any source \n"
+					+ "   distribution. \n");
 			System.exit(0);
 		}
 
@@ -271,17 +271,3 @@ public class Main {
 	}
 }
 
-class InputFileData {
-	PList parameterList;
-	GList groupList;
-	List<Node> constraintList;
-	TreeSet<Integer> constrainedParameters;
-
-	InputFileData(PList parameterList, GList groupList,
-			List<Node> constraintList, TreeSet<Integer> constrainedParameters) {
-		this.parameterList = parameterList;
-		this.groupList = groupList;
-		this.constraintList = constraintList;
-		this.constrainedParameters = constrainedParameters;
-	}
-}

--- a/src/v1/Parameter.java
+++ b/src/v1/Parameter.java
@@ -3,8 +3,8 @@ package v1;
 import java.util.*;
 
 public class Parameter {
-	String name;
-	List<String> value_name = new LinkedList<String>();
+	public String name;
+	public List<String> value_name = new LinkedList<String>();
 
 	Parameter(String name) {
 		this.name = name;
@@ -81,48 +81,6 @@ public class Parameter {
 	
 }
 
-class PList extends LinkedList<Parameter> {
-	/**
-	 * 
-	 */
-	private static final long serialVersionUID = 1L;
-
-	boolean checkNameDuplication() {
-		for (int i = 0; i < this.size() - 1; i++)
-			for (int j = i + 1; j < this.size(); j++) {
-				if (this.get(i).name.equals(this.get(j).name)) {
-					return true;
-				}
-			}
-		return false;
-	}
-
-	int getID(String str) throws NoParameterNameException {
-		for (int i = 0; i < this.size(); i++) {
-			if (this.get(i).name.equals(str))
-				return i;
-		}
-		throw new NoParameterNameException();
-	}
-	
-	// useless?
-	int getRestrictedID(String str, TreeSet<Integer> RestrictedParameters) 
-		throws NoParameterNameException {
-		try {
-			int parameter = this.getID(str);
-			int num = 0;
-			for (Integer i: RestrictedParameters) {
-				if (i == parameter)
-					return num;
-				num++;
-			}
-		} catch (NoParameterNameException e) {
-			throw e;
-		}
-		// if the parameter is not a relevant one
-		throw new NoParameterNameException();
-	}
-}
 
 class NoParameterNameException extends Exception {
 

--- a/src/v1/ParameterModel.java
+++ b/src/v1/ParameterModel.java
@@ -2,11 +2,11 @@ package v1;
 
 public class ParameterModel {
 	// ˆöŽq‚̐”
-	final int size;
+	public final int size;
 	// ŠeˆöŽq‚̃Œƒxƒ‹”
-	final byte[] range;
+	public final byte[] range;
 
-	ParameterModel(PList plist) {
+	public ParameterModel(PList plist) {
 		size = plist.size();
 		this.range = new byte[size];
 		for (int i = 0; i < size; i++) {

--- a/src/v1/TestcaseHandler.java
+++ b/src/v1/TestcaseHandler.java
@@ -25,92 +25,6 @@ public class TestcaseHandler {
 	}
 }
 
-class Testcase {
-	byte[] value; // 0..level-1, or <0 (wildcard)
-
-	// ‚±‚ê‚𑼂©‚ç“Ç‚ñ‚Å‚é‚Æ‚Ü‚¸‚¢‚©‚àH
-	Testcase(int n) {
-		this.value = new byte[n];
-	}
-
-	void set(int parameter, byte value) {
-		this.value[parameter] = value;
-	}
-
-	void setWildCard(int parameter) {
-		this.value[parameter] = -1;
-	}
-
-	byte get(int parameter) {
-		return value[parameter];
-	}
-
-	int getint(int parameter) {
-		return (int) value[parameter];
-	}
-
-	void quantify() {
-		for (int i = 0; i < this.value.length; i++)
-			this.value[i] = -1;
-	}
-
-	Testcase makeClone() {
-		Testcase newtest = new Testcase(this.value.length);
-		for (int i = 0; i < newtest.value.length; i++) {
-			newtest.value[i] = this.value[i];
-		}
-		return newtest;
-	}
-
-	void print() {
-		for (int i = 0; i < value.length; i++)
-			System.err.print(value[i] + ",");
-		System.err.println();
-	}
-
-	// TODO Outputer.java ‚Ɉړ®
-	void print(BufferedWriter writer, InputFileData inputfiledata)
-			throws IOException {
-		for (int i = 0; i < value.length; i++)
-			writer.write((i == 0 ? "" : ",")
-					+ inputfiledata.parameterList.get(i).value_name
-							.get(value[i]));
-		writer.write("\n");
-	}
-
-	// tuple‚ðd‚Ë‚é
-	// return true if a tuple is superimposed
-	// d‚Ë‚½Žž‚É‹Ö‘¥‚Ɉᔽ‚·‚邱‚Æ‚ ‚è->ƒ`ƒFƒbƒN‚·‚é
-	boolean superimpose(Testcase tuple, ConstraintHandler h) {
-		Testcase tmp = this.makeClone();
-		if (tmp.superimpose(tuple) == false)
-			return false;
-		if (h.isPossible(tmp) == false)
-			return false;
-		return this.superimpose(tuple);
-		// must be true;
-	}
-
-	// tuple‚ðd‚Ë‚é
-	// return true if a tuple is superimposed
-	// d‚Ë‚½Žž‚É‹Ö‘¥‚Ɉᔽ‚·‚邱‚Æ‚ ‚è->ƒ`ƒFƒbƒN‚µ‚È‚¢
-	private boolean superimpose(Testcase tuple) {
-		// TODO Auto-generated method stu
-		for (int i = 0; i < value.length; i++) {
-			if (value[i] < 0 || tuple.value[i] < 0)
-				continue;
-			if (value[i] == tuple.value[i])
-				continue;
-			return false;
-		}
-
-		for (int i = 0; i < value.length; i++) {
-			if (value[i] < 0)
-				this.set(i, tuple.get(i));
-		}
-		return true;
-	}
-}
 
 class Testsuite {
 	List<Testcase> test;