Some Properties Derived from Structural Analysis of Program Graph Models

It is considered interesting to identify, from the structure of control flow and of relationships among variables in a program, some properties allowing to point out possible sources of errors or of faulty behavior. In particular, it is found that information about termination of loops and about meaningfulness of acceptance tests in recopery block strategy can be extracted from such structural analysis. Criteria for applying this analysis to programs with arbitrary structures are presented.