ИСТИНА

In the talk the problem of verification of functional programs (FPs) over strings is considered, where specifications of properties of FPs are defined by other FPs, and a FP Σ1 meets a specification defined by another FP Σ2 iff a composition of functions defined by the FPs Σ1 and Σ2 is equal to the constant 1. We introduce a concept of a state diagram of a FP, and reduce the verification problem to the problem of an analysis of the state diagrams of FPs. The proposed approach is illustrated by the example of verification of a sorting program.