PROCESS DESIGN MATRIX & SUMMARY

Process Design Matrix & Summary

Process Design Matrix & Summary

Introduction

In connection with the application of computer technology in all areas of human activity actual problem is the reliability of the software (software). The use of modern technologies in programming aimed primarily at creating high-quality software, characterized by the execution time, the required amount of RAM, etc etc. However, the introduction of new effective organizational and methodological rules for the design of software systems does not prevent the occurrence of errors in the operation of programs. In addition, very often the current practice of creating programs based only on skills and intuition of experts, leading to the presence of a large number of undetected errors in testing and the poor quality of the product. Currently, much attention is given to advancing the effective testing program; works have appeared in the assessment of the reliability and quality of software tools developed by the theoretical foundations of diagnostic software modules [1-3].

Discussion

This work is devoted to the detection and correction of errors in software code. It is proposed formal approach to the problem of diagnosing the structure of software modules, consisting of multiple errors in the localization of software code module detected during testing.

Statement of the problem

One of the hallmarks of high quality engineering design is its modularity. With the modular design of the system is divided into separate components, each component has its own purpose and clearly defined inputs and outputs. The structure of the program module will present a graph management [1]. Each vertex of this graph corresponds to the linear portion of the program, which may end with a branch, and the edges represent communication between line management areas. Linear area characterized by a single input single output and focuses all of the statements executed without branching. It is assumed that the source program graph is acyclic and correct, i.e. does not contain a dead-end and terminal vertices.

Algorithm to construct the graph routing testing

Column management defines the ordering so that each directed arc coming out of the top of the lower-numbered and entered the top with a big room. To automate the testing process, it is necessary to construct a mathematical model of the graph test routes.

Route program is a sequence of the form v 1, (v 1, v 2), v 2, (v 2, v 3), ..., (v n-1, v n), v n, where ...