Programs, Recursion and Unbounded Choice
Wim H. Hesselink, "Programs, Recursion and Unbounded Choice"
1992 | pages: 237 | ISBN: 0521404363 | DJVU | 1,7 mb

Predicate transformation semantics is the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction, and unbounded nondeterminacy. The author develops their theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming methodology. He gives proofs of the 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.
Download link:
Links are Interchangeable - Single Extraction - Premium is support resumable

Alternate Link for Programs, Recursion and Unbounded Choice.rar When above links are dead

Hello Respective Visitor!

Please Login or Create a FREE Account to gain accesss to hidden contents.


Would you like to leave your comment? Please Login to your account to leave comments. Don't have an account? You can create a free account now.