Тип публикации: статья из журнала

Год издания: 2018

Идентификатор DOI: 10.3103/S0146411618070301

Ключевые слова: data driven functional parallel programming, Pifagor programming language, correctness of recursions, elimination of mutual recursion, universal recursive function

Аннотация: In the article, we consider verification of programs with mutual recursion in the data driven functional parallel language Pifagor. In this language the program could be represented as a data flow graph, that has no control connections, and only has data

Журнал: AUTOMATIC CONTROL AND COMPUTER SCIENCES

Выпуск журнала: Vol. 52, Is. 7

Номера страниц: 850-866

ISSN журнала: 01464116

Место издания: NEW YORK

Издатель: ALLERTON PRESS INC

• Ushakova M.S. (Siberian Fed Univ, Inst Space & Informat Technol, Krasnoyarsk 660074, Russia)
• Legalov A.I. (Siberian Fed Univ, Inst Space & Informat Technol, Krasnoyarsk 660074, Russia)

• Scopus
• Web of Science Core Collection
• РИНЦ (eLIBRARY.RU)