Charlie Poole
2008-09-08 23:56:49 UTC
Hi All,
If somebody is experienced in and interested in working
on a combining strategy for Pairwise testing? We have the
combinatorial algorithm, but pairwise is a bit harder.
[I won't explain further here, since you really need to
know what I'm talking about to be helpful in this one, :-)]
You can write something specifically for NUnit or use
other implementations if they are appropriately licensed.
Unfortunately, that excludes GPL, Apache2 or any other
that requires derivative works to use the same license.
If someone is interested, let me know and we can have
a chat about how and where it hooks into NUnit.
Charlie
-------------------------------------------------------------------------
This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
Build the coolest Linux based applications with Moblin SDK & win great prizes
Grand prize is a trip for two to an Open Source event anywhere in the world
http://moblin-contest.org/redirect.php?banner_id=100&url=/
If somebody is experienced in and interested in working
on a combining strategy for Pairwise testing? We have the
combinatorial algorithm, but pairwise is a bit harder.
[I won't explain further here, since you really need to
know what I'm talking about to be helpful in this one, :-)]
You can write something specifically for NUnit or use
other implementations if they are appropriately licensed.
Unfortunately, that excludes GPL, Apache2 or any other
that requires derivative works to use the same license.
If someone is interested, let me know and we can have
a chat about how and where it hooks into NUnit.
Charlie
-------------------------------------------------------------------------
This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
Build the coolest Linux based applications with Moblin SDK & win great prizes
Grand prize is a trip for two to an Open Source event anywhere in the world
http://moblin-contest.org/redirect.php?banner_id=100&url=/