scientific article; zbMATH DE number 4092735

From MaRDI portal
Publication:3819969





The effect of program decomposition on the specification and verification of parallel executing processes (i.e., sequential programs) is studied. The development of parallel sorting algorithms introducing language constructs, specification methods, and verification principles, the concepts of compositional and modular completeness are discussed. The TNP language (theoretical networks of processes), more powerful than the language DNP (dynamic networks of process), is introduced. Translation of DNP into TNP is indicated. The semantics of TNP is developed. Similarities between the treatment of state transformations and communications exist. Treatment of parallelism by means of a projection operation is described. An assertion language is introduced to express properties of communication histories, states,and three types of process specifications. Three proof systems are discussed, i.e. the \textit{C. A. R. Hoare}'s [Lect. Notes Math. 188, 102-116 (1971; Zbl 0221.68020)], invariant, and a new system developed for a type of specifications called SAT formula. Representation of the Hoare system by equivalent formulae of the SAT system is found. The completeness question of the SAT system is discussed. The compositional completeness of the SAT, Hoare and invariant proof system is treated.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3819969)