TY - JOUR A1 - Gold, Robert T1 - Control flow graphs and code coverage JF - International Journal of Applied Mathematics and Computer Science N2 - The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node coverage, and edge coverage, respectively. UR - https://doi.org/10.2478/v10006-010-0056-9 KW - directed graph KW - control flow graph KW - graph reduction KW - software testing KW - statement coverage KW - branch coverage Y1 - 2010 UR - https://doi.org/10.2478/v10006-010-0056-9 UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:573-23736 SN - 2083-8492 VL - 20 IS - 4 SP - 739 EP - 749 PB - Sciendo CY - Warsaw ER - TY - JOUR A1 - Gold, Robert T1 - A uniform approach to control flow graphs of programs JF - Far East Journal of Applied Mathematics UR - https://doi.org/10.17654/FJAMOct2015_027_049 Y1 - 2015 UR - https://doi.org/10.17654/FJAMOct2015_027_049 SN - 0972-0960 VL - 93 IS - 1 SP - 27 EP - 49 PB - Pushpa Publishing House CY - Allahabad ER -