|
Question |
Raised by |
Status |
Solution |
|
|
Alford, Ronald Wayne |
Need
Question |
|
|
Explain
why failure set must be restrictive in some detail. |
Bahety, Anand Baldeodas |
Need
Solution |
|
|
|
Bucatanschi, Dan George |
Need
Question |
|
|
|
Chandra, Deepti Jagdish |
Need
Question |
|
|
Branches
and loops appear to increase the amount of computations in a symbolic testing
a lot, especially when the conditions are computed by a complex symbolic
formula. Which kinds of applications are suitable for symbolic testing? |
Huynh, Thuan Quang |
Need
Solution |
|
|
|
Nguyen, Bao Ngoc |
Need
Question |
|
|
Discuss
how fault-based testing is a better way of verifying program correctness in
comparison to Structural Coverage. |
Konda, Shravya Reddy |
Need
Solution |
|
|
|
Lee, Joonghoon |
Need
Question |
|
|
The
framework in this paper is similar to fault-seeding method. This framework
requires the pre-specified association set for every L. How to generate such
an associate set? How to control the size of the association set? |
Liu, Liping |
Need
Solution |
|
|
What is
the difference between the fault-based and traditional approaches? What is
each approach trying to do? |
Wongsuphasawat, Krist |
Need
Solution |
|
|
The
goal of fault-based testing is to certify that a program is free of certain
kinds of faults. What other testing technique(s) that we discussed in class
had this as a goal, rather having the goal of finding faults? |
Reisner, Elnatan
Benjamin |
Need
Solution |
|
|
|
Schulman, Aaron David |
Need
Question |
|
|
What are
the two necessary and sufficient conditions for fault-based testing to ensure
program correctness with respect to its specification? Explain each of them
briefly. |
Sharara, Hossam Samy Elsai |
Need
Solution |
|
|
How
does this technique differ from mutation testing? |
Stuckman, Jeff |
Need
Solution |
|
|
|
Teoh, Alison Lui Koon |
Need
Question |
|
|
When
doing fault-based testing with real or symbolic inputs, the assumption is
that both the outputs can be verified with some oracles. Is some oracle
always necessary? |
Thakor, Shashvat Advait |
Need
Solution |
|
|
|
Vador, Sachin Shashikant |
Need
Question |
|
|
|
Donlon, Eileen Merle |
Need
Question |
|
|
In symbolic
testing we replace constants with symbols to model infinitely many
executions. Explain domain dependent and domain independent transformations
by giving one example for each. Which one is harder to test afterwards and
why? |
Zazworka, Nico |
Need Solution |
|