Minimum Number of Test Paths for Prime Path and other Structural Coverage Criteria

09/22/2018
by   Anurag Dwarakanath, et al.
0

The software system under test can be modeled as a graph comprising of a set of vertices, (V) and a set of edges, (E). Test Cases are Test Paths over the graph meeting a particular test criterion. In this paper, we present a method to achieve the minimum number of Test Paths needed to cover different structural coverage criteria. Our method can accommodate Prime Path, Edge-Pair, Simple & Complete Round Trip, Edge and Node coverage criteria. Our method obtains the optimal solution by transforming the graph into a flow graph and solving the minimum flow problem. We present an algorithm for the minimum flow problem that matches the best known solution complexity of O(|V| |E|). Our method is evaluated through two sets of tests. In the first, we test against graphs representing actual software. In the second test, we create random graphs of varying complexity. In each test we measure the number of Test Paths, the length of Test Paths, the lower bound on minimum number of Test Paths and the execution time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2022

Isometric path complexity of graphs

We introduce and study a new graph parameter, called the isometric path ...
research
07/25/2022

Novel Strategy Generating Variable-length State Machine Test Paths

Finite State Machine is a popular modeling notation for various systems,...
research
10/31/2022

TPGen: A Self-Stabilizing GPU-Based Method for Prime and Test Paths Generation

This paper presents a novel scalable GPU-based method for Test Paths (TP...
research
01/15/2021

A Data Flow Analysis Framework for Data Flow Subsumption

Data flow testing creates test requirements as definition-use (DU) assoc...
research
01/25/2022

Safety and Completeness in Flow Decompositions for RNA Assembly

Decomposing a network flow into weighted paths has numerous applications...
research
06/24/2018

Inferring Routing Preferences of Bicyclists from Sparse Sets of Trajectories

Understanding the criteria that bicyclists apply when they choose their ...
research
12/25/2021

DIAR: Removing Uninteresting Bytes from Seeds in Software Fuzzing

Software fuzzing mutates bytes in the test seeds to explore different be...

Please sign up or login with your details

Forgot password? Click here to reset