Control flow graphs and code coverage

Authors:
Robert Gold
Affiliations:
Faculty of Electrical Engineering and Computer Science, Ingolstadt University of Applied Sciences, Esplanade 10, D-85049 Ingolstadt, Germany
Venue:
International Journal of Applied Mathematics and Computer Science
Year:
2010

Citing 7
Cited 0

Software unit test coverage and adequacy

ACM Computing Surveys (CSUR)
Analysis of structured programs

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Data flow analysis techniques for test data selection

ICSE '82 Proceedings of the 6th international conference on Software engineering
Software Engineering (7th Edition)

Software Engineering (7th Edition)
An Integrated Approach to Software Engineering

An Integrated Approach to Software Engineering
A Complexity Measure

IEEE Transactions on Software Engineering
On Partitioning Program Graphs

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.