A Review and Evaluation of Software Science
ACM Computing Surveys (CSUR)
Experimental validation of a structural property of fortran algorithms
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Natural laws controlling algorithm structure?
ACM SIGPLAN Notices
Measuring commercial PL/I programs using Halstead's criteria
ACM SIGPLAN Notices
Measuring Improvements in Program Clarity
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
The claims that software science could provide an empirical basis for the rationalization of all forms of algorithm description are shown to be invalid from a formal point of view. In particular, the conjectured dichotomy between operators and operands is shown not to hold over a wide class of languages. An experiment that investigated discrepancies between the level measure and its estimator is described to show that its failure was due to shortcomings in the theory. One cannot obtain reliable results without tampering with both measure and estimator definitions.