An Investigation into Effective Test Coverage

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.

[1]  Anas N. Al-Rabadi,et al.  A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[2]  S. Jayaprakash,et al.  Properties of Control-Flow Complexity Measures , 1991, IEEE Trans. Software Eng..

[3]  Beth McColl,et al.  Evaluating and extending npath as a software complexity measure , 1992, J. Syst. Softw..

[4]  W. M. Evangelist.  Software complexity metric sensitivity to program structuring rules , 1983, J. Syst. Softw..

[5]  Janusz W. Laski,et al.  A Data Flow Oriented Program Testing Strategy , 1983, IEEE Transactions on Software Engineering.

[6]  Hong Zhu,et al.  Software unit test coverage and adequacy , 1997, ACM Comput. Surv..

[7]  Albert L. Baker,et al.  A Comparison of Measures of Control Flow Complexity , 1979, IEEE Transactions on Software Engineering.

[8]  Edward T. Chen,et al.  Program Complexity and Programmer Productivity , 1978, IEEE Transactions on Software Engineering.

[9]  Jochen Schwarze.  An algorithm for hierarchical reduction and decomposition of a directed graph , 2005, Computing.

[10]  Simeon C. Ntafos,et al.  ON TESTING WITH REQUIRED ELEMENTS. , 1981 .

[11]  Rajib Mall,et al.  A Dependence Representation for Coverage Testing of Object-Oriented Programs , 2010, J. Object Technol..

[12]  Brian A. Nejmeh,et al.  NPATH: a measure of execution path complexity and its applications , 1988, CACM.

[13]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[14]  Ross M. McConnell,et al.  Linear-time modular decomposition of directed graphs , 2005, Discret. Appl. Math..

[15]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[16]  Lori A. Clarke,et al.  A Formal Evaluation of Data Flow Path Selection Criteria , 1989, IEEE Trans. Software Eng..

[17]  Mark Weiser,et al.  Program Slicing , 1981, IEEE Transactions on Software Engineering.

[18]  John T. Stasko,et al.  Visualization of test information to assist fault localization , 2002, ICSE '02.

[19]  Rajib Mall,et al.  Computation of intraprocedural dynamic program slices , 2003, Inf. Softw. Technol..

[20]  Elaine J. Weyuker,et al.  Evaluating Software Complexity Measures , 2010, IEEE Trans. Software Eng..

[21]  Elaine J. Weyuker,et al.  Data flow analysis techniques for test data selection , 2015, ICSE '82.

[22]  Chris F. Kemerer,et al.  A Metrics Suite for Object Oriented Design , 2015, IEEE Trans. Software Eng..

[23]  Elaine J. Weyuker,et al.  The evaluation of program-based software test data adequacy criteria , 1988, CACM.

[24]  Glenford J. Myers,et al.  An extension to the cyclomatic measure of program complexity , 1977, SIGP.

[25]  Maurice H. Halstead,et al.  Elements of software science , 1977 .