On Thursday, October 23, 2014 10:04:52 AM UTC-4, Jan Stępień wrote:
I've begun to work on such a tool not long ago. Thomas Arts, who
gave a talk at
our local FP user group meetup [mλ], inspired me to try out the
approach you're
describing in Clojure. After some experiments I got the library to a
state where
it could generate test cases for java.util.HashSet. I looked for
prior art in
the area of concurrency and detection of race conditions. That's when I
discovered Philip Potter's Knossos-based approach [pp]. I find it very
interesting but I haven't yet had time to try it out. It'd be great
to have it
integrated, though.
I demonstrated the tentative API in [gist], where some simple
properties of
HashSet and Clojure vector are checked. The gist also shows how an
exemplary
failure looks, including shrinking. I'll try to get the
implementation to a
reasonable state and push it to GitHub soon.
Feedback is very welcome!
Cool! This looks very similar to the Erlang implementation. I look
forward to seeing it up on github.
I've created a project on GitHub. There's a small example in the readme.
The implementation is below 100 lines of code.
https://github.com/jstepien/states
Pull requests are welcome!
Cheers,
Jan
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - please be patient with your
first post.
To unsubscribe from this group, send email to
clojure+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/clojure?hl=en
---
You received this message because you are subscribed to the Google Groups
"Clojure" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to clojure+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
