On the Mathematics of Sequential Decompositions

Abstract We view the process of constructing a program as the stepwise transformation of a relation into simpler relations. In this paper, we focus on a particular transformation: that which decomposes the specification of an iterative program into the specification of the initialization segment and the specification of the while loop. We investigate in some detail the mathematics of this decomposition.

[1]  Rudolf Berghammer,et al.  Relational Algebraic Semantics of Deterministic and Nondeterministic Programs , 1986, Theor. Comput. Sci..

[2]  Jules Desharnais,et al.  ABSTRACT RELATIONAL SEMANTICS , 1989 .

[3]  C. A. R. Hoare,et al.  The Weakest Prespecification , 1987, Information Processing Letters.

[4]  Jules Desharnais,et al.  Formal models of stepwise refinements of programs , 1986, CSUR.

[5]  Ali Mili.  An introduction to program fault tolerance: A structured programming approach , 1990 .

[6]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

[7]  Edsger W. Dijkstra,et al.  A method of programming , 1988 .

[8]  Eric C. R. Hehner.  A Practical Theory of Programming , 1993, Texts and Monographs in Computer Science.

[9]  Ali Mili,et al.  Heuristics for Constructing While Loops , 1992, Sci. Comput. Program..

[10]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[11]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[12]  Roland Carl Backhouse,et al.  Program construction and verification , 1986, PHI Series in computer science.

[13]  Gunther Schmidt,et al.  Relation algebras: Concept of points and representability , 1985, Discret. Math..

[14]  Tony Hoare,et al.  The Weakest Prespecification II , 1986 .

[15]  Ali Mili,et al.  Regularity of Relations: A Measure of Uniformity , 1991, Theor. Comput. Sci..

[16]  David Gries,et al.  The Science of Programming , 1981, Text and Monographs in Computer Science.