Abstract:
A method is proposed for design of programs structured as a tree with cycles. Any program is shown to be realizable as such a program. Simultaneously with design of a program a test is generated which satisfies a combinatorial criterion. Successively generated test examples are used for realizing the concept of «staged program compilation».