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

bypass

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626968.jpg

Scleroderma

0302-9743 The conference was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University‘s 375th anniversary. The creative inspiration of the modern computer has led to the development of new mathematics, the mathematics of program construction. I

excursion

Conference proceedings 1989ence was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University‘s 375th anniversary. The creative inspiration of the modern computer has led to the development of new mathematics, the mathematics of program construction. Initially c

Obvious

Networks of communicating processes and their (De-)composition,ract space turns out to be the space of delay-insensitive specifications. As operator we study composition of networks. The composition operator on the resulting space is shown to have a surprisingly simple factorization property, the prove of which turns out to be very simple due to the approach taken.

慢跑

mechanical

lethal

Towards totally verified systems,o show how a simple application could be verified. An application is implemented in a simple language and verified to be correct. This program is then compiled for a simple instruction set by a verified compiler. This instruction set is then implemented on a simple verified processor.

乳白光

A lattice-theoretical basis for a specification language,e sense that all monotonic predicate transformers can be constructed in it. The base language provides a unifying framework for various specification languages; we show how two Dijkstra-style specification languages can be embedded in the base language.

沒收

Searching by elimination,eneral scheme is refined — depending on the mathematical properties of the objects involved — to a particular program. This is illustrated by some examples, varying from elementary problems to more advanced problems.

tangle

Realizability models for program construction,recursion equations. Our aim is to ensure that, when constructive reasoning is harnessed for the derivation of programs from proofs of specifications, the programs we obtain are expressed in a natural way.