Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) 1st Edition by Wim H. Hesselink (PDF)

Description

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.

User’s Reviews

Editorial Reviews: Review “…an excellent book to get acquainted with the ideas and methods of the program methodology community….It is clear, elegant and well-written. Every serious student of programming methodology should read this carefully, and serious researchers in the denotational semantics of unbounded indeterminacy would be well-rewarded by a study of this book.” Prakesh Panangaden, SIGACT News”…would make a good text for an advanced graduate course on semantics or program specification and verification. There are sufficient exercises for self-study or for use in a course. It is clear, thorough, well written, and carefully conceived.” Gary T. Leavens, SIAM Review”…of interest for theoretical computer scientists and mathematicians…” Mathematical Reviews Book Description A complete account of the predicate transformation calculus semantics of sequential programs. Book Description Predicate transformation semantics are 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, developed by the author to a greater depth than has been achieved before. Read more

Keywords

Free Download Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) 1st Edition in PDF format
Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) 1st Edition PDF Free Download
Download Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) 1st Edition 1992 PDF Free
Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) 1st Edition 1992 PDF Free Download
Download Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) 1st Edition PDF
Free Download Ebook Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) 1st Edition