Paths
â&#x20AC;˘ At least One PATH thru the Program
â&#x20AC;˘ More paths for disconnected domains

11

ref boris beizer

Domain Testing - Domains & Paths

U3

Summary:
• Domain for a loop-free program corresponds to a set of
numbers defined over the input vector
• For every domain, there is at least one path thru the
routine, along which that domain’s processing is done
• The set of interpreted predicates traversed on that path
(ie., the path’s predicate expression) defines the
domain’s boundaries.

Domain Testing - Domains & Paths â&#x20AC;&#x201C; Domain Testing
General DT Strategy
1. Select test points near the boundaries.
2. Define test strategy for each possible bug related to
boundary
3. Test points for a domain useful to test its adjacent domain.
4. Run the tests. By post test analysis determine if any
boundaries are faulty & if so how?
5. Run enough tests to verify every boundary of every domain