Articoli correlati a Predicate Transformer Semantics
Sinossi
This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Descrizione del libro
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. The book is based in part on courses taught by the author, and will appeal to graduate students and researchers in theoretical computer science.
Contenuti
1. Finite coproducts; 2. Structure of a Boolean category; 3. Metatheory; 4. Distributive categories; Bibliography; Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 63,65
EUR 3,42 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Predicate Transformer Semantics
Foto dell'editore
Predicate Transformer Semantics (Cambridge Tracts in Theoretical Computer Science, Series Number 33)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190009524
Quantità: Più di 20 disponibili
Foto dell'editore
Predicate Transformer Semantics (Paperback)
Editore:
Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616107
ISBN 13: 9780521616102
Nuovo
Paperback
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780521616102
Quantità: 1 disponibili
Foto dell'editore
Predicate Transformer Semantics (Cambridge Tracts in Theoretical Computer Science, Series Number 33)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521616102_new
Quantità: Più di 20 disponibili
Foto dell'editore
Predicate Transformer Semantics (Cambridge Tracts in Theoretical Computer Science)
Editore:
Cambridge University Press 2008-08-21, 2008
ISBN 10: 0521616107
ISBN 13: 9780521616102
Nuovo
Paperback
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521616102
Quantità: 10 disponibili
Foto dell'editore
Predicate Transformer Semantics
Editore:
Cambridge University Press, 2004
ISBN 10: 0521616107
ISBN 13: 9780521616102
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 460. Codice articolo C9780521616102
Quantità: Più di 20 disponibili
Foto dell'editore
Predicate Transformer Semantics (Cambridge Tracts in Theoretical Computer Science, Series Number 33)
Editore:
Cambridge University Press, 2004
ISBN 10: 0521616107
ISBN 13: 9780521616102
Antico o usato
Paperback
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA79005216161076
Quantità: 1 disponibili
Foto dell'editore
Predicate Transformer Semantics
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 1st edition. 223 pages. 9.50x7.25x0.50 inches. In Stock. This item is printed on demand. Codice articolo __0521616107
Quantità: 1 disponibili
Foto dell'editore
Predicate Transformer Semantics (Paperback)
Editore:
Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616107
ISBN 13: 9780521616102
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521616102
Quantità: 1 disponibili
Immagini fornite dal venditore
Predicate Transformer Semantics
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: 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. Codice articolo 446942341
Quantità: Più di 20 disponibili
Foto dell'editore
Predicate Transformer Semantics (Paperback)
Editore:
Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616107
ISBN 13: 9780521616102
Nuovo
Paperback
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9780521616102
Quantità: 1 disponibili