ENSURING FULL COVERAGE TEST PLANNING WITH ORDER COVERAGE REQUIREMENTS - CIP of IL920130036US1
Publication Date: 2014-Mar-03
The IP.com Prior Art Database
A method to improve coverage in CTD involving both order dependent and order independent attributes, by analyzing restrictions and adding order requirements to enable the generation of scenarios that may have been omitted.
Page 01 of 2
ENSURING FULL COVERAGE TEST PLANNING WITH ORDER COVERAGE REQUIREMENTS -
-- CIP of IL
CIP of IL 920130036 US
The CTD with ordering can be computed by:
Apply an event sequencing algorithm to generate sequences that satisfy order requirements
Define Boolean attributes for each order requirement
Associate values to these attributes for every sequence generated in Step 1.
Perform CTD such that the values for the attributes in Step 2 are only selected from the sequences of Step 1, and all the rest are generated as usual.
This method is not guarantied to achieve full coverage of the interaction requirements. Consider the following model:
A: a1, a2
B: b1, b2
C: c1, c2
Assume we want pairwise coverage of all values and orders. The event sequencing result can be:
A, B, C
C, B, A
If we have a restriction ``if C is before B and B is before A then A == a1'', then we cannot cover any of the ordered pairs in which A=a2 is second (B=b1,A=a2, B=b2,A=a2 , C=c1,A=a2, and C=c2,A=a2). In this case, we do not get full coverage of the
interaction requirements, since all these combinations can be covered with another event sequencing result, e.g.,
C, A, B
B, A, C
The root cause of such problems is that the restriction implies a requirement on a particular event sequence that is not guaranteed by the interaction requirements.
We can do the following to achieve better coverage: for every restriction, take the order-dependent parameters used in the restriction and add to the event se...