Skip to main content
SpringerLink
Log in

An Investigation into Effective Test Coverage

  • Chapter
  • First Online:
Advanced Computing and Systems for Security

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 396))

Abstract

Metric for coverage test addresses certain structures of the test program to infer on the test complexity. In our work we explore a popular metric in unit testing namely definition-use, and analyse the evolution of test criteria defined within du testing. We analyse examples to describe subsumption and ordering in the set of criteria, and strength and weakness of one criteria with another. We examine a test metric to infer on coverage and adequacy of testing achieved through it using Weyuker’s set of properties. We enumerate a list of desirables those we thought contributed the effective structure in test coverage metric.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Mall, M.: Fundamentals of Software Engineering. PHI learning pvt. ltd., New York (2009)

    Google Scholar 

  2. Zhu, H., Hall, P.A.V., May, J.H.R.: Software unit test coverage and adequacy. ACM Comput. Surv. (CSUR) 29(4), 366–427 (1997)

    Article  Google Scholar 

  3. Weyuker, E.J.: Evaluating software complexity measures. IEEE Trans. Softw. Eng. 14(9), 1357–1365 (1988)

    Article  MathSciNet  Google Scholar 

  4. Rapps, S., Weyuker, E.J.: Data flow analysis techniques for test data selection. In: Proceedings of the Sixth International Conference of Software Engineering, Tokyo, Japan, pp. 272–277 (1982)

    Google Scholar 

  5. Chidamber, S.R., Kernerer, C.F.: A metrics suite for object oriented design. IEEE Trans. Softw. Eng. 20(6), 476–493 (1994)

    Article  Google Scholar 

  6. Nejmeh, B.A.: NPath: a measure of execution path complexity and its applications. Commun. ACM 188–200 (1988)

    Google Scholar 

  7. McCabe, T.J.: A complexity measure. IEEE Trans. Softw. Eng. 308–319 (1976)

    Google Scholar 

  8. Natofos, S.C.: On testing with required elements. In: Proceedings on COMPSAC’81, IEEE Computer Society, pp. 132–139 (1981)

    Google Scholar 

  9. Laski, J.W., Korel, B.: A data flow oriented program testing strategy. IEEE Trans. Softw. Eng. 9(3), 347–354 (1983)

    Article  MATH  Google Scholar 

  10. Mukherjee, D.: Dependency cov. criterion is testing. Technical report, submitted to CSE Dept., IIT Kharagpur (2015)

    Google Scholar 

  11. Mitchell, T.: Machine learning. McGraw-Hill, New York (1997)

    Google Scholar 

  12. Jones, J.A., Harrold, M.J., Stasko, J.: Visualization of test information to assist fault localization. In: Proceedings of the 24th International Conference on Software Engineering, ICSE ’02, pp. 467–477. ACM, New York (2002)

    Google Scholar 

  13. Koren, I., Krishna, C.M.: Fault Tolerant Systems. Elsevier, San Francisco (2007)

    Google Scholar 

  14. Weiser, M.: Program slicing. In: Proceedings of the 5th International Conference on Software Engineering, ICSE’81, pp. 439–449. IEEE Press, Piscataway (1981)

    Google Scholar 

  15. Weyuker, E.J.: The evaluation of program-based software test data adequacy criteria. Commun. ACM 31(6) 1988

    Google Scholar 

  16. Halstead, M.H.: Elements of software science. Elsevier, North-Holland (1977)

    MATH  Google Scholar 

  17. Myers, G.: An extension to the cyclomatic measure of program complexity. ACM SIGPLAN 12, 61–64 (1977)

    Article  Google Scholar 

  18. Chen, E.T.: Program complexity and programmer productivity. IEEE. Trans. Softw. Eng. 187–194 (1978)

    Google Scholar 

  19. Baker, A., Zwehen, S.: A comparison of measures of control flow complexity. IEEE Trans. Softw. Eng. 506–512 (1980)

    Google Scholar 

  20. Evangelist, W.: Software complexity metric sensitivity to program structuring rules. J. Syst. Softw. 231–243 (1983)

    Google Scholar 

  21. Kernighan, B., Plauger, P.: The elements of programming style, 2nd edn. McGraw-Hill, New York (1978)

    MATH  Google Scholar 

  22. Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling, vol. 1. Prentice-Hall, Englewood Cliffs (1972)

    Google Scholar 

  23. Beth McColl, R., McKim, J.C. Jr.: Evaluating and extending NPath as a software complexity measure. J. Syst. Softw. 17, 275–279 (1992)

    Google Scholar 

  24. Lakshmanan, K.B., Jayaprakash, S., Sinha, P.K.: Properties of control-flow complexity measures. IEEE. Trans. Softw. Eng. 17(12) 1991

    Google Scholar 

  25. Clarke, L.A., Podgurski, A., Richardson, D.J., Zeil, S.J.: A formal evaluation of data flow path selection criteria. IEEE Trans. Softw. Eng. 15(11), 1318–1332 (1989)

    Article  Google Scholar 

  26. Mund, G.B., Mall, R., Sarkar, S.: Computation of intraprocedural dynamic program slices. Inf. Softw. Technol. 45, 499–512 (2003)

    Article  Google Scholar 

  27. Mund, G.B., Mall, R.: Chapter 8: program slicing: the compiler design handbook: optimizations and machine code generation. CRC Press, Boca Raton (2003)

    Google Scholar 

  28. Schwarze Braunschweig, J.: An algorithm for hierarchical reduction and decomposition of a directed graph. Computing Springer, 25, 47–47 (1980)

    Google Scholar 

  29. McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. J. Discrete Appl. Math. Struct. decompos. width parameters graph label. 145(2) (2005)

    Google Scholar 

  30. Najumudheen, E.S.F., Mall, R., Samanta, D.: A dependence representation for coverage testing of object oriented programs. J. Object Technol. 9(4), 1–23 (2010)

    Article  Google Scholar 

  31. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Symposium of ACM special interest group on automata and computability theory special interest group on programming languages (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, 721302, India

    Debashis Mukherjee & Rajib Mall

Authors
  1. Debashis Mukherjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajib Mall
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Debashis Mukherjee .

Editor information

Editors and Affiliations

  1. A.K. Choudhury School of Information Technology, University of Calcutta, Kolkata, West Bengal, India

    Rituparna Chaki

  2. Computer Science, DAIS—Università Ca’ Foscari, Venice, Italy

    Agostino Cortesi

  3. Faculty of Computer Science, Bialystok University of Technology, Białystok, Poland

    Khalid Saeed

  4. Computer Science & Engineering, University of Calcutta, Kolkata, West Bengal, India

    Nabendu Chaki

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this chapter

Cite this chapter

Mukherjee, D., Mall, R. (2016). An Investigation into Effective Test Coverage. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 396. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2653-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2653-6_7

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2651-2

  • Online ISBN: 978-81-322-2653-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation