This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
A central problem in the design of programming systems is to provide methods for verifying that computer code performs to specification. This book presents a rigorous foundation for defining Boolean categories, in which the relationship between specification and behaviour can be explored. Boolean categories provide a rich interface between program constructs and techniques familiar from algebra, for instance matrix- or ideal-theoretic methods. The book's distinction is that the approach relies on only a single program construct (the first-order theory of categories), the others being derived mathematically from four axioms. Development of these axioms (which are obeyed by an abundance of program paradigms) yields Boolean algebras of 'predicates', loop-free constructs, and a calculus of partial and total correctness which is shown to be the standard one of Hoare, Dijkstra, Pratt, and Kozen. The book is based in part on courses taught by the author, and will appeal to graduate students and researchers in theoretical computer science.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 10,25 expédition depuis Canada vers Etats-Unis
Destinations, frais et délaisVendeur : Benjamin Books, Ottawa, ON, Canada
Etat : Very Good (+). hardcover. N° de réf. du vendeur 10677
Quantité disponible : 1 disponible(s)