Programs, Recursion and Unbounded Choice - Rilegato

Hesselink, Wim H.

Rilegato

ISBN 10: 0521404363 ISBN 13: 9780521404365

Casa editrice: Cambridge University Press, 1992

Riassunto

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

Su questo libro

Recensione

"...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

Descrizione del libro

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.

Dettagli dell'edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 1992
• Lingua: Inglese
• ISBN 10: 0521404363
• ISBN 13: 9780521404365
• Rilegatura: Copertina rigida
• Numero di pagine: 235
• Contatto del produttore: non disponibile
• Persona responsabile: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Francia