Systematic software development using VDM
Systematic software development using VDM
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
A calculus of refinements for program derivations
Acta Informatica
Notions of computation and monads
Information and Computation
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
| Hi-index | 0.00 |
A theory of programming is intended to help in the construction of programs that provably meet their specifications. It starts with a complete lattice of specifications, used as a domain for the semantics of the programming language. The operators of the language are defined as monotonic functions over this domain. This paper presents a method which enables us to derive an enriched semantics for the imperative languages. We show that the new definition of the primitive commands can be recast as the weakest solution of the embedding equation, and demonstrate how the operators of the programming language are redefined from the homomorphic property of the embedding and the healthiness conditions imposed on "real" programs.