diff --git a/IOTreeTestQC.hs b/IOTreeTestQC.hs
--- a/IOTreeTestQC.hs
+++ b/IOTreeTestQC.hs
@@ -8,6 +8,7 @@
 import Control.Monad
 import Control.Monad.Trans
 
+import System.Random (randomRIO)
 import Data.Word
 
 import qualified Data.ByteString.Char8 as B
@@ -189,7 +190,9 @@
 
 
 main = do
+  stamp <- randomRIO (0 :: Int, 0xFFFFFFFF)
   let args = stdArgs {maxSuccess = 30, maxSize = 5000}
+  let dir  = "test-btree-conc-tmp-" ++ show stamp
   createDirectory dir 493
   -- Create an empty tree
   c <- Cstm.sizedParam 8 $ Files.evalFilesKV dir
@@ -197,6 +200,5 @@
   r <- T.execTree p T.save
   root <- newMVar r
   quickCheckWithResult args $ behaves_like_map_prop dir root
-  where
-    dir  = "btree-conc-test-tmp"
+
 
diff --git a/btree-concurrent.cabal b/btree-concurrent.cabal
--- a/btree-concurrent.cabal
+++ b/btree-concurrent.cabal
@@ -1,5 +1,5 @@
 name:               btree-concurrent
-version:            0.1.3
+version:            0.1.4
 homepage:           https://github.com/brinchj/btree-concurrent
 synopsis:           A backend agnostic, concurrent BTree
 description:        A backend agnostic, concurrent BTree
@@ -10,13 +10,14 @@
 maintainer:         brinchj@gmail.com
 data-files:         README.md TODO.org
 cabal-version:      >= 1.8
+tested-with:        GHC == 7.6.1
 build-type:         Custom
 stability:          Experimental
 
 
 source-repository head
-  type: git
-  location: foo
+    type: git
+    location: https://github.com/brinchj/btree-concurrent.git
 
 
 Test-Suite quickcheck-highlevel