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 fprmalisms describing logic schemes of structured and unstructured programs. Complete axiomatics are constructed for modified SAAs (SAA-M) oriented towards the formalization of parallel computations and abstract data types. An apparatus formalizing the (top-down, bottom-up, or combined) design of programs is suggested incorporating SAA-M, grammar and automaton models. A method and tools of parallel program design are developed. They feature orientation towards validation, transformations and synthesis of programs.KeywordsParallel ProgramAbstract Data TypeStructure SynthesisDerater RepresentationComplete AxiomaticThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
