Control flow graphs and code coverage

Open access

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

Jalote, P. (2005). An Integrated Approach to Software Engineering, Springer, New York, NY.

Kosaraju, S. (1973). Analysis of structured programs, Proceedings of the 5th Annual ACM Symposium on Theory of Computing, Austin, TX, USA, pp. 240-252.

McCabe, T. (1976). A complexity measure, IEEE Transactions on Software Engineering SE-2(4): 308-320.

Paige, M. (1977). On partitioning program graphs, IEEE Transactions on Software Engineering SE-3(6): 386-393.

Rapps, S. and Weyuker, E. (1982). Data flow analysis techniques for test data selection, Proceedings of the 6th International Conference on Software Engineering, Tokyo, Japan, pp. 272-278.

Sommerville, I. (2004). Software Engineering, 7th Edn., Pearson Education Limited, Boston, MA.

Tan, L. (2006). The Worst Case Execution Time Tool Challenge 2006: The External Test, Technical report

White, L. (1981). Basic mathematical definitions and results in testing, in B. Chandrasekaran and S. Radicchi (Eds.), Computer Program Testing, North-Holland, New York, NY.

Zhu, H., Hall, P. and May, J. (1997). Software unit test coverage and adequacy, ACM Computing Surveys 29(4): 366-427.

International Journal of Applied Mathematics and Computer Science

Journal of the University of Zielona Góra

Journal Information

IMPACT FACTOR 2017: 1.694
5-year IMPACT FACTOR: 1.712

CiteScore 2018: 2.09

SCImago Journal Rank (SJR) 2018: 0.493
Source Normalized Impact per Paper (SNIP) 2018: 1.361

Mathematical Citation Quotient (MCQ) 2017: 0.13

Cited By


All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 255 204 11
PDF Downloads 79 68 4