Elements of Software Science (Operating and programming systems series)
Elements of Software Science (Operating and programming systems series)
Invariant properties of algorithms.
Invariant properties of algorithms.
Measuring commercial PL/I programs using Halstead's criteria
ACM SIGPLAN Notices
A design tool used to quantitatively evaluate student projects
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Validating Halstead's Theory for Pascal Programs
IEEE Transactions on Software Engineering
Surveyor's Forum: Heads I Win, Tails You Lose
ACM Computing Surveys (CSUR)
Surveyor's Forum: Projecting Problems
ACM Computing Surveys (CSUR)
APL compared with other languages according to Halstead's theory
ACM SIGPLAN Notices
Analyzer-generated and human-judged predictors of computer program readability
CHI '82 Proceedings of the 1982 Conference on Human Factors in Computing Systems
Extending Halstead's software science for a more precise measure of APL
APL '82 Proceedings of the international conference on APL
APL and Halstead's theory of software metrics
APL '81 Proceedings of the international conference on APL
The measurement of software science parameters in software designs
Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality
Defining software science counting strategies
ACM SIGPLAN Notices
A nesting level complexity measure
ACM SIGPLAN Notices
A study of the structural composition of PL/I programs
ACM SIGPLAN Notices
Software metrics: an introduction and annotated bibliography
ACM SIGSOFT Software Engineering Notes
ACM SIGMETRICS Performance Evaluation Review
Software maintainability assessment based on fuzzy logic technique
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
Professor Maurice Halstead of Purdue University first defined a set of properties of algorithms in 1972. The properties are defined in terms of the number of unique operators, unique operands, total operators, and total operands used to express the algorithm. Since 1972, independent experiments have measured various sets of algorithms and have supported Halstead's theories concerning these properties. Also, new properties have been defined and experiments performed to study them.This paper reports a study in which different methods of counting operators and operands are applied to a fixed set of 34 algorithms written in PL/I. Some properties of the algorithms vary significantly depending on the counting method chosen; other properties remain stable. Although no one counting method can be shown to be best, the results do indicate the importance of the counting method to the overall measurement of an algorithm. Moreover, the results provide a reminder of how sensitive some of the measurements are and of how careful researchers must be when drawing conclusions from software science measurements.