Programming from specifications | Guide books skip to main content ACM Digital Library home
ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …

Dijkstra's programming language is extended by specification statements, which specify
parts of a program “yet to be developed.” A weakest precondition semantics is given for …

The refinement calculus, based on weakest preconditions, elaborates program
developments as a series of steps linked by a mathematical refinement relation …

A formalization of the IEEE standard for binary floating-point arithmetic (ANSI/IEEE Std. 754-
1985) is presented in the set-theoretic specification language Z. The formal specification is …

Software is being applied in an ever-increasing number of areas. Computer programs and
systems are becoming more complex and consisting of more delicately interconnected …

Data refinement is the systematic substitution of one data type for another in a program.
Usually, the new data type is more efficient than the old, but possibly more complex; the …

Data refinement is the systematic substitution of one data type for another in a program.
Usually, the new data type is more efficient than the old, but also more complex; the purpose …

Relational models for imperative programming languages provide a representation of
commands in terms of binary input-output relations over states. Various relational models …

Data refinement is the transformation in a computer program of one data type to another.
Usually, we call the original data type 'abstract'and the final data type 'concrete'. The …

The notions of procedures, parameters, and abstraction are by convention treated together
in methods of imperative program development. Rules for preserving correctness in such …