The article describes the theoretical aspects of verification of block-synchronous parallel programs for computing systems built using BigData technology. We are witnessing a rapidly growing interest in the problem of software verification. Now software developers have access to a wide range of methods for proving program properties in popular programming languages, and tools that allow automating the verification of the correctness of the proofs given. The software verification process is complicated and expensive from a financial point of view. Despite this, there are a number of advantages that make verification indispensable in some cases, even in comparison with traditional testing. In the staged part of the study, the object of research is defined -the semantics of programming languages and tools for creating block-synchronous parallel programs, and the purpose of the study is to describe an abstract computer that executes programs in a special language, which is a subset of the C language that can be used for program verification. In the course of the research conducted on the subject of the article, important results were obtained, including an Исследование выполнено при финансовой поддержке РФФИ в рамках научного проекта № 19-07-00516 А.