Browse by Tags

All Tags » Algorithms » Testing (RSS)

Binary features seem to be very easy to test with solid mathematical limits

Well, I managed to find a paper, and in that paper I saw that someone had a generator for compressing a testing simulation of 100 features each of which had 2 options, down into only 10 tests. Now that got me intrigued, so I spent nearly my entire night...
Posted by Justin Rogers | 1 comment(s)
Filed under: ,

Testing: Pair-wise, upper and lower boundings

You'd think there would be more math on this. Maybe I'm looking in the wrong places? Well, I wanted to try and formalize some boundings for sequences of features that have identical numbers of options. f = number of features n = number of options n^2...

Testing: The pair-wise problem and fertile ground for improvement.

Apparently pair-wise testing is a pretty big thing. Hell, I'm not a tester, but I know I've used some of the same techniques writing my own tests. So I guess it was only a matter of time before I learned there was a name for what in the hell was going...
Posted by Justin Rogers | with no comments
More Posts