Titlebook: Mathematics of Program Construction; 375th Anniversary of J. L. A. Snepscheut Conference proceedings 1989 Springer-Verlag Berlin Heidelberg

固定某物

Specifications of concurrently accessed data,an be manipulated easily. This allowed us to derive several properties of the buffer (Appendix A) and construct a proof of buffer concatenation (Section 4). Also refinement of the specification with the eventual goal of implementation seems feasible with this scheme.

寬度

有組織

A lattice-theoretical basis for a specification language,nguage permits unbounded nondeterminism, demonic and angelic nondeterminism and is extended to permit miracles also. It is shown to be complete, in the sense that all monotonic predicate transformers can be constructed in it. The base language provides a unifying framework for various specification

光亮

Embolic-Stroke

Deriving mixed evaluation from standard evaluation for a simple functional language,cation for mixed evaluation. Using techniques inspired by natural semantics we specify a standard evaluator by a set of inference rules. The evaluation of programs is then performed by a restricted kind of theorem proving in this logic. We then describe a systematic method for extending the proof sy