DD path graphs
Structural testing is based on the source code of the program under test, rather than the definition. This is known as white box testing, while functional testing is known as black-box testing.
Program diagram: For a program written in an imperative programming language, the program diagram is a directed graph with nodes representing statement fragments and edges representing control flow.
DD - path
DD path: Decision-to-decision path (Miller). Begin with the "exit" of the decision statement and end with the "path" of the next decision statement.
DD chain: A path of starting and ending nodes at different points in a directed graph.
Consisting of a node, the internality =0;
Consisting of a node, externality =0;
Consisting of a node, the inner degree > =2 or the outer degree > =2;
Consisting of a node, the degree inside =1 and the degree outside =1;
Length > =1 for maximum drill
DD - path graph
A DD-path graph is a labeled directed graph in which nodes represent the DD Path of a program graph and edges represent the control flow of the Path.
For a given program, many different program diagrams can be constructed, all of which can be reduced to a unique DD-path diagram.
It is possible to generate DD paths for programs up to 100 lines, and above that size, analysis tools are generally required.
The simplest control flow diagram is the DD path. DD can be thought of as belonging to the control flow diagram.
DD path definition:
Given a program written in an imperative language, its DD path graph is a directed graph, where nodes represent the DD paths of its program graph and edges represent the control flow between successive DD paths.
In fact, the DD path graph is a compressed graph in which 2-connected components are compressed into a single node corresponding to the 5DD path.
source:
https://www.eecs.yorku.ca/course_archive/2009-10/W/4313/slides/08-PathTestingCoverage.pdf
Comments
Post a Comment