Formal Verification of Programs in Functional Dataflow Parallel Language
The article is devoted to the methods of proving parallel programs correctness that are based on the axiomatic approach. Formal system for functional data-flow parallel programming language Pifagor is described. On the basis of this system programs correctness could be proved.
Saved in:
Main Authors: | M. S. Kropacheva, A. I. Legalov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2015-03-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/59 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Automation of Formal Verification of Programs in the Pifagor Language
by: M. S. Ushakova, et al.
Published: (2015-08-01) -
Tail Recursion Transformation in Functional Dataflow Parallel Programs
by: A. I. Legalov, et al.
Published: (2015-02-01) -
Verification of Programs with Mutual Recursion in the Pifagor Language
by: Mariya S. Ushakov, et al.
Published: (2018-08-01) -
Loop-invariant Optimization in the Pifagor Language
by: Vladimir S. Vasilev, et al.
Published: (2018-08-01) -
The System for Transforming the Code of Dataflow Programs into Imperative
by: Vladimir S. Vasilev, et al.
Published: (2021-06-01)