Programs, Recursion and Unbounded Choice

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

Autor: Wim H. Hesselink

Jazyk:

Vazba: Brožovaná

Vydavatel: Cambridge University Press

Dostupnost: Skladem u dodavatele

Odesíláme za 9-15 dnů

1 409 Kč

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

Informace o knize

Autor

Wim H. Hesselink

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

2005

Stránek

240

EAN

9780521018296

ISBN

0521018293

Enbook ID

02017941

Vydavatel

Cambridge University Press

Hmotnost

385

Rozměry

170 x 245 x 12

Kompletní popis

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.

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Programs, Recursion and Unbounded Choice

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také