Question

explain Data flow strategies subject-software testing. Answer please have exam afternoon​

Answer 1

Explanation:

Data Flow Testing is a specific strategy of software testing that focuses on data variables and their values. It makes use of the control flow graph. ... It is done to cover the path testing and branch testing gap. The process is conducted to detect the bugs because of the incorrect usage of data variables or data values

Answer 2

Answer:

Data Flow Testing Strategies

Following are the test selection criteria

1. All-defs: For every variable x and node i in a way that x has a global declaration in node I, pick a comprehensive path including the def-clear path from node i to

Edge (j,k) having a p-use of x or

Node j having a global c-use of x

2. All c-uses: For every variable x and node i in a way that x has a global declaration in node i, pick a comprehensive path including the def-clear path from node i to all nodes j having a global c-use of x in j.

3. All p-uses: For every variable x and node i in a way that x has a global declaration in node i, pick a comprehensive path including the def-clear path from node i to all edges (j,k) having p-use of x on edge (j,k).

4. All p-uses/Some c-uses: it is similar to all p-uses criterion except when variable x has no global p-use, it reduces to some c-uses criterion as given below

5. Some c-uses: For every variable x and node i in a way that x has a global declaration in node i, pick a comprehensive path including the def-clear path from node i to some nodes j having a global c-use of x in node j.

6. All c-uses/Some p-uses:it is similar to all c-uses criterion except when variable x has no global c-use, it reduces to some p-uses criterion as given below:

7. Some p-uses: For every variable x and node i in a way that x has a global declaration in node i, pick a comprehensive path including def-clear paths from node i to some edges (j,k) having a p-use of x on edge (j,k).

8. All uses:it is a combination of all p-uses criterion and all c-uses criterion.

9. All du-paths:For every variable x and node i in a way that x has a global declaration in node i, pick a comprehensive path including all du-paths from node i

To all nodes j having a global c-use of x in j and

To all edges (j,k) having a p-use of x on (j,k).

Data Flow Testing Applications