Geodesic
Control flow graphs and code coverage
International Journal of Applied Mathematics and Computer Science, Tome 20 (2010) no. 4, pp. 739-749.

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: directed graph, control flow graph, graph reduction, software testing, statement coverage, branch coverage
Mots-clés : graf skierowany, graf przepływowy, testowanie oprogramowania 
@article{IJAMCS_2010_20_4_a10,
     author = {Gold, R.},
     title = {Control flow graphs and code coverage},
     journal = {International Journal of Applied Mathematics and Computer Science},
     pages = {739--749},
     publisher = {mathdoc},
     volume = {20},
     number = {4},
     year = {2010},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/IJAMCS_2010_20_4_a10/}
}
TY  - JOUR
AU  - Gold, R.
TI  - Control flow graphs and code coverage
JO  - International Journal of Applied Mathematics and Computer Science
PY  - 2010
SP  - 739
EP  - 749
VL  - 20
IS  - 4
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/IJAMCS_2010_20_4_a10/
LA  - en
ID  - IJAMCS_2010_20_4_a10
ER  - 
%0 Journal Article
%A Gold, R.
%T Control flow graphs and code coverage
%J International Journal of Applied Mathematics and Computer Science
%D 2010
%P 739-749
%V 20
%N 4
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/IJAMCS_2010_20_4_a10/
%G en
%F IJAMCS_2010_20_4_a10
Gold, R. Control flow graphs and code coverage. International Journal of Applied Mathematics and Computer Science, Tome 20 (2010) no. 4, pp. 739-749. https://geodesic-test.mathdoc.fr/item/IJAMCS_2010_20_4_a10/

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

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

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

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

[5] 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.

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

[7] Tan, L. (2006). TheWorst Case Execution Time Tool Challenge 2006: The External Test, Technical report, http://www.absint.com/ait/wcet tool challenge 2006 final report.pdf.

[8] 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.

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