|
Computer Science, Engineering and Control
A toolkit for supporting formal verification of programs in the functional data-flow parallel programming language
M. S. Ushakova, A. I. Legalov Siberian Federal University, Institute of Space and Information
Technology (Krasnoyarsk, Russian Federation)
Abstract:
The article is devoted to the architecture development of the toolkit for supporting formal verification of functional data-flow parallel programs in the Pifagor Language. The method ofdeduction based on Hoare logic is used for formal verification. A proof process is considered asa tree where each node is a program data-flow graph, whose edges are marked with formulasin a specification language. The tree root is the initial Hoare triple, namely the program data-flow graph with a precondition and a postcondition. In this article basic transformations of thedata-flow graph are considered: edge marking, equivalent transformation, splitting, folding of theprogram. By means of these transformations the initial triple is being transformed and finally isreduced to a set of formulas in the specification language. If all of these formulas are identicallytrue, then the program is correct. Architecture of the toolkit for supporting formal verification offunctional data-flow parallel programs is proposed, which allows to construct a proof three. Theimplementation of the toolkit is introduced and its main functionality is considered.
Keywords:
functional data-flow parallel programming, Pifagor programming language, programs formal verification, toolkit for supporting formal verification.
Received: 11.02.2015
Citation:
M. S. Ushakova, A. I. Legalov, “A toolkit for supporting formal verification of programs in the functional data-flow parallel programming language”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 4:2 (2015), 58–70
Linking options:
https://www.mathnet.ru/eng/vyurv21 https://www.mathnet.ru/eng/vyurv/v4/i2/p58
|
Statistics & downloads: |
Abstract page: | 166 | Full-text PDF : | 77 | References: | 24 |
|