PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2010 | 20 | 4 | 739-749
Tytuł artykułu

Control flow graphs and code coverage

Autorzy
Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
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.
Rocznik
Tom
20
Numer
4
Strony
739-749
Opis fizyczny
Daty
wydano
2010
otrzymano
2010-01-14
poprawiono
2010-08-16
Twórcy
autor
  • Faculty of Electrical Engineering and Computer Science, Ingolstadt University of Applied Sciences, Esplanade 10, D-85049 Ingolstadt, Germany
Bibliografia
  • 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, http://www.absint.com/ait/wcet tool challenge 2006 final report.pdf.
  • 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.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-amcv20i4p739bwm
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.