A program cycle transformation with using of a symbolic notation

Nowadays there are not formal tools in the program industrial that can guarantee a lack of errors in analyzed software. A huge number of program paths affect to a complexity of a program analysis. An approach of reducing of a quantity of program paths is described in the paper. This approach bases on a symbolic notation. According to this approach variables after program cycle should be depicted as a symbolic expression. Wherein additional variables are introduced in these expressions for describing of a set of a program variables. After that a program should be depicted as a graph with contexts as a nodes. Then this graph of contexts might be analyzed in any state by calculation of an expression where symbols are substituted by their possible values in this context.