RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.3, n.2 (8), 1995/

Structural synthesis of parallel programs (Methodology and Tools)

Authors: G.Cejtlin, E. Jushchenko

Abstract

Concepts of structured programming and propositional program logics were anticipated in the systems of algorithmic algebras (SAAs) introduced by V.M.Glushkov in 1965. This paper correlates the SAA language with the known formalisms describing logic schemes of structured and unstructured programs. Complete axiomatics is constructed for modified SAAs (SAA-M) oriented towards the formalization of parallel computations and abstract data types. An apparatus formalizing (top-down, bottom-up, or combined) design of programs is suggested that incorporates SAA-M, grammar and automaton models oriented towards multiprocessing. A method and tools of parallel program design are developed. They feature orientation towards validation, transformations and synthesis of programs.

G.E. Cejtlin, E.L. Jushchenko
V.M.Glushkov Institute of Cybernetics
Ukrainian Academy of Sciences,
Kiev, 252207, Ukraina

Fulltext

Adobe PDF document0.19 Mb