Predicate Transformer Semantics

Ernest G. Manes

ISBN 10: 0521616107 / ISBN 13: 9780521616102

Published by Cambridge University Press, 2004

About this Item

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.

Seller Inventory # 9780521616102

Bibliographic Details

• Title: Predicate Transformer Semantics
• Publisher: Cambridge University Press
• Publication Date: 2004
• Language: English
• ISBN 10: 0521616107
• ISBN 13: 9780521616102
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 246W x 189H x 13D millimeters 246 millimeters width by 189 millimeters height by 13 millimeters depth
• Weight: 465 grams

About this title

Synopsis

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.

Book Description

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.