Experimental validation of a structural property of fortran algorithms
Necdet Bulut, Maurice H. Halstead, Rudolf Bayer · 1974
Recent studies [1,3,8,9] have shown that theory predicts, and limited experimental data confirm, the existence of a functional relationship between the length, N, of the expression of an algorithm and the number of distinct operators, n1,and of distinct operands, n2,required to express that algorithm in various languages. Data previously examined, however, was restricted to a small sample of rather short, published algorithms, for which n1,n2and N could be measured manually.