Structured Testing: A Software Testing Methodology Using the Cyclomatic Complexity Metric

and Acknowledgements viii PART 1. Measuring and Limiting Program Complexity

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[3]  Donald E. Knuth,et al.  An empirical study of FORTRAN programs , 1971, Softw. Pract. Exp..

[4]  Kenneth W. Kolence,et al.  Software physics and computer performance measurements , 1972, ACM '72.

[5]  Brian W. Kernighan,et al.  Elements of Programming Style , 1974 .

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

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

[8]  Michael R. Paige.  An analytical approach to software testing , 1978, COMPSAC.

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

[10]  NED CHAPIN.  A measure of software complexity , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[11]  THOMAS J. WALSH,et al.  A software reliability study using a complexity measure , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[12]  Bill Curtis,et al.  Third time charm: Stronger prediction of programmer performance by software complexity metrics , 1979, ICSE 1979.

[13]  John W. Bailey,et al.  The Effects of the Symbology and Spatial Arrangement of Software Specifications in a Debugging Task. , 1981 .

[14]  D. Kafura,et al.  On the relationships among three software metrics , 1981, Measurement and evaluation of software quality.