Programs, Recursion and Unbounded Choice

By: No Information Available

Write A Review

Paperback | 25 August 2005

At a Glance

Paperback
240 Pages

Dimensions(cm)
24.41 x 16.99 x 1.3

Paperback

RRP $89.95

$81.99

or 4 interest-free payments of $20.50 with

Ships in 5 to 7 business days

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

Industry Reviews

"...an excellent book to get acquainted with the ideas and methods of the program methodology community...It is clear, elegant and well-written. Every serious student of programming methodology should read this carefully, and serious researchers in the denotational semantics of unbounded indeterminacy would be well-rewarded by a study of this book." Prakesh Panangaden, SIGACT News "...would make a good text for an advanced graduate course on semantics or program specification and verification. There are sufficient exercises for self-study or for use in a course. It is clear, thorough, well written, and carefully conceived." Gary T. Leavens, SIAM Review "...of interest for theoretical computer scientists and mathematicians..." Mathematical Reviews

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Language & Linguistics Linguistics Semantics & Discourse Analysis Computing & I.T.Information Technology General Issue Ethical & Social Aspects of IT Computer Science Mathematical Theory of Computation Computer Programming & Software Development Software Engineering Programming & Scripting Languages

List of symbols
Introduction
Weakest preconditions
Annotation, recursion and repetition
Healthiness laws
Semantics of recursion
Ramifications
Relational semantics
Determinacy and disjunctivity
Syntactic criteria
Operational semantics of recursion
Procedure substitutions
Induction and semantic equality
Induction and refinement
The strong preorder
Temporal operators
Predicative fairness
Solutions of exercises
References
Index of concepts and identifiers
Table of Contents provided by Publisher. All Rights Reserved.

Programs, Recursion and Unbounded Choice

At a Glance

Paperback

Industry Reviews

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Statistical Atlases and Computational Models of the Heart. Regular and CMRxRecon Challenge Papers

16th International Workshop, STACOM 2025, Held in Conjunction with MICCAI 2025, Daejeon, South Korea, September 27, 2025, Revised Selected Papers

Advances in Computational Intelligence. MICAI 2025 International Workshops

HIS 2025, CIAPP 2025, WILE 2025, CHARAL 2025, ECSI 2025 Workshops, Guanajuato, Mexico, November 3â"7, 2025, Proceedings, Part I

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Discrete Mathematics for Computing

Grassroots

Effective Machine Learning Teams

Best Practices for ML Practitioners

AI Design

A Beginnerâs Guide to Building Intelligence Through Patterns

Beading With Algorithms

Cellular Automata In Peyote Stitch

Introduction to Machine Learning Algorithms

Basic Principles and Mathematics

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Theory of Computation for Software Developers

Nonlinear Analysis for Human Movement Variability

Mining Complex Networks

Advances in Applied Mathematics

Mining Complex Networks

Advances in Applied Mathematics

Why Don't Rabbits Rule the World?

Mathematical Answers to Life's Key Questions

Machine Learning with Julia

An Algorithmic Exploration

Applied Mathematics with F#

Pattern Recognition and Machine Learning for Self-Study I

Supervised Learning

Novel Deep Learning Methodologies in Industrial and Applied Mathematics

ICIAM2023 Springer Series

Rigorous Software Development

An Introduction to Program Verification

A Mathematical Introduction to Data Science with Python

Exploring Computational Geometry

Theory and Python Implementations

Hands-On Generative AI with Transformers and Diffusion Models

An Introduction to Metaheuristics for Optimization

Natural Computing Series

This product is categorised by