|
Title:
|
HIERARCHICAL METRICS FOR COMPUTING THE
MINIMUM NUMBER OF TEST PATHS IN
CONTROL-FLOW GRAPHS |
|
Author(s):
|
Ronald Salloum |
|
ISBN:
|
978-989-8704-24-5 |
|
Editors:
|
Hans Weghorn |
|
Year:
|
2020 |
|
Edition:
|
Single |
|
Keywords:
|
Software Testing, Path Testing, Control-flow Graph, Prime Decomposition, Hierarchical Metrics |
|
Type:
|
Full |
|
First Page:
|
11 |
|
Last Page:
|
18 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
The path-based testing of control-flow graphs is an important method for software testing. The minimum number of test
paths with respect to different coverage criteria is used as a testability and quality measure of programs. Based on the
prime decomposition of control-flow graphs, hierarchical metric formulas have been developed to compute the minimum
number of test paths for a given control-flow graph. These recursive formulas have been developed for traditional primes,
such as if-then and while statements, and with respect to visit-each-loop, simple path, statement, branch, and basis path
(McCabe or structured) coverage. In this paper, we develop formulas for other primes that are available in most
programming languages and have become very common in practice. Also, we illustrate an efficient algorithm that utilizes
the hierarchical formulas to generate a set with the minimum number of test paths with respect to a given coverage
criterion. |
|
|
|
|
|
|
