scientific article; zbMATH DE number 4020448
In specifying the desired behaviour of a sequential program, it is quite natural to describe this as a relation R between the initial values of the variables on entry to the program and the final values of the variables on successful termination of the program. It is unnecessary to make any mention of non-termination, because it can be taken for granted that we never wish to specify that a program must fail to terminate. It therefore seems unnecessary to introduce the fictitious state \(\perp\) into the mathematics of the language D. This paper describes how this problem is solved in the Vienna Development Method (VDM). We will show that all specifications can for all practical purposes be expressed in the VDM format. The main results include: (1) All programs of D can be expressed in VDM. (2) For any relation R, there is an equivalent relation expressible in VDM. In this paper we also present examples to illustrate how to use the concept of the weakest prespecification in data refinement. - For part I see ibid. 9, 51-84 (1986; Zbl 0603.68009).
- The weakest prespecification
- Proof system for weakest prespecification
- Algebraization of quantifier logics, an introductory overview
- Relation algebras as residuated Boolean algebras
- A relation algebraic model of robust correctness
- Relation-algebraic semantics
- Parallel constructions of maximal path sets and applications to short superstrings
- A relational division operator: The conjugate kernel
- Nondeterministic semantics of compound diagrams
- Pair algebras and Galois connections.
- scientific article; zbMATH DE number 8784 (Why is no real title available?)
- Extensions of Lambek calculi
- Jifeng He at Oxford and beyond: an appreciation
- Embedding a demonic semilattice in a relation algebra
- Regular algebra applied to language problems
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 Q3763567)