Defining software science counting strategies

Authors:
Norman F. Salt
Affiliations:
The Ontario Institute for Studies in Education, Toronto, Ontario, Canada
Venue:
ACM SIGPLAN Notices
Year:
1982

Citing 5
Cited 2

A Review and Evaluation of Software Science

ACM Computing Surveys (CSUR)
Elements of Software Science (Operating and programming systems series)

Elements of Software Science (Operating and programming systems series)
PASCAL user manual and report

PASCAL user manual and report
An investigation into the effects of the counting method used on software science measurements

ACM SIGPLAN Notices
Software psychology: Human factors in computer and information systems (Winthrop computer systems series)

Software psychology: Human factors in computer and information systems (Winthrop computer systems series)

Validating Halstead's Theory for Pascal Programs

IEEE Transactions on Software Engineering
Complexity measures for assembly language programs

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although the Software Science metrics originally proposed by Halstead are appealing, calculation of the metrics depends on the existence of well-defined counting strategies. The strategies require precise definitions of operators and operands. It is important that the strategies employed be described in research papers. Furthermore, the presentation of helpful examples of the application of the strategies is recommended. Good descriptions do not imply correct strategies, but they do ensure that the strategies can be understood, tested, and evaluated. Appendices to this paper provide the description of a Pascal counting strategy and an example of applying the strategy.