Doprava zdarma se Zásilkovnou nad 1 499 Kč

PPL Parcel Shop 54 Kč Balík do ruky 74 Kč Balíkovna 49 Kč GLS 54 Kč Kurýr GLS 74 Kč Zásilkovna 49 Kč PPL 99 Kč

Kontakt

Jak nakupovat

Pomoc

Můj účet

▸ Prázdný :-(

Programs, Recursion and Unbounded Choice

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

Wim H. Hesselink

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 02017941

Nakladatelství Cambridge University Press, srpna 2005

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

Libristo kód: 02017941

152 b

1 523 Kč včetně DPH

Skladem u dodavatele Odesíláme za 15-20 dnů

30 dní na vrácení zboží

Zákazníci také koupili

Dialogue and Instruction, 1 Robbert-Jan Beun

/ Brožovaná

1 540 Kč

Reception Studies Lorna Hardwick

/ Brožovaná

860 Kč

Virtue Ethics and Professional Roles Justin OakleyDean Cocking

/ Brožovaná

1 629 Kč

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.