Exercise 5
Submit time: April 29
1.Use the constraint set SE={(t,t,t,f),(t,f,t,t),(f,t,t,f),(t,f,t,f),(t,t,f,t)}of
to show that
the following faulty versions of the predicate evaluate differently than Ε on at least one test case
derived from SE.
2.Construct a BRE constraint set for predicate pr : (a + b) < c ∧ ¬p ∨ (r > s).And generate
corresponding test case to satisfy BRE constraint set.
3. Use the BOR-CSET procedure to generate tests from the predicate pr : a + b.
(a) Do the tests generated guarantee the detection of the missing Boolean variable fault that causes
the implementation of pr to be a?
(b) Do the tests generated guarantee the detection of the extra Boolean variable fault in
coding pr that causes the implementation to be a + b + c, where c is the extra Boolean variable?