The theory of Software Science, proposed by Halstead  deals with measurable properties of computer programs. In software science, a computer program is considered to be a string of tokens which are divided into “operators” and “operands”. Generally, any symbol or keyword group in a program that specifies an algorithmic action of the computer is considered an operator, and any symbol used to represent data is considered an operand. All software science measures are functions of the counts of the operators and the operands.
Unable to display preview. Download preview PDF.
- Debnath, N.C., and Zweben, S.H. (1984) A Study of the Application of Software Metrics to COBOL, Tech. Rep. OSU-CISRC-TR-84–3, Computer and Information Science Research Center, Ohio State University.Google Scholar
- Fung, K.C., Debnath, N.C., and Zweben, S.H. (1983) A Software Science Analyzer for COBOL, Tech. Rep. OSU-CISRC-TR-83–2, Computer and Information Science Research Center, Ohio State University.Google Scholar
- Shen, V.Y., and Dunsmore, H.E. (1980) A Software Science Analysis of COBOL Programs, Tech. Rep. CSD-TR-348, Department of Computer Science, Purdue University.Google Scholar
- Smith, C.P. (1980) A Software Science Analysis of IBM Programming Products, IBM Santa Teresa Laboratory, Tr 03.081.Google Scholar
- Zweben, S.H., and Fung, K.C. (1979) Exploring Software Science Relations in COBOL and APL, COMPSAC 79, 702–707.Google Scholar