Programs, Recursion and Unbounded Choice

Name: Programs, Recursion and Unbounded Choice
Brand: Cambridge University Press
SKU: 9780521018296
Price: 61.04 EUR
Availability: InStock

Автор: Wim H. Hesselink

Език:

Корици: С меки корици

Издател: Cambridge University Press

Наличност: Външен склад

Изпращаме след 9-15 дни

61.04 € 119.38 лв

This book is a complete account of the predicate transformation calculus semantics of sequential pro...

Информация за книгата

Автор

Wim H. Hesselink

Език

Английски език

Корици

Книга - С меки корици

Издадена

2005

страници

240

EAN

9780521018296

ISBN

0521018293

Enbook ID

02017941

Издател

Cambridge University Press

Теглоt

385

Размери

170 x 245 x 12

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Programs, Recursion and Unbounded Choice

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също