Mathematical foundation for the design of testing systems

Discusses optimum strategies for the design of knowledge built systems, and in particular, software testing systems. Object oriented methodology and dynamic programming techniques are used to define testing milestones and computational algorithms. The testing process is viewed as the initialization and control of data flow between different software parts. The major issue is how to define the demand for testing services. After demand is defined, the next step is to apply the minimum spanning tree algorithm to serve this demand for a minimum cost. The formalized minimum spanning tree algorithm, elaborated, enables one to resolve the design complexity problem for a very large system (CATV network design).<
>