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

References

  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.10.1109/TSE.1976.233837
  4. Paige, M. (1977). On partitioning program graphs, IEEE Transactions on Software Engineering SE-3(6): 386-393.10.1109/TSE.1977.231171
  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). The Worst Case Execution Time Tool Challenge 2006: The External Test, Technical reporthttp://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.10.1145/267580.267590
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
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.

Volume 20 (2010): Issue 4 (December 2010)