Predicate calculus and program semantics
Author(s)
Bibliographic Information
Predicate calculus and program semantics
（Texts and monographs in computer science）
Springer-Verlag, c1990
- : us
- : gw
Available at / 32 libraries
-
Science and Technology Library, Kyushu University
410.96/D 73068252191002116,
: us068222191000133 -
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
DC19:511.3/D572070155760
-
No Libraries matched.
- Remove all filters.
Description and Table of Contents
- Volume
-
: us ISBN 9780387969572
Description
This booklet presents a reasonably self-contained theory of predicate trans former semantics. Predicate transformers were introduced by one of us (EWD) as a means for defining programming language semantics in a way that would directly support the systematic development of programs from their formal specifications. They met their original goal, but as time went on and program derivation became a more and more formal activity, their informal introduction and the fact that many of their properties had never been proved became more and more unsatisfactory. And so did the original exclusion of unbounded nondeterminacy. In 1982 we started to remedy these shortcomings. This little monograph is a result of that work. A possible -and even likely- criticism is that anyone sufficiently versed in lattice theory can easily derive all of our results himself. That criticism would be correct but somewhat beside the point. The first remark is that the average book on lattice theory is several times fatter (and probably less self contained) than this booklet. The second remark is that the predicate transformer semantics provided only one of the reasons for going through the pains of publication."
- Volume
-
: gw ISBN 9783540969570
Description
This text gives a self-contained foundation of predicate transformer semantics by making extensive use of the predicate calculus. The semantics of the repetitive construct is defined in terms of weakest and strongest solutions in terms of the weakest precondition and the weakest liberal precondition, the notion of determinacy is defined it is shown how to cope unbounded nondeterminacy without using transfinite induction.
by "Nielsen BookData"
