<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></abstract>

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.

Control flow graphs and code coverage

Faculty of Electrical Engineering and Computer Science, Ingolstadt University of Applied Sciences, Esplanade 10, D-85049 Ingolstadt, Germany

International Journal of Applied Mathematics and Computer Science

{"article-title":"Control flow graphs and code coverage"}

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...

Control flow graphs and code coverage

Online veröffentlicht: 20. Dez. 2010

Seitenbereich: 739 - 749

DOI: https://doi.org/10.2478/v10006-010-0056-9

Schlüsselwörter
directed graph, control flow graph, graph reduction, software testing, statement coverage, branch coverage

This content is open access.

Control flow graphs and code coverage

Online veröffentlicht: 20. Dez. 2010

Seitenbereich: 739 - 749

DOI: https://doi.org/10.2478/v10006-010-0056-9

Schlüsselwörterdirected graph, control flow graph, graph reduction, software testing, statement coverage, branch coverage

This content is open access.

Schlüsselwörter
directed graph, control flow graph, graph reduction, software testing, statement coverage, branch coverage