Predicate Transformer Semantics by Manes Ernest (12 results)

Condition: New.

Condition: New. In.

Paperback. Condition: New.

Condition: New. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science. Series Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 236 pages, black & white illustrations. BIC Classification: UM; UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 13. Weight in Grams: 430. . 2008. Illustrated. paperback. . . . .

Condition: New. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science. Series Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 236 pages, black & white illustrations. BIC Classification: UM; UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 13. Weight in Grams: 430. . 2008. Illustrated. paperback. . . . . Books ship from the US and Ireland.

Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Condition: Brand New. 1st edition. 223 pages. 9.50x7.25x0.50 inches. In Stock. This item is printed on demand.

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Paperback. Condition: new. Paperback. 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. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science.Inhaltsverzeichnis1. Finite coproducts 2. Structure of a Boolean category.

Taschenbuch. Condition: Neu. Predicate Transformer Semantics | Ernest G. Manes (u. a.) | Taschenbuch | Englisch | 2004 | Cambridge University Press | EAN 9780521616102 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.