Fabunmi S. Formal Methods for Client-Server Systems in Compositional Languages for Parallel Programming

Parallel environments today are widespread, since single-processor systems have been significantly restricted in performance. For many modern systems, the need to prove their properties, in particular, the correctness of functioning, is urgent. One of the largest subclasses of such parallel programs is client-server systems. Therefore, the question of constructing adequate models of parallel systems, including such with a shared memory, allows to effectively perform mathematical verification of the properties of these systems. The thesis is aimed at reducing the gap between existing theoretical models and real parallel systems by expanding and refining such models. The basic model of the parallel systems under investigation is the implementation of shared memory interleaving concurrency. This is an adequate model of server systems for most client-server complexes, in particular, service-oriented, network and other software systems.