{"id":15384686,"url":"https://github.com/bblodfon/yates-hennel-gen","last_synced_at":"2025-09-10T00:19:06.314Z","repository":{"id":27436586,"uuid":"30914585","full_name":"bblodfon/yates-hennel-gen","owner":"bblodfon","description":"A generalization of the Yates and Hennel algorithm (branch coverage software testing)","archived":false,"fork":false,"pushed_at":"2020-02-15T18:39:49.000Z","size":1588,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-27T22:44:20.933Z","etag":null,"topics":["algorithm","branch-coverage","c","software-testing","yates-hennel"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bblodfon.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-02-17T11:42:11.000Z","updated_at":"2020-02-15T18:39:51.000Z","dependencies_parsed_at":"2022-07-24T15:15:04.510Z","dependency_job_id":null,"html_url":"https://github.com/bblodfon/yates-hennel-gen","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bblodfon/yates-hennel-gen","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblodfon%2Fyates-hennel-gen","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblodfon%2Fyates-hennel-gen/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblodfon%2Fyates-hennel-gen/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblodfon%2Fyates-hennel-gen/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bblodfon","download_url":"https://codeload.github.com/bblodfon/yates-hennel-gen/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblodfon%2Fyates-hennel-gen/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274300176,"owners_count":25259715,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-09T02:00:10.223Z","response_time":80,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","branch-coverage","c","software-testing","yates-hennel"],"created_at":"2024-10-01T14:43:04.815Z","updated_at":"2025-09-10T00:19:06.255Z","avatar_url":"https://github.com/bblodfon.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# yates-hennel-gen\n\nIn this repo I have implemented a generalization of the Yates and Hennel algorithm.\n\n## Method\n\nThe [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**.\n\nThe implementation of the simple *Yates-Hennel algorithm* would choose one arbitrary forward tree from\nthe *Decision-to-Decision (DD) graph* and a backward one and then it would calculate `n-m+1` paths based\non the shortest paths of those trees and the formula that is being presented on the paper.\nThis method can produce paths that are maybe non-coverable or don't reach *100% brach-coverage* (Test Effectiveness Ratio - **TER2 = 1**).\n\nMy 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).\n\n**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**.\n\n## Compile and run (Windows)\n\n```\ng++ -std=c++11 hennel.c -o hennel.exe\nhennel.exe \u003c findroot.txt\n```\n\n## Notes\n\n- The `.txt` files have *Basic Block graphs* that represent simple programs: `1 2 3` in one line translates to 2 edges: `1-\u003e2` and `1-\u003e3`.\n- The `excluded_paths.txt` has the number of paths excluded and the path themselves (you can change them as you like).\n- The `results.txt` is the file where all the results are stored (and some other info, like number of forward trees, etc.)\n- The `hennel_graphs` directory has some graphs created (based on the `triangle.txt` file) with the use of the `dot` program.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbblodfon%2Fyates-hennel-gen","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbblodfon%2Fyates-hennel-gen","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbblodfon%2Fyates-hennel-gen/lists"}