2016/04/14 by Andrew M. Mironov, Mironov, Andrew M. · 1 citation
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Software Testing and Debugging Techniques #Web Application Security Vulnerabilities #cs.LO
paper · pdf · doi:10.48550/arxiv.1604.04240
20 pages, 3 figures
arxiv created 2016/04/14 · openalex publication_date 2016/04/14 · arxiv updated 2016/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the paper 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 S1 meets a specification defined by another FP S2 iff a composition of functions defined by the FPs S1 and S2 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.