Il est montre que les deux modeles analyses (Zipf et Halstead) ont des distributions de la frequence de termes tout a fait differentes meme s'ils proviennent d'une approche unifiee du probleme d'evaluation de logiciel

A new software testing strategy is described. The strategy is "adaptive" in that previous test paths (inputs) are used as a guide in the selection of subsequent paths (inputs). Preliminary implementations have successfully exploited the method's inherent user-interactive capability. The method ensures branch coverage, requires only "order n" tests (n being the number of decision nodes in the program flowgraph), and offers considerable advantages over existing strategies in its computational requirements.

In software engineering, various ‘metrics’ have been introduced in an attempt to measure the complexity of programs. We show how the whole idea of a ‘software complexity measure’ can be axiomatized in such a way as to include the more familiar concrete examples and to allow for new measures that might offer advantages not captured by those previously introduced. In particular, a new testing measure is introduced, based on the ‘multiple-condition’ test strategy. Comparisons are made between this new measure and the more traditional metrics. In addition, a more general theoretical study is initiated, showing the effect of the axiomatic development in relation to the treatment of program structuredness.

A decomposition theory for flowchart schemata is presented, and a series of algorithms for implementing the nested decomposition is discussed. It is suggested that the utilisation of this process as an initial phase of a flowchart structuring routine, will ensure the recognition and preservation of a given flowchart's inherent topology.

A theory relating certain labeled directed graphs and Boolean expressions over propositional variables is seen to have several interesting applcations in computer science, most notably to programming, compiling, and switching theory. The applications arise from the capability of realizing any Boolean expression by a member of the class of digraphs here considered, those we shall call "atomic."

The principal result of Paull and Unger on incomplete machine minimization is given an algebraic setting whereby an analogy with the classical minimization theory for Boolean functions is exhibited.

This article treats the tree circuit synthesis problem for families F = {f1, f2, . . ., fm} of Boolean functions fjof the same three variables. In addition to the development of criteria for determining the most economical of the three possible tree circuit decompositions: fj(X3, X2, X1) = F3j,(G3j(X2, X1), H3j(X2, X1), X3) fj(x3, X2, X1) = F2j(G2j(x3, x1), H2j(x3, X1), X2) fj(X3, X2, X1) = F1j(G1j(X3, X2), H1j(X3, X2), X1) (j = 1, 2, ..., m) of a given family, certain upper bounds BT(3, m) are obtained on the ``tree circuit cost'' T(F) of such a family; these have the property that regardless of the members of F, the inequality T(F)≤BT(3, m) holds and furthermore, a family F exists which actually attains this upper bound. These upper bounds or estimates are known to have a wide application in switching theory generally, and in particular in the theory of tree circuits and in the decomposition theory of Boolean functions.

This article is primarily concerned with means for finding economical tree circuit realizations-iterative applications of decompositions f(xn, xn-1,..., x1) = Fi(Gi(xn, xn-1,..., xi,..., x1), Hi,(xn, xn-1,..., xi,..., x1), xi) and their associated circuitry-for Boolean functions f(xn, xn-1,..., x1). A uniform estimate or inequality shows that when synthesis is effected with two-input-per-gate circuitry, tree circuits are preferable to those which result from conventional sum of products techniques. The practical significance of the estimate is illustrated by its application to the tree circuit synthesis problem. The relationship of tree circuit theory to decomposition theory is established and the extension of the present theory to the corresponding multiple-output and incompletely-specified problems is indicated.

The literature concerned with methods for finding the minimal form of a truth function is, by now, quite extensive. This article extends this knowledge by introducing an algorithm whereby all calculations are performed on decimal numbers obtained from binary-decimal conversion of the terms of the Boolean function. Several computational aids are presented for the purpose of adapting this algorithm to the solution of large-scale problems on a digital computer.