Magnificent Marvel Supersale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Lists | March 2, 2015

    Anna Lyndsey: IMG My Top 10 Talking Books



    I have always been a reader, but eight years ago, strange circumstances conspired to make me totally book-dependent. I was stuck within four walls,... Continue »

    spacer
Qualifying orders ship free.
$72.50
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Software Engineering- General

Programs, Recursion and Unbounded Choice

by

Programs, Recursion and Unbounded Choice Cover

 

Synopses & Reviews

Publisher Comments:

Predicate transformation semantics is the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction, and unbounded nondeterminacy. The author develops their theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming methodology. He gives proofs of the 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.

Synopsis:

Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy, developed by the author to a greater depth than has been achieved before.

Synopsis:

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

Table of Contents

List of symbols; Introduction; 1. Weakest preconditions; 2. Annotation, recursion and repetition; 3. Healthiness laws; 4. Semantics of recursion; 5. Ramifications; 6. Relational semantics; 7. Determinacy and disjunctivity; 8. Syntactic criteria; 9. Operational semantics of recursion; 10. Procedure substitutions; 11. Induction and semantic equality; 12. Induction and refinement; 13. The strong preorder; 14. Temporal operators; 15. Predicative fairness; 16. Solutions of exercises; References; Index of concepts and identifiers.

Product Details

ISBN:
9780521018296
Editor:
Van Rijsbergen, C. J.
Editor:
Abramsky, Samson
Editor:
Abramsky, Samson
Editor:
Van Rijsbergen, C. J.
Editor:
Abramsky, S.
Author:
Wim H., Hesselink
Author:
Hesselink, Wim H.
Publisher:
Cambridge University Press
Location:
Cambridge
Subject:
Programming - General
Subject:
Programming - Software Development
Subject:
Computer programming
Subject:
Computer programming Computer programming
Subject:
Programming Languages - General
Subject:
Software Development & Engineering - General
Subject:
Software Engineering-General
Edition Description:
Trade paper
Series:
Cambridge Tracts in Theoretical Computer Science
Series Volume:
27
Publication Date:
20050531
Binding:
TRADE PAPER
Grade Level:
Professional and scholarly
Language:
English
Pages:
240
Dimensions:
6.69x9.60x.50 in. .85 lbs.

Related Subjects

Computers and Internet » Software Engineering » General
Computers and Internet » Software Engineering » Programming and Languages
Science and Mathematics » History of Science » General

Programs, Recursion and Unbounded Choice New Trade Paper
0 stars - 0 reviews
$72.50 In Stock
Product details 240 pages Cambridge University Press - English 9780521018296 Reviews:
"Synopsis" by , Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy, developed by the author to a greater depth than has been achieved before.
"Synopsis" by , A complete account of the predicate transformation calculus semantics of sequential programs.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.