Question

4. Consider the following predicate: ((a ? b) ? c ? ¬(d ? e)) ? (f = g), where a, b, d, e, f and g are integer variables and c is a Boolean variable. a) Use the BRO-CSET procedure to derive the constraint set for this predicate. (20 points) b) Generate test cases for the constraint set you have derived in a). (5 points) 2.1 N is an OR-node: $S_N^f = S_{N_1}^f ? S_{N_2}^f$ $S_N^f = (S_{N_1}^f × {t_1}) ? ({t_1} × S_{N_2}^f)$ where $t_1 ? S_{N_1}^f$ and $t_2 ? S_{N_2}^f$ 2.2 N is an AND-node: $S_N^f = S_{N_1}^f ? S_{N_2}^f$ $S_N^f = (S_{N_1}^f × {t_1}) ? ({t_1} × S_{N_2}^f)$ where $t_1 ? S_{N_1}^f$ and $t_2 ? S_{N_2}^f$ 2.3 N is NOT-node: $S_N^f = S_{N_1}^f$ $S_N^f = S_{N_1}^f

          4. Consider the following predicate: ((a ? b) ? c ? ¬(d ? e)) ? (f = g), where a, b, d, e, f and g are
integer variables and c is a Boolean variable.
a) Use the BRO-CSET procedure to derive the constraint set for this predicate. (20 points)
b) Generate test cases for the constraint set you have derived in a). (5 points)
2.1 N is an OR-node:
$S_N^f = S_{N_1}^f ? S_{N_2}^f$
$S_N^f = (S_{N_1}^f × {t_1}) ? ({t_1} × S_{N_2}^f)$
where $t_1 ? S_{N_1}^f$ and $t_2 ? S_{N_2}^f$
2.2 N is an AND-node:
$S_N^f = S_{N_1}^f ? S_{N_2}^f$
$S_N^f = (S_{N_1}^f × {t_1}) ? ({t_1} × S_{N_2}^f)$
where $t_1 ? S_{N_1}^f$ and $t_2 ? S_{N_2}^f$
2.3 N is NOT-node:
$S_N^f = S_{N_1}^f$
$S_N^f = S_{N_1}^f

4. Consider the following predicate: ((a ? b) ? c ? ¬(d ? e)) ? (f = g), where a, b, d, e, f and g are
integer variables and c is a Boolean variable.
a) Use the BRO-CSET procedure to derive the constraint set for this predicate. (20 points)
b) Generate test cases for the constraint set you have derived in a). (5 points)
2.1 N is an OR-node:
SN^f = SN1^f ? SN2^f
SN^f = (SN1^f × t1) ? (t1 × SN2^f)
where t1 ? SN1^f and t2 ? SN2^f
2.2 N is an AND-node:
SN^f = SN1^f ? SN2^f
SN^f = (SN1^f × t1) ? (t1 × SN2^f)
where t1 ? SN1^f and t2 ? SN2^f
2.3 N is NOT-node:
SN^f = SN1^f
SN^f = SN1^f

Added by Jerome A.

Question

Please give Ace some feedback