Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27) - Hardcover

Book 10 of 40: Cambridge Tracts in Theoretical Computer Science

Hesselink, Wim H.

 
9780521404365: Programs, Recursion and Unbounded Choice (Cambridge Tracts in Theoretical Computer Science, Series Number 27)

Synopsis

A complete account of the predicate transformation calculus semantics of sequential programs.

"synopsis" may belong to another edition of this title.

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

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.

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title

9780521018296: Programs Recursion Unbounded Choice: 27 (Cambridge Tracts in Theoretical Computer Science, Series Number 27)

Featured Edition

ISBN 10:  0521018293 ISBN 13:  9780521018296
Publisher: Cambridge University Press, 2008
Softcover