From 5a81357ac8d4f802f999aae7b09781b63b356129 Mon Sep 17 00:00:00 2001
From: ISWB Prasetya <iswbprasetya@iswbs-mbp.home>
Date: Thu, 17 Aug 2017 11:40:08 +0200
Subject: [PATCH] start creating a new experiment, based on Wermer's original.
---
README.md | 85 ++-
.../simple tests => examples}/2d-arrays1.java | 0
.../simple tests => examples}/arrays.java | 0
.../simple tests => examples}/arrays1.java | 0
.../simple tests => examples}/arrays2.java | 0
.../simple tests => examples}/arrays3.java | 0
.../simple tests => examples}/loops.java | 0
.../simple tests => examples}/methods.java | 0
.../simple tests => examples}/objects.java | 0
.../side-effects.java | 0
.../simple tests => examples}/switch.java | 0
.../try-catch-finally.java | 0
.../wermer/Tests/simple tests/arrays1.class | Bin 2569 -> 0 bytes
.../{wermer => wermerOriginal}/Daikon.hs | 0
.../Equivalent mutations/2D_to_1D.java | 0
.../Equivalent mutations/BST.java | 0
.../Equivalent mutations/Fibonacci.java | 0
.../Equivalent mutations/MinsMaxs.java | 0
.../Mutants/2D_to_1D_no_1D.java | 0
.../Mutants/2D_to_1D_no_counter.java | 0
.../Mutants/BST_no_parent.java | 0
.../Mutants/Fibonacci_no_extra_prints.java | 0
.../Mutants/MinsMaxs_R1.java | 0
.../Mutants/MinsMaxs_R2.java | 0
.../Mutants/MinsMaxs_R3.java | 0
.../Mutants/Normalizer_R1.java | 0
.../Mutants/Normalizer_R2.java | 0
.../Mutants/Normalizer_R3.java | 0
.../Mutants/Normalizer_R4.java | 0
.../Mutants/Stack_bool_is_result.java | 0
.../Stack_constructor_duplication.java | 0
.../Mutants/Stack_useless_property.java | 0
.../Mutants/Vector_R1.java | 0
.../Mutants/Vector_R2.java | 0
.../Mutants/Vector_R3.java | 0
.../Mutants/Vectors01Generator_no_for.java | 0
.../Vectors01Generator_print_string.java | 0
.../Equivalent mutations/Normalizer.java | 0
.../Equivalent mutations/Stack.java | 0
.../Equivalent mutations/Vector.java | 0
.../Vectors01Generator.java | 0
.../original C# code/2D_to_1D.cs | 0
.../original C# code/2D_to_1D_no_1D.cs | 0
.../original C# code/2D_to_1D_no_counter.cs | 0
.../original C# code/BST.cs | 0
.../original C# code/BST_no_parent.cs | 0
.../original C# code/Fibonacci.cs | 0
.../Fibonacci_no_extra_prints.cs | 0
.../original C# code/Heapsort.cs | 0
.../original C# code/Matrix.cs | 0
.../original C# code/Stack.cs | 0
.../original C# code/Stack_bool_is_result.cs | 0
.../Stack_constructor_duplication.cs | 0
.../Stack_useless_property.cs | 0
.../original C# code/Vectors01Generator.cs | 0
.../Vectors01Generator_no_for.cs | 0
.../Vectors01Generator_print_string.cs | 0
.../Equivalent mutations/twodmatrix.class | Bin
.../{wermer => wermerOriginal}/Main.hs | 0
experiments/wermerOriginal/README.md | 24 +
.../Results/Daikon results.txt | 0
...eturnValueVar == returnValue_False_False_1 | 0
...rue_returnValue != null_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
.../true_true_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
...eturnValueVar == returnValue_False_False_2 | 0
..._returnValueVar == returnValue_True_True_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
.../arrays1_true_true_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
...rue_returnValue != null_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
...esecantsolver_true_true_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
...rue_returnValue != null_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
...dientfunction_true_true_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
...rue_returnValue != null_true_False_False_1 | 0
...eturnValueVar == returnValue_False_False_1 | 0
.../iterator_true_true_true_False_False_1 | 0
.../{wermer => wermerOriginal}/Settings.hs | 0
.../Tests/BaseSecantSolver.java | 0
.../Tests/GradientFunction.java | 0
.../Tests/Iterator.java | 0
.../Tests/daikon tests/BaseSecantSolver.java | 0
.../Tests/daikon tests/GradientFunction.java | 0
.../Tests/daikon tests/Iterator.java | 0
.../original tests/BaseSecantSolver.java | 0
.../original tests/GradientFunction.java | 0
.../Tests/original tests/Iterator.java | 0
.../daikon equivalent mutations/2D_to_1D.java | 0
.../daikon equivalent mutations/BST.java | 0
.../Fibonacci.java | 0
.../MinsMaxs.class | Bin
.../daikon equivalent mutations/MinsMaxs.java | 0
.../Mutants/2D_to_1D_no_1D.java | 0
.../Mutants/2D_to_1D_no_counter.java | 0
.../Mutants/BST_no_parent.java | 0
.../Mutants/Fibonacci_no_extra_prints.java | 0
.../Mutants/MinsMaxs_R1.java | 0
.../Mutants/MinsMaxs_R2.java | 0
.../Mutants/MinsMaxs_R3.java | 0
.../Mutants/Node.class | Bin
.../Mutants/Normalizer_R1.class | Bin
.../Mutants/Normalizer_R1.java | 0
.../Mutants/Normalizer_R2.class | Bin
.../Mutants/Normalizer_R2.java | 0
.../Mutants/Normalizer_R3.class | Bin
.../Mutants/Normalizer_R3.java | 0
.../Mutants/Normalizer_R4.class | Bin
.../Mutants/Normalizer_R4.java | 0
.../Mutants/Program.class | Bin
.../Mutants/Stack_bool_is_result.java | 0
.../Stack_constructor_duplication.java | 0
.../Mutants/Stack_useless_property.java | 0
.../Mutants/Tree.class | Bin
.../Mutants/Vector_R1.class | Bin
.../Mutants/Vector_R1.java | 0
.../Mutants/Vector_R2.class | Bin
.../Mutants/Vector_R2.java | 0
.../Mutants/Vector_R3.class | Bin
.../Mutants/Vector_R3.java | 0
.../Mutants/Vectors01Generator_no_for.java | 0
.../Vectors01Generator_print_string.java | 0
.../Mutants/twodmatrix.class | Bin
.../daikon equivalent mutations/Node.class | Bin
.../Normalizer.class | Bin
.../Normalizer.java | 0
.../daikon equivalent mutations/Program.class | Bin
.../daikon equivalent mutations/Stack.java | 0
.../daikon equivalent mutations/Tree.class | Bin
.../daikon equivalent mutations/Vector.class | Bin
.../daikon equivalent mutations/Vector.java | 0
.../Vectors01Generator.java | 0
.../twodmatrix.class | Bin
license.txt | 674 ++++++++++++++++++
src/Javawlp/API.hs | 8 +-
140 files changed, 776 insertions(+), 15 deletions(-)
rename {experiments/wermer/Tests/simple tests => examples}/2d-arrays1.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/arrays.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/arrays1.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/arrays2.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/arrays3.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/loops.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/methods.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/objects.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/side-effects.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/switch.java (100%)
rename {experiments/wermer/Tests/simple tests => examples}/try-catch-finally.java (100%)
delete mode 100644 experiments/wermer/Tests/simple tests/arrays1.class
rename experiments/{wermer => wermerOriginal}/Daikon.hs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/2D_to_1D.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/BST.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Fibonacci.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/MinsMaxs.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/2D_to_1D_no_1D.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/2D_to_1D_no_counter.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/BST_no_parent.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Fibonacci_no_extra_prints.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/MinsMaxs_R1.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/MinsMaxs_R2.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/MinsMaxs_R3.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Normalizer_R1.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Normalizer_R2.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Normalizer_R3.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Normalizer_R4.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Stack_bool_is_result.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Stack_constructor_duplication.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Stack_useless_property.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Vector_R1.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Vector_R2.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Vector_R3.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Vectors01Generator_no_for.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Mutants/Vectors01Generator_print_string.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Normalizer.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Stack.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Vector.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/Vectors01Generator.java (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/2D_to_1D.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/2D_to_1D_no_1D.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/2D_to_1D_no_counter.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/BST.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/BST_no_parent.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Fibonacci.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Fibonacci_no_extra_prints.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Heapsort.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Matrix.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Stack.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Stack_bool_is_result.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Stack_constructor_duplication.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Stack_useless_property.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Vectors01Generator.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Vectors01Generator_no_for.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/original C# code/Vectors01Generator_print_string.cs (100%)
rename experiments/{wermer => wermerOriginal}/Equivalent mutations/twodmatrix.class (100%)
rename experiments/{wermer => wermerOriginal}/Main.hs (100%)
create mode 100644 experiments/wermerOriginal/README.md
rename experiments/{wermer => wermerOriginal}/Results/Daikon results.txt (100%)
rename experiments/{wermer => wermerOriginal}/Results/False Positives/true_returnValue != null_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/False Positives/true_returnValue != null_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/False Positives/true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/False Positives/true_true_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/False Positives/true_true_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_2 (100%)
rename experiments/{wermer => wermerOriginal}/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_True_True_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/arrays1_true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/arrays1_true_true_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/basesecantsolver_true_returnValue != null_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/basesecantsolver_true_returnValue != null_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/basesecantsolver_true_true_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/basesecantsolver_true_true_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/gradientfunction_true_returnValue != null_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/gradientfunction_true_returnValue != null_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/gradientfunction_true_true_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/gradientfunction_true_true_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/iterator_true_returnValue != null_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/iterator_true_returnValue != null_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/iterator_true_true_returnValueVar == returnValue_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Results/iterator_true_true_true_False_False_1 (100%)
rename experiments/{wermer => wermerOriginal}/Settings.hs (100%)
rename experiments/{wermer => wermerOriginal}/Tests/BaseSecantSolver.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/GradientFunction.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/Iterator.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/daikon tests/BaseSecantSolver.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/daikon tests/GradientFunction.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/daikon tests/Iterator.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/original tests/BaseSecantSolver.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/original tests/GradientFunction.java (100%)
rename experiments/{wermer => wermerOriginal}/Tests/original tests/Iterator.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/2D_to_1D.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/BST.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Fibonacci.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/MinsMaxs.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/MinsMaxs.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/2D_to_1D_no_1D.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/2D_to_1D_no_counter.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/BST_no_parent.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Fibonacci_no_extra_prints.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/MinsMaxs_R1.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/MinsMaxs_R2.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/MinsMaxs_R3.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Node.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R1.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R1.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R2.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R2.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R3.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R3.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R4.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Normalizer_R4.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Program.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Stack_bool_is_result.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Stack_constructor_duplication.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Stack_useless_property.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Tree.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vector_R1.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vector_R1.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vector_R2.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vector_R2.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vector_R3.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vector_R3.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vectors01Generator_no_for.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/Vectors01Generator_print_string.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Mutants/twodmatrix.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Node.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Normalizer.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Normalizer.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Program.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Stack.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Tree.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Vector.class (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Vector.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/Vectors01Generator.java (100%)
rename experiments/{wermer => wermerOriginal}/daikon equivalent mutations/twodmatrix.class (100%)
create mode 100644 license.txt
diff --git a/README.md b/README.md
index 3cbd4cd..cd50abf 100644
--- a/README.md
+++ b/README.md
@@ -1,22 +1,79 @@
-### To run the mutation test:
+# javawlp Library
-- Create the mutation files using Major in the right location (described below):
- $MAJOR_HOME/bin/javac -J-Dmajor.export.directory="$SOURCE mutants" -J-Dmajor.export.mutants=true -XMutator:ALL -cp "wlp/tests" wlp/Tests/$SOURCE.java
-- Edit settings.hs to specify the post-condition and test file
-- Run the main function (this can be done using ghci)
-- The results will be stored in wlp/Results, overwriting any existing results file that uses the same parameters (the analysis is static, so the results should be the same in this case anyway)
+javawlp is a Haskell library that implements Dijkstra's weakest pre-condition transformer that targets the Java programming language.
+Given a statement *stmt* and a post-condition *q*, the transformer *wlp stmt q* calculates the weakest pre-condition for the statement
+to establish the post-condition q. Originally, the transformer is used in the context of a programming logic:
+to prove that a Hoare triple specification *{p} stmt {q}* is valid we can instead prove that the
+implication *p implies (wlp stmt q)* is valid. Over the years, predicate transformers are also used for other purposes,
+such as to aid software testing.
-### To run the false positive test:
+The weakest pre-condition of loops and recursions is unfortunately in general uncomputable. javawlp takes the pragmatic approach
+to unroll loops and recursions some finite number of times (configurable). As such, verification through javawlp falls
+in the category bounded verification.
-- Edit settings.hs to specify the post-condition
-- Run the testFalsePositives function (this can be done using ghci)
-- The results will be stored in wlp/Results
+Copyright (c) 2017, Utrecht University
-### Folder structure:
+Authors: Koen Wermer, Wishnu Prasetya
-The folder generated by Major must be in the same folder as the wlp folder, and must be named "SOURCE mutants" (where SOURCE is the name of the test class)
-A path to a mutant (the 5th mutant in this example) looks like this: "SOURCE mutants/5/classPath/SOURCE.java" Because of this, to analyse a new test class the classPath function in Settings.hs has to be extended with the corresponding class path
+License: GPL
+
+### How to deploy
+
+TO DO: Provide a cabal file.
+
+javawlp is distributed as a Haskell library. The main functions exported by the library can be found in the module `Javawlp.API`.
+
+Example of use:
+
+```
+module Mymodule where
+import Javawlp.API
+test = do -- parse a Java source file; specify the path to the file:
+ (tyenv,decls,methods) <- parseJava filepath
+ configuration <- defaultConf
+ -- specify a post-condition and calculate the wlp:
+ p <- wlpMethod configuration tyenv decls (Ident methodname) (post_ "returnValue == 0")
+ -- do something with the obtained wlp (p):
+ putStrLn (prettyPrint p)
+```
+
+You can check the obtained pre-condition for its satisfiability and obtained the value assignment that
+satisfies it as shown below. This is for example useful to obtain a test case.
+
+```
+module Mymodule where
+import Javawlp.API
+import Z3.Monad
+import Javawlp.Engine.Verifier
+import Javawlp.Engine.HelperFunctions
+test = do -- this part is as in the previous example:
+ (tyenv,decls,methods) <- parseJava filepath
+ configuration <- defaultConf
+ p <- wlpMethod configuration tyenv decls (Ident methodname) (post_ "returnValue == 0")
+ -- now check p's satisfiability and print its model:
+ let (result,model) = unsafeIsSatisfiable (extendEnv tyenv decls (Ident methodname)) decls p
+ case result of
+ Sat -> do
+ let (Just m) = model
+ s <- evalZ3 (modelToString m)
+ putStrLn ("SATISFIABLE. Model: " ++ s)
+ Unsat -> putStrLn "Not satisfiable."
+ _ -> putStrLn "Unable to decide."
+```
+
+### Content
+
+- src: contains javawlp's source files.
+- papers: includes Wermer's original thesis.
+- examples: includes a set of small Java examples you can try as targets for the wlp transformer.
### Dependency
-- language-java Haskell package
\ No newline at end of file
+Haskell packages:
+
+- language-java
+- z3 (this is not the actual z3, but provides interface to z3)
+
+Other software:
+
+- You will need the actual z3
\ No newline at end of file
diff --git a/experiments/wermer/Tests/simple tests/2d-arrays1.java b/examples/2d-arrays1.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/2d-arrays1.java
rename to examples/2d-arrays1.java
diff --git a/experiments/wermer/Tests/simple tests/arrays.java b/examples/arrays.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/arrays.java
rename to examples/arrays.java
diff --git a/experiments/wermer/Tests/simple tests/arrays1.java b/examples/arrays1.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/arrays1.java
rename to examples/arrays1.java
diff --git a/experiments/wermer/Tests/simple tests/arrays2.java b/examples/arrays2.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/arrays2.java
rename to examples/arrays2.java
diff --git a/experiments/wermer/Tests/simple tests/arrays3.java b/examples/arrays3.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/arrays3.java
rename to examples/arrays3.java
diff --git a/experiments/wermer/Tests/simple tests/loops.java b/examples/loops.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/loops.java
rename to examples/loops.java
diff --git a/experiments/wermer/Tests/simple tests/methods.java b/examples/methods.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/methods.java
rename to examples/methods.java
diff --git a/experiments/wermer/Tests/simple tests/objects.java b/examples/objects.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/objects.java
rename to examples/objects.java
diff --git a/experiments/wermer/Tests/simple tests/side-effects.java b/examples/side-effects.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/side-effects.java
rename to examples/side-effects.java
diff --git a/experiments/wermer/Tests/simple tests/switch.java b/examples/switch.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/switch.java
rename to examples/switch.java
diff --git a/experiments/wermer/Tests/simple tests/try-catch-finally.java b/examples/try-catch-finally.java
similarity index 100%
rename from experiments/wermer/Tests/simple tests/try-catch-finally.java
rename to examples/try-catch-finally.java
diff --git a/experiments/wermer/Tests/simple tests/arrays1.class b/experiments/wermer/Tests/simple tests/arrays1.class
deleted file mode 100644
index e8cb0ee4d5abe69aa4dc80fec8a2c97d842714a4..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 2569
zcmbtV>u*za7=BKB+S7L3m30i;!2t$t1v)?+47xF{I@uU7K)DDz?Kv9<x}N2nQ*d|-
zh@gpyN;Ki3iJ%D|yhJe>M9BE235oxKe}akM5zyy%PDh8JUu@Ig_5Ho?^FHsTcOU*V
z1z;75G0a0(3@unIhIL}dMmcmV=!sx`3}N&}upx$x*c8QPY*DZ^hB&$+ctOlBilHxp
zmm=5}LBH4y#IPNM5$uRyr_i@cD53n2INvRXJqq^5@G@ReuusCQR?Tq?+cmACv)OdC
zT*1&KNc$y(vu4qBdn5$g+V@J3H(9zNp|;;F8rw@_Im6y9gn2QhnMDarZ3p^~YR9#X
zf>s>u7;<g1IJ!<eR7T9AJ|ILwZ3p_=`y^Bkxmy0%fHq#%5Y1`&F2gZTQd^iZeeHV{
z5J7CzvL0P1-o*hvuNMk86!jf6;qK5(+o5Q#lp`9)vfZ*BT8=nJtP}mF!=ozG+2G`j
zqE1w00UC&8^M$gLu_3Eu=Z&qVa4D|Ywl?9c$OwnxSb&9bEXUF~R$yfu&xt|Bd<o4J
zhc`^KxW%?Do22d7wMD!<K#E5+YSq<o+sIo)Ah=d=FpgJoNWtMahM`HAUD4%}x3Odv
zbc3o=yN?*Ed%{wUf-z<kT}Rbil@yqH!%^eNAuk3-Eu?BiUG-+$;9R9@x~`VSRo9}N
zfe{6xaU6lkFcvIpT+LghqHEZyMd5nWQLU1zS|e(X$GVe=Gew_gF7WM9nBw6=Mzc(f
zf@5(MFeag{0(>xc)X0<VfCy8fZAL!$H(ox}ROAOV_Xw#P^OJ*d=d&5=h9(@>poJiD
zQJ=5Qv^u=NlO#hMTgQyi#>W|03Cm_0oKC<Q7#^dQ4^wS@?f-EdaV`IagvPcf1*u?`
z=gH%M$k4dR%L4QLF$SgqF)u@&1cOjvVpD--$Rg5N2DYI;$|hEdTjB+4a6jg=p69W1
zNOjF3|G0`l64}YImAe+s66a9*2BaT^AQo{9dxv2}u^7*CEkxf%fM1}iPPrZHUlO^A
zz>=E?@+a3-iIb;o<QW$g^=nZ>MG=IECWb2Rs?mU2%tjrOs3+oCG}(wYB(RjH%hAll
znu9gGjq<d;3~2&Eeu2*G2wg%``e#JaQ=g;y7Q*`)lpBcL31;Q)RC?+v8q=vvI+?kO
zP%3*SAYJ?G_vANx8Svbl3x(_Xw6KsCS~)JF-Nndoy$Wf5L4={&=mP{LsqP+uN3nz=
zJ~L+_^91PjU?d1bNq$yF5fvzsw_^k8spL(>dV-yDLT<T=`lSguosctwXJmr;W9c@*
zj*n&mnGwCd8J$RBHPLj@)LNc&aa@lqdObw7kZYn3QLSK^B;6xrQ3CELV>(sFl>Hx=
zzJCPCC#a8*wh>Z4A#Eq5K|<P2NW1<G4jW(@&aZ?cQ{CGhoci=HGwBKXAu>|(a8HW}
z)*cb8mdtSS3v9lQs#}QfyMgM4nn~2ACQ;W=&qa$^G;l%L=`+3&%UL{4axsa<NhHn$
zN$}TR%rF0w<bzDIL-gn{gFVbvt-<E{HJ-hN5znhegd6WelI|la{fV6ny&rwHb>B59
zS!VjXr@1C~2Yr{`OkKo8u-glNda6a2^{dExFIFbx%ZMjrc{n|F1+5}?ryXvhBMDi!
zG@C2BBa%sE4S(`*<|`!SZhx8eCUG^$A?at;1<&<&JSz?9n`piyxD1oaId>{d^sw*%
zi%i&Pg2U$EGVM$B?>I)ug^LNUPU20xj&pbeAMoxx<u2e9zQt*erP+u!K4d8ho@%7I
zYOBvvBU6%pedQb&B~hY*EDvUrBFe3m(6Taxm(TcKP9k|mV$go0z$8)?s7+p(on?KT
zV+x*SA9#-m|GozyioksYSO<$~l>b6yqo>O)V!g~xki3XBUN>0jags<~MwI(26<X3M
zS<f(|zJwxQgB<jG#oZ@*#fS9dBl`0(d)IlI{DgJ-DY{9D-z&loAWPC5rKVR36K*Hr
n`n_TmXYr|TU;@v*R5tS?LKQEko3GFmLLlBNTJ&me0$B4m*_8}4
diff --git a/experiments/wermer/Daikon.hs b/experiments/wermerOriginal/Daikon.hs
similarity index 100%
rename from experiments/wermer/Daikon.hs
rename to experiments/wermerOriginal/Daikon.hs
diff --git a/experiments/wermer/Equivalent mutations/2D_to_1D.java b/experiments/wermerOriginal/Equivalent mutations/2D_to_1D.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/2D_to_1D.java
rename to experiments/wermerOriginal/Equivalent mutations/2D_to_1D.java
diff --git a/experiments/wermer/Equivalent mutations/BST.java b/experiments/wermerOriginal/Equivalent mutations/BST.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/BST.java
rename to experiments/wermerOriginal/Equivalent mutations/BST.java
diff --git a/experiments/wermer/Equivalent mutations/Fibonacci.java b/experiments/wermerOriginal/Equivalent mutations/Fibonacci.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Fibonacci.java
rename to experiments/wermerOriginal/Equivalent mutations/Fibonacci.java
diff --git a/experiments/wermer/Equivalent mutations/MinsMaxs.java b/experiments/wermerOriginal/Equivalent mutations/MinsMaxs.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/MinsMaxs.java
rename to experiments/wermerOriginal/Equivalent mutations/MinsMaxs.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/2D_to_1D_no_1D.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/2D_to_1D_no_1D.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/2D_to_1D_no_1D.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/2D_to_1D_no_1D.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/2D_to_1D_no_counter.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/2D_to_1D_no_counter.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/2D_to_1D_no_counter.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/2D_to_1D_no_counter.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/BST_no_parent.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/BST_no_parent.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/BST_no_parent.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/BST_no_parent.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Fibonacci_no_extra_prints.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Fibonacci_no_extra_prints.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Fibonacci_no_extra_prints.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Fibonacci_no_extra_prints.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/MinsMaxs_R1.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/MinsMaxs_R1.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/MinsMaxs_R1.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/MinsMaxs_R1.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/MinsMaxs_R2.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/MinsMaxs_R2.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/MinsMaxs_R2.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/MinsMaxs_R2.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/MinsMaxs_R3.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/MinsMaxs_R3.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/MinsMaxs_R3.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/MinsMaxs_R3.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Normalizer_R1.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R1.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Normalizer_R1.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R1.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Normalizer_R2.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R2.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Normalizer_R2.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R2.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Normalizer_R3.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R3.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Normalizer_R3.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R3.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Normalizer_R4.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R4.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Normalizer_R4.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Normalizer_R4.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Stack_bool_is_result.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Stack_bool_is_result.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Stack_bool_is_result.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Stack_bool_is_result.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Stack_constructor_duplication.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Stack_constructor_duplication.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Stack_constructor_duplication.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Stack_constructor_duplication.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Stack_useless_property.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Stack_useless_property.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Stack_useless_property.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Stack_useless_property.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Vector_R1.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Vector_R1.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Vector_R1.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Vector_R1.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Vector_R2.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Vector_R2.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Vector_R2.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Vector_R2.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Vector_R3.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Vector_R3.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Vector_R3.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Vector_R3.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Vectors01Generator_no_for.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Vectors01Generator_no_for.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Vectors01Generator_no_for.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Vectors01Generator_no_for.java
diff --git a/experiments/wermer/Equivalent mutations/Mutants/Vectors01Generator_print_string.java b/experiments/wermerOriginal/Equivalent mutations/Mutants/Vectors01Generator_print_string.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Mutants/Vectors01Generator_print_string.java
rename to experiments/wermerOriginal/Equivalent mutations/Mutants/Vectors01Generator_print_string.java
diff --git a/experiments/wermer/Equivalent mutations/Normalizer.java b/experiments/wermerOriginal/Equivalent mutations/Normalizer.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Normalizer.java
rename to experiments/wermerOriginal/Equivalent mutations/Normalizer.java
diff --git a/experiments/wermer/Equivalent mutations/Stack.java b/experiments/wermerOriginal/Equivalent mutations/Stack.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Stack.java
rename to experiments/wermerOriginal/Equivalent mutations/Stack.java
diff --git a/experiments/wermer/Equivalent mutations/Vector.java b/experiments/wermerOriginal/Equivalent mutations/Vector.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Vector.java
rename to experiments/wermerOriginal/Equivalent mutations/Vector.java
diff --git a/experiments/wermer/Equivalent mutations/Vectors01Generator.java b/experiments/wermerOriginal/Equivalent mutations/Vectors01Generator.java
similarity index 100%
rename from experiments/wermer/Equivalent mutations/Vectors01Generator.java
rename to experiments/wermerOriginal/Equivalent mutations/Vectors01Generator.java
diff --git a/experiments/wermer/Equivalent mutations/original C# code/2D_to_1D.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/2D_to_1D.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/2D_to_1D.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/2D_to_1D.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/2D_to_1D_no_1D.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/2D_to_1D_no_1D.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/2D_to_1D_no_1D.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/2D_to_1D_no_1D.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/2D_to_1D_no_counter.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/2D_to_1D_no_counter.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/2D_to_1D_no_counter.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/2D_to_1D_no_counter.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/BST.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/BST.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/BST.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/BST.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/BST_no_parent.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/BST_no_parent.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/BST_no_parent.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/BST_no_parent.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Fibonacci.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Fibonacci.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Fibonacci.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Fibonacci.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Fibonacci_no_extra_prints.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Fibonacci_no_extra_prints.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Fibonacci_no_extra_prints.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Fibonacci_no_extra_prints.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Heapsort.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Heapsort.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Heapsort.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Heapsort.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Matrix.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Matrix.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Matrix.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Matrix.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Stack.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Stack.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Stack.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Stack.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Stack_bool_is_result.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Stack_bool_is_result.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Stack_bool_is_result.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Stack_bool_is_result.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Stack_constructor_duplication.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Stack_constructor_duplication.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Stack_constructor_duplication.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Stack_constructor_duplication.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Stack_useless_property.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Stack_useless_property.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Stack_useless_property.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Stack_useless_property.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Vectors01Generator.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Vectors01Generator.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Vectors01Generator.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Vectors01Generator.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Vectors01Generator_no_for.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Vectors01Generator_no_for.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Vectors01Generator_no_for.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Vectors01Generator_no_for.cs
diff --git a/experiments/wermer/Equivalent mutations/original C# code/Vectors01Generator_print_string.cs b/experiments/wermerOriginal/Equivalent mutations/original C# code/Vectors01Generator_print_string.cs
similarity index 100%
rename from experiments/wermer/Equivalent mutations/original C# code/Vectors01Generator_print_string.cs
rename to experiments/wermerOriginal/Equivalent mutations/original C# code/Vectors01Generator_print_string.cs
diff --git a/experiments/wermer/Equivalent mutations/twodmatrix.class b/experiments/wermerOriginal/Equivalent mutations/twodmatrix.class
similarity index 100%
rename from experiments/wermer/Equivalent mutations/twodmatrix.class
rename to experiments/wermerOriginal/Equivalent mutations/twodmatrix.class
diff --git a/experiments/wermer/Main.hs b/experiments/wermerOriginal/Main.hs
similarity index 100%
rename from experiments/wermer/Main.hs
rename to experiments/wermerOriginal/Main.hs
diff --git a/experiments/wermerOriginal/README.md b/experiments/wermerOriginal/README.md
new file mode 100644
index 0000000..c4f40c7
--- /dev/null
+++ b/experiments/wermerOriginal/README.md
@@ -0,0 +1,24 @@
+### Note
+
+Wish: this contains Wemer's orginal experiments. I have since then modified wlp's interface as well as the directory structure,
+so the script (Main.hs and Setting.hs) as well as the instructions below need to be adjusted. TODO.
+
+### To run the mutation test:
+
+- Create the mutation files using Major in the right location (described below):
+ $MAJOR_HOME/bin/javac -J-Dmajor.export.directory="$SOURCE mutants" -J-Dmajor.export.mutants=true -XMutator:ALL -cp "wlp/tests" wlp/Tests/$SOURCE.java
+- Edit settings.hs to specify the post-condition and test file
+- Run the main function (this can be done using ghci)
+- The results will be stored in wlp/Results, overwriting any existing results file that uses the same parameters (the analysis is static, so the results should be the same in this case anyway)
+
+### To run the false positive test:
+
+- Edit settings.hs to specify the post-condition
+- Run the testFalsePositives function (this can be done using ghci)
+- The results will be stored in wlp/Results
+
+### Folder structure:
+
+The folder generated by Major must be in the same folder as the wlp folder, and must be named "SOURCE mutants" (where SOURCE is the name of the test class)
+A path to a mutant (the 5th mutant in this example) looks like this: "SOURCE mutants/5/classPath/SOURCE.java" Because of this, to analyse a new test class the classPath function in Settings.hs has to be extended with the corresponding class path
+
diff --git a/experiments/wermer/Results/Daikon results.txt b/experiments/wermerOriginal/Results/Daikon results.txt
similarity index 100%
rename from experiments/wermer/Results/Daikon results.txt
rename to experiments/wermerOriginal/Results/Daikon results.txt
diff --git a/experiments/wermer/Results/False Positives/true_returnValue != null_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/False Positives/true_returnValue != null_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/False Positives/true_returnValue != null_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/False Positives/true_returnValue != null_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/False Positives/true_returnValue != null_true_False_False_1 b/experiments/wermerOriginal/Results/False Positives/true_returnValue != null_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/False Positives/true_returnValue != null_true_False_False_1
rename to experiments/wermerOriginal/Results/False Positives/true_returnValue != null_true_False_False_1
diff --git a/experiments/wermer/Results/False Positives/true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/False Positives/true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/False Positives/true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/False Positives/true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/False Positives/true_true_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/False Positives/true_true_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/False Positives/true_true_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/False Positives/true_true_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/False Positives/true_true_true_False_False_1 b/experiments/wermerOriginal/Results/False Positives/true_true_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/False Positives/true_true_true_False_False_1
rename to experiments/wermerOriginal/Results/False Positives/true_true_true_False_False_1
diff --git a/experiments/wermer/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_2 b/experiments/wermerOriginal/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_2
similarity index 100%
rename from experiments/wermer/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_2
rename to experiments/wermerOriginal/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_False_False_2
diff --git a/experiments/wermer/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_True_True_1 b/experiments/wermerOriginal/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_True_True_1
similarity index 100%
rename from experiments/wermer/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_True_True_1
rename to experiments/wermerOriginal/Results/arrays1_true_returnValue != null_returnValueVar == returnValue_True_True_1
diff --git a/experiments/wermer/Results/arrays1_true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/arrays1_true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/arrays1_true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/arrays1_true_returnValueVar == returnValue_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/arrays1_true_true_true_False_False_1 b/experiments/wermerOriginal/Results/arrays1_true_true_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/arrays1_true_true_true_False_False_1
rename to experiments/wermerOriginal/Results/arrays1_true_true_true_False_False_1
diff --git a/experiments/wermer/Results/basesecantsolver_true_returnValue != null_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/basesecantsolver_true_returnValue != null_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/basesecantsolver_true_returnValue != null_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/basesecantsolver_true_returnValue != null_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/basesecantsolver_true_returnValue != null_true_False_False_1 b/experiments/wermerOriginal/Results/basesecantsolver_true_returnValue != null_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/basesecantsolver_true_returnValue != null_true_False_False_1
rename to experiments/wermerOriginal/Results/basesecantsolver_true_returnValue != null_true_False_False_1
diff --git a/experiments/wermer/Results/basesecantsolver_true_true_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/basesecantsolver_true_true_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/basesecantsolver_true_true_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/basesecantsolver_true_true_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/basesecantsolver_true_true_true_False_False_1 b/experiments/wermerOriginal/Results/basesecantsolver_true_true_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/basesecantsolver_true_true_true_False_False_1
rename to experiments/wermerOriginal/Results/basesecantsolver_true_true_true_False_False_1
diff --git a/experiments/wermer/Results/gradientfunction_true_returnValue != null_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/gradientfunction_true_returnValue != null_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/gradientfunction_true_returnValue != null_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/gradientfunction_true_returnValue != null_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/gradientfunction_true_returnValue != null_true_False_False_1 b/experiments/wermerOriginal/Results/gradientfunction_true_returnValue != null_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/gradientfunction_true_returnValue != null_true_False_False_1
rename to experiments/wermerOriginal/Results/gradientfunction_true_returnValue != null_true_False_False_1
diff --git a/experiments/wermer/Results/gradientfunction_true_true_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/gradientfunction_true_true_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/gradientfunction_true_true_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/gradientfunction_true_true_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/gradientfunction_true_true_true_False_False_1 b/experiments/wermerOriginal/Results/gradientfunction_true_true_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/gradientfunction_true_true_true_False_False_1
rename to experiments/wermerOriginal/Results/gradientfunction_true_true_true_False_False_1
diff --git a/experiments/wermer/Results/iterator_true_returnValue != null_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/iterator_true_returnValue != null_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/iterator_true_returnValue != null_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/iterator_true_returnValue != null_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/iterator_true_returnValue != null_true_False_False_1 b/experiments/wermerOriginal/Results/iterator_true_returnValue != null_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/iterator_true_returnValue != null_true_False_False_1
rename to experiments/wermerOriginal/Results/iterator_true_returnValue != null_true_False_False_1
diff --git a/experiments/wermer/Results/iterator_true_true_returnValueVar == returnValue_False_False_1 b/experiments/wermerOriginal/Results/iterator_true_true_returnValueVar == returnValue_False_False_1
similarity index 100%
rename from experiments/wermer/Results/iterator_true_true_returnValueVar == returnValue_False_False_1
rename to experiments/wermerOriginal/Results/iterator_true_true_returnValueVar == returnValue_False_False_1
diff --git a/experiments/wermer/Results/iterator_true_true_true_False_False_1 b/experiments/wermerOriginal/Results/iterator_true_true_true_False_False_1
similarity index 100%
rename from experiments/wermer/Results/iterator_true_true_true_False_False_1
rename to experiments/wermerOriginal/Results/iterator_true_true_true_False_False_1
diff --git a/experiments/wermer/Settings.hs b/experiments/wermerOriginal/Settings.hs
similarity index 100%
rename from experiments/wermer/Settings.hs
rename to experiments/wermerOriginal/Settings.hs
diff --git a/experiments/wermer/Tests/BaseSecantSolver.java b/experiments/wermerOriginal/Tests/BaseSecantSolver.java
similarity index 100%
rename from experiments/wermer/Tests/BaseSecantSolver.java
rename to experiments/wermerOriginal/Tests/BaseSecantSolver.java
diff --git a/experiments/wermer/Tests/GradientFunction.java b/experiments/wermerOriginal/Tests/GradientFunction.java
similarity index 100%
rename from experiments/wermer/Tests/GradientFunction.java
rename to experiments/wermerOriginal/Tests/GradientFunction.java
diff --git a/experiments/wermer/Tests/Iterator.java b/experiments/wermerOriginal/Tests/Iterator.java
similarity index 100%
rename from experiments/wermer/Tests/Iterator.java
rename to experiments/wermerOriginal/Tests/Iterator.java
diff --git a/experiments/wermer/Tests/daikon tests/BaseSecantSolver.java b/experiments/wermerOriginal/Tests/daikon tests/BaseSecantSolver.java
similarity index 100%
rename from experiments/wermer/Tests/daikon tests/BaseSecantSolver.java
rename to experiments/wermerOriginal/Tests/daikon tests/BaseSecantSolver.java
diff --git a/experiments/wermer/Tests/daikon tests/GradientFunction.java b/experiments/wermerOriginal/Tests/daikon tests/GradientFunction.java
similarity index 100%
rename from experiments/wermer/Tests/daikon tests/GradientFunction.java
rename to experiments/wermerOriginal/Tests/daikon tests/GradientFunction.java
diff --git a/experiments/wermer/Tests/daikon tests/Iterator.java b/experiments/wermerOriginal/Tests/daikon tests/Iterator.java
similarity index 100%
rename from experiments/wermer/Tests/daikon tests/Iterator.java
rename to experiments/wermerOriginal/Tests/daikon tests/Iterator.java
diff --git a/experiments/wermer/Tests/original tests/BaseSecantSolver.java b/experiments/wermerOriginal/Tests/original tests/BaseSecantSolver.java
similarity index 100%
rename from experiments/wermer/Tests/original tests/BaseSecantSolver.java
rename to experiments/wermerOriginal/Tests/original tests/BaseSecantSolver.java
diff --git a/experiments/wermer/Tests/original tests/GradientFunction.java b/experiments/wermerOriginal/Tests/original tests/GradientFunction.java
similarity index 100%
rename from experiments/wermer/Tests/original tests/GradientFunction.java
rename to experiments/wermerOriginal/Tests/original tests/GradientFunction.java
diff --git a/experiments/wermer/Tests/original tests/Iterator.java b/experiments/wermerOriginal/Tests/original tests/Iterator.java
similarity index 100%
rename from experiments/wermer/Tests/original tests/Iterator.java
rename to experiments/wermerOriginal/Tests/original tests/Iterator.java
diff --git a/experiments/wermer/daikon equivalent mutations/2D_to_1D.java b/experiments/wermerOriginal/daikon equivalent mutations/2D_to_1D.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/2D_to_1D.java
rename to experiments/wermerOriginal/daikon equivalent mutations/2D_to_1D.java
diff --git a/experiments/wermer/daikon equivalent mutations/BST.java b/experiments/wermerOriginal/daikon equivalent mutations/BST.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/BST.java
rename to experiments/wermerOriginal/daikon equivalent mutations/BST.java
diff --git a/experiments/wermer/daikon equivalent mutations/Fibonacci.java b/experiments/wermerOriginal/daikon equivalent mutations/Fibonacci.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Fibonacci.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Fibonacci.java
diff --git a/experiments/wermer/daikon equivalent mutations/MinsMaxs.class b/experiments/wermerOriginal/daikon equivalent mutations/MinsMaxs.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/MinsMaxs.class
rename to experiments/wermerOriginal/daikon equivalent mutations/MinsMaxs.class
diff --git a/experiments/wermer/daikon equivalent mutations/MinsMaxs.java b/experiments/wermerOriginal/daikon equivalent mutations/MinsMaxs.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/MinsMaxs.java
rename to experiments/wermerOriginal/daikon equivalent mutations/MinsMaxs.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/2D_to_1D_no_1D.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/2D_to_1D_no_1D.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/2D_to_1D_no_1D.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/2D_to_1D_no_1D.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/2D_to_1D_no_counter.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/2D_to_1D_no_counter.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/2D_to_1D_no_counter.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/2D_to_1D_no_counter.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/BST_no_parent.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/BST_no_parent.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/BST_no_parent.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/BST_no_parent.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Fibonacci_no_extra_prints.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Fibonacci_no_extra_prints.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Fibonacci_no_extra_prints.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Fibonacci_no_extra_prints.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/MinsMaxs_R1.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/MinsMaxs_R1.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/MinsMaxs_R1.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/MinsMaxs_R1.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/MinsMaxs_R2.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/MinsMaxs_R2.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/MinsMaxs_R2.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/MinsMaxs_R2.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/MinsMaxs_R3.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/MinsMaxs_R3.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/MinsMaxs_R3.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/MinsMaxs_R3.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Node.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Node.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Node.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Node.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R1.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R1.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R1.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R1.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R1.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R1.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R1.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R1.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R2.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R2.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R2.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R2.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R2.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R2.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R2.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R2.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R3.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R3.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R3.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R3.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R3.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R3.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R3.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R3.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R4.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R4.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R4.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R4.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R4.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R4.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Normalizer_R4.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Normalizer_R4.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Program.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Program.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Program.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Program.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Stack_bool_is_result.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Stack_bool_is_result.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Stack_bool_is_result.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Stack_bool_is_result.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Stack_constructor_duplication.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Stack_constructor_duplication.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Stack_constructor_duplication.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Stack_constructor_duplication.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Stack_useless_property.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Stack_useless_property.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Stack_useless_property.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Stack_useless_property.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Tree.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Tree.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Tree.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Tree.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vector_R1.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R1.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vector_R1.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R1.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vector_R1.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R1.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vector_R1.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R1.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vector_R2.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R2.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vector_R2.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R2.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vector_R2.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R2.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vector_R2.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R2.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vector_R3.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R3.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vector_R3.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R3.class
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vector_R3.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R3.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vector_R3.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vector_R3.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vectors01Generator_no_for.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vectors01Generator_no_for.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vectors01Generator_no_for.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vectors01Generator_no_for.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/Vectors01Generator_print_string.java b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vectors01Generator_print_string.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/Vectors01Generator_print_string.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/Vectors01Generator_print_string.java
diff --git a/experiments/wermer/daikon equivalent mutations/Mutants/twodmatrix.class b/experiments/wermerOriginal/daikon equivalent mutations/Mutants/twodmatrix.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Mutants/twodmatrix.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Mutants/twodmatrix.class
diff --git a/experiments/wermer/daikon equivalent mutations/Node.class b/experiments/wermerOriginal/daikon equivalent mutations/Node.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Node.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Node.class
diff --git a/experiments/wermer/daikon equivalent mutations/Normalizer.class b/experiments/wermerOriginal/daikon equivalent mutations/Normalizer.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Normalizer.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Normalizer.class
diff --git a/experiments/wermer/daikon equivalent mutations/Normalizer.java b/experiments/wermerOriginal/daikon equivalent mutations/Normalizer.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Normalizer.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Normalizer.java
diff --git a/experiments/wermer/daikon equivalent mutations/Program.class b/experiments/wermerOriginal/daikon equivalent mutations/Program.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Program.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Program.class
diff --git a/experiments/wermer/daikon equivalent mutations/Stack.java b/experiments/wermerOriginal/daikon equivalent mutations/Stack.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Stack.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Stack.java
diff --git a/experiments/wermer/daikon equivalent mutations/Tree.class b/experiments/wermerOriginal/daikon equivalent mutations/Tree.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Tree.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Tree.class
diff --git a/experiments/wermer/daikon equivalent mutations/Vector.class b/experiments/wermerOriginal/daikon equivalent mutations/Vector.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Vector.class
rename to experiments/wermerOriginal/daikon equivalent mutations/Vector.class
diff --git a/experiments/wermer/daikon equivalent mutations/Vector.java b/experiments/wermerOriginal/daikon equivalent mutations/Vector.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Vector.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Vector.java
diff --git a/experiments/wermer/daikon equivalent mutations/Vectors01Generator.java b/experiments/wermerOriginal/daikon equivalent mutations/Vectors01Generator.java
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/Vectors01Generator.java
rename to experiments/wermerOriginal/daikon equivalent mutations/Vectors01Generator.java
diff --git a/experiments/wermer/daikon equivalent mutations/twodmatrix.class b/experiments/wermerOriginal/daikon equivalent mutations/twodmatrix.class
similarity index 100%
rename from experiments/wermer/daikon equivalent mutations/twodmatrix.class
rename to experiments/wermerOriginal/daikon equivalent mutations/twodmatrix.class
diff --git a/license.txt b/license.txt
new file mode 100644
index 0000000..20d40b6
--- /dev/null
+++ b/license.txt
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
\ No newline at end of file
diff --git a/src/Javawlp/API.hs b/src/Javawlp/API.hs
index feda8bb..87fa861 100644
--- a/src/Javawlp/API.hs
+++ b/src/Javawlp/API.hs
@@ -37,7 +37,13 @@ post_ e = case parser Language.Java.Parser.exp e of
Right e_ -> e_
_ -> error "syntax error in post-condition"
--- | Calculates the wlp for a given method
+-- | Calculates the wlp for a given method. Example usage:
+--
+-- do (tyenv,decls,methods) <- parseJava filepath
+-- configuration <- defaultConf
+-- p <- wlpMethod configuration tyenv decls (Ident methodname) (post_ "returnValue == 0")
+-- putStrLn (prettyPrint p)
+--
wlpMethod :: WLPConf -> TypeEnv -> [TypeDecl] -> Ident -> Exp -> IO Exp
wlpMethod conf env decls methodName postCondition = do
-- Find the return type of the method
--
GitLab