https://github.com/bblodfon/yates-hennel-gen

A generalization of the Yates and Hennel algorithm (branch coverage software testing)
https://github.com/bblodfon/yates-hennel-gen

algorithm branch-coverage c software-testing yates-hennel

Last synced: about 1 month ago
JSON representation

A generalization of the Yates and Hennel algorithm (branch coverage software testing)

• Host: GitHub
• URL: https://github.com/bblodfon/yates-hennel-gen
• Owner: bblodfon
• License: mit
• Created: 2015-02-17T11:42:11.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2020-02-15T18:39:49.000Z (almost 5 years ago)
• Last Synced: 2024-10-05T11:30:50.564Z (about 2 months ago)
• Topics: algorithm, branch-coverage, c, software-testing, yates-hennel
• Language: C
• Homepage:
• Size: 1.51 MB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

        
# yates-hennel-gen

In this repo I have implemented a generalization of the Yates and Hennel algorithm.

## Method

The [Yates-Hennel paper](https://github.com/bblodfon/yates-hennel-generalization/blob/master/doc/Yates-Hennel%20paper.pdf) presents an algorithm for **full branch coverage testing of any program**.

The implementation of the simple *Yates-Hennel algorithm* would choose one arbitrary forward tree from

the *Decision-to-Decision (DD) graph* and a backward one and then it would calculate `n-m+1` paths based

on the shortest paths of those trees and the formula that is being presented on the paper.

This method can produce paths that are maybe non-coverable or don't reach *100% brach-coverage* (Test Effectiveness Ratio - **TER2 = 1**).

My algorithm is an extension of the *Yates-Hennel algorithm* in the sense that it produces all the sets of solution result paths from every combination of forward and backward trees. (DD-graph is actually a multigraph so that's why there can be many forward and backward trees).

**Having every possible solution path set** (with the addition of being able to remove paths that you know beforehand that are non-coverable and also removing solution path sets that are permutations of others) **you can easily find the best one in terms of TER2 coverage**.

## Compile and run (Windows)

```

g++ -std=c++11 hennel.c -o hennel.exe

hennel.exe < findroot.txt

```

## Notes

- The `.txt` files have *Basic Block graphs* that represent simple programs: `1 2 3` in one line translates to 2 edges: `1->2` and `1->3`.

- The `excluded_paths.txt` has the number of paths excluded and the path themselves (you can change them as you like).

- The `results.txt` is the file where all the results are stored (and some other info, like number of forward trees, etc.)

- The `hennel_graphs` directory has some graphs created (based on the `triangle.txt` file) with the use of the `dot` program.