Question |
Raised by |
Status |
Solution |
|
Alford, Ronald Wayne |
Need
Question |
|
|
Bahety, Anand Baldeodas |
Need
Question |
|
How do
2 test cases that use x = 40 and x = 41 respectively differ from each other
(for 0 < x < 100)? Is there a method through which they be pruned?
Discuss the method. Is it easier to program the data structure/methods again
by someone else and just use that as a test oracle, rather than finding
invariants and then writing code that checks for invariants, or finding
isomorphism and writing code to check the isomorphism? |
Bucatanschi, Dan George |
Need
Solution |
|
|
Chandra, Deepti Jagdish |
Need
Question |
|
Does
the procedure in section 3.4 guarantee that no pair of candidates is isomorphic
to each other? |
Huynh, Thuan Quang |
Need
Solution |
|
|
Nguyen, Bao Ngoc |
Need
Question |
|
In
Korat, while searching for valid inputs,optimization done depends on the
order that repOK() accesses fields. What step should the users follow to
write efficient repOK() functions? |
Konda, Shravya Reddy |
Need
Solution |
|
|
Lee, Joonghoon |
Need
Question |
|
What's
the benefit of testing data structure for sofeware testing? |
Liu, Liping |
Need
Solution |
|
Explain
the idea of "Finitization" presented by the paper. What is it? How
does it work? How can one use Finitization in Korat? |
Wongsuphasawat, Krist |
Need
Solution |
|
The
Korat tool we discussed does exhaustive testing for data structures up to a
certain size. The authors feel this is sufficient to be confident that any
faults would have been discovered. When would testing small inputs be enough,
and when would it not be? |
Reisner, Elnatan Benjamin |
Need
Solution |
|
|
Schulman, Aaron David |
Need
Question |
|
Explain
briefly the method that Korat uses to identify isomorphic candidates.
Illustrate by an example. |
Sharara, Hossam Samy Elsai |
Need
Solution |
|
|
Stuckman, Jeff |
Need
Question |
|
|
Teoh, Alison Lui Koon |
Need
Question |
|
It
seems that Korat uses bounded-exhaustive concrete execution that tries all
values from user-provided domains. In order to achieve high code coverage
does the user have to carefully choose the values in the domains? |
Thakor, Shashvat Advait |
Need
Solution |
|
|
Vador, Sachin Shashikant |
Need
Question |
|
|
Donlon, Eileen Merle |
Need
Question |
|
Give an
example of a binary tree configuration and explain (a) why not all configurations
are valid and (b) what mechanism one can use that helps to reduce test cases. |
Zazworka, Nico |
Need
Solution |
|