Structure synthesis of parallel programs (Methodology and Tools)
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 Program Abstract Data Type Structure Synthesis Derater Representation Complete Axiomatic
Unable to display preview. Download preview PDF.
- 1.Glushkov W.M., Zeitlin G.E., Justschenko E.I. Algebra. Sprachen. Programming. — Akademie-Verlag, Berlin, 1980, p.340.Google Scholar
- 2.Cejtlin G.E. Formal Aspects of Structured GOTO Programming. — Programmirovanie, 1984,No.1,pp.3–16.Google Scholar
- 3.Knuth Donald E. Structured Programming GOTO Statements. — Computing Surveys, v.6,No.4,December, 1974, p.292.Google Scholar
- 4.Cejtlin G.E.,Jushchenko E.L. Multilevel Synthesis of Structured Programs. — Kibernetika, 1982,No.5,p.p.11–21, 32.Google Scholar
- 5.Tsejtlin G.E., Jushchenko E.L. Several Aspects of Theory of Parametric Models of Languages and Parallel Syntactic Analysis. — Lecture Notes in Computer Science, 1977,No.47,pp.231–245.Google Scholar