USE OF SOFTWARE SCIENCE IN EVALUATING MODULARITY CONCEPTS

被引：9

作者：

BAKER, AL

ZWEBEN, SH

机构：

[1] Department of Computer and Information Science, Ohio State University, Columbus

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1979年 / 5卷 / 02期

关键词：

Index Terms-Data flow analysis; modularity; operator and operand identification; program transformations; programming effort; software science;

D O I：

10.1109/TSE.1979.234167

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

An investigation is made into the extent to which relationships from software science are useful in analyzing programming methodology principles that are concerned with modularity. Using previously published data from over 500 programs, it is shown that the software science effort measure provides quantitative answers to questions concerning the conditions under which modularization is beneficial. Among the issues discussed are the reduction of similar code sequences by temporary variable and subprogram definition, and the use of global variables. Using data flow analysis, environmental considerations which affect the applicability of alternative modularity techniques are also discussed. The results obtained using software science are compared with certain generally accepted methodologies involving modularity, and show strong agreement. Finally, the results suggest some areas of potential improvement in the technique used to obtain the software science measurements. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.

引用

页码：110 / 120

页数：11

共 13 条

[1]

Bulut N., Invariant properties of algorithms

[2]

Bulut N., Halstead M.H., Bayer R., Experimental validation of a structural property of FORTRAN algorithms, Proc. Assoc. Comput. Mach. Annu. Conf., pp. 207-211, (1974)

[3]

Elshoff J.L., Measuring commercial PL/I programs using Halstead's criteria, Assoc. Comput. Mach. SIGPLAN Notices, vol, 11, pp. 38-46, (1976)

[4]

An investigation into the effects of the counting used on software science measurements, Assoc. Comput. Mach. SIG-PLAN Notices, 13, pp. 30-45, (1978)

[5]

Fosdick L.D., Osterweil L.J., Data flow analysis in software reliability, Assoc. Comput. Mach. Comput. Surv., 8, pp. 305-330, (1976)

[6]

Gordon R.D., Halstead M.H., An experiment comparing programming times and the software physics hypothesis, 1976 AFIPS Conf. Proc., Nat. Comput. Conf., 45, pp. 935-937, (1976)

[7]

Gordon R.D., A measure of mental effort related to program clarity

[8]

Halstead M.H., A theoretical relationship between mental work and machine language programming, Dep. Comput. Sci., Purdue Univ., Lafayette, IN, Tech. Rep, (1972)

[9]

An experimental determination of the purity of a trivial algorithm, Assoc. Comput. Mach. SIGME Performance Evaluation Rev., 2, pp. 10-15, (1973)

[10]

Toward a theoretical basis for estimating programming effort, Proc. Assoc. Comput. Mach. Annu. Conf., pp. 222-224, (1975)

← 1 2 →