Programs, recursion, and unbounded choice : predicate-transformation semantics and transformation rules / Wim H. Hesselink.
Hesselink, Wim H.| Call Number | 005.13/1 |
| Author | Hesselink, Wim H., author. |
| Title | Programs, recursion, and unbounded choice : predicate-transformation semantics and transformation rules / Wim H. Hesselink. Programs, Recursion & Unbounded Choice |
| Physical Description | 1 online resource (xii, 223 pages) : digital, PDF file(s). |
| Series | Cambridge tracts in theoretical computer science ; 27 |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Summary | This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs. |
| Subject | COMPUTER PROGRAMMING. |
| Multimedia |
Total Ratings:
0
02361nam a22003858i 4500
001
vtls001585324
003
VRT
005
20200921122600.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
200921s1992||||enk o ||1 0|eng|d
020
$a 9780511569784 (ebook)
020
$z 9780521404365 (hardback)
020
$z 9780521018296 (paperback)
035
$a (UkCbUP)CR9780511569784
039
9
$y 202009211226 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA76.6 $b .H483 1992
082
0
0
$a 005.13/1 $2 20
100
1
$a Hesselink, Wim H., $e author.
245
1
0
$a Programs, recursion, and unbounded choice : $b predicate-transformation semantics and transformation rules / $c Wim H. Hesselink.
246
3
$a Programs, Recursion & Unbounded Choice
264
1
$a Cambridge : $b Cambridge University Press, $c 1992.
300
$a 1 online resource (xii, 223 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
490
1
$a Cambridge tracts in theoretical computer science ; $v 27
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520
$a This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs.
650
0
$a COMPUTER PROGRAMMING.
776
0
8
$i Print version: $z 9780521404365
830
0
$a Cambridge tracts in theoretical computer science ; $v 27.
856
4
0
$u https://doi.org/10.1017/CBO9780511569784
999
$a VIRTUA
No Reviews to Display
| Summary | This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs. |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Subject | COMPUTER PROGRAMMING. |
| Multimedia |