Cantitate/Preț
Produs
Total produse
Vezi coșul
Formal Methods, Informally de Carroll Morgan

Formal Methods, Informally

Autor Carroll Morgan
en Limba Engleză Hardback – 19 feb 2026
Both beginning- and experienced programmers can improve the quality of their programming with this informal textbook. The author draws on decades of teaching and industrial experience to explain how to write correct, concise programs - without formal logic. Examples focus on small, understandable programs; and over 200 exercises are included.
Citește tot Restrânge

Preț: 73271 lei

Preț vechi: 91589 lei
-20%

Puncte Express: 1099
Paperback 34037 lei
Hardback 73271 lei

Carte tipărită la comandă

Livrare economică 30 noiembrie-14 decembrie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9781009420990
ISBN-10: 1009420992
Pagini: 374
Dimensiuni: 175 x 250 x 29 mm
Greutate: 1.13 kg
Editura: Cambridge University Press

Notă biografică

Carroll Morgan has been an innovator, educator and researcher in computer science for his whole career: first in industry, then as Lecturer and Fellow at the University of Oxford, and finally as Professor at the University of New South Wales. He is best known for his pioneering work in systematic- and correctness-oriented methods of writing computer programs and systems, and especially for his text Programming from Specifications. He is a member of IFIPWorking Groups 1.3, 1.7, 2.1 and 2.3 and received (jointly) the 'Best Cybersecurity Paper of the Year' award from the National Security Agency in 2015.

Cuprins

Preface; Part I. Everyday Programs: 1. Programs that work; 2. Using invariants to design loops; 3. Finding invariants; 4. Finding variants; 5. Checking assignments and conditionals; 6. Summary of Part I; Part II. Data Structures and Their Encapsulation: 1. Introduction to Part II; 2. Coupling invariants; 3. Case study in coupling invariants: Fibonacci numbers; 4. Encapsulated data-types: how exactly is it done?; 5. Case study: the Mean Calculator; 6. Summary of Part II; Part III. Concurrency - and How to Check It: 1. What is 'concurrency'?; 2. The Owicki-Gries method; 3. Critical sections with Owicki-Gries; 4. Peterson's algorithm for mutual exclusion; 5. Garbage collection on the fly; Part IV. Machine-Assisted Program Checking, and Testing: 1. Machine-assisted program checking; 2. Program testing; Afterword; Appendices; A. Drill exercises; B. Summary of rules for checking programs; C. Data refinement: the real story; D. The 'arithmetic' of conditions; E. Some helpful logical identities; F. Illustration of heap behaviour during garbage collection; G. Python-specific issues; H. Answers to selected drills; I. Answers to selected exercises; Bibliography; Index.