Metrics to measure the complexity of partial programs
暂无分享,去创建一个
[1] Maurice H. Halstead,et al. Elements of software science , 1977 .
[2] Anas N. Al-Rabadi,et al. A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .
[3] Enrique Ivan Oviedo. Control flow, data flow and program complexity , 1984 .
[4] Victor R. Basili,et al. Iterative enhancement: A practical technique for software development , 1975, IEEE Transactions on Software Engineering.
[5] Martin R. Woodward,et al. A Measure of Control Flow Complexity in Program Text , 1979, IEEE Transactions on Software Engineering.
[6] Glenford J. Myers,et al. An extension to the cyclomatic measure of program complexity , 1977, SIGP.
[7] James L. Elshoff,et al. An Analysis of Some Commercial PL/I Programs , 1976, IEEE Transactions on Software Engineering.
[8] Bill Curtis,et al. Measuring the Psychological Complexity of Software Maintenance Tasks with the Halstead and McCabe Metrics , 1979, IEEE Transactions on Software Engineering.
[9] James L. Elshoff,et al. Measuring commercial PL/I programs using Halstead's criteria , 1976, SIGP.
[10] Wilfred J. Hansen,et al. Measurement of program complexity by the pair: (Cyclomatic Number, Operator Count) , 1978, SIGP.
[11] Edward T. Chen,et al. Program Complexity and Programmer Productivity , 1978, IEEE Transactions on Software Engineering.