Skip to main content
Have a personal or library account? Click to login
Control flow graphs and code coverage Cover

References

  1. Jalote, P. (2005)., Springer, New York, NY.
  2. Kosaraju, S. (1973). Analysis of structured programs,, pp. 240-252.
  3. McCabe, T. (1976). A complexity measure,(4): 308-320.
  4. Paige, M. (1977). On partitioning program graphs,(6): 386-393.
  5. Rapps, S. and Weyuker, E. (1982). Data flow analysis techniques for test data selection,, pp. 272-278.
  6. Sommerville, I. (2004)., 7th Edn., Pearson Education Limited, Boston, MA.
  7. Tan, L. (2006). The Worst Case Execution Time Tool Challenge 2006: The External Test,
  8. White, L. (1981). Basic mathematical definitions and results in testing,B. Chandrasekaran and S. Radicchi (Eds.),, North-Holland, New York, NY.
  9. Zhu, H., Hall, P. and May, J. (1997). Software unit test coverage and adequacy,(4): 366-427.
DOI: https://doi.org/10.2478/v10006-010-0056-9 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 739 - 749
Published on: Dec 20, 2010
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2010 Robert Gold, published by University of Zielona Góra
This work is licensed under the Creative Commons License.