Programs Recursion Unbounded Choice - Couverture souple

Livre 10 sur 40: Cambridge Tracts in Theoretical Computer Science

Hesselink, Wim H.

 
9780521018296: Programs Recursion Unbounded Choice
Couverture souple
ISBN 10 : 0521018293 ISBN 13 : 9780521018296
Editeur : Cambridge University Press, 2008

Synopsis

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

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Revue de presse

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

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Cambridge University Press
Date d'édition
2008
Langue
anglais
ISBN 10 
0521018293
ISBN 13 
9780521018296
Reliure
Broché
Nombre de pages
240
Coordonnées du fabricant
non disponible
Personne responsable
Avery
https://www.avery.fr/

chemin des peupliers 27
Dardilly
France

Autres éditions populaires du même titre

9780521404365: Programs, Recursion and Unbounded Choice

Edition présentée

ISBN 10 :  0521404363 ISBN 13 :  9780521404365
Editeur : Cambridge University Press, 1992
Couverture rigide