Program Proofs

This comprehensive and highly readable textbook teaches how to formally reason about computer programs using an incremental approach and the verification-aware programming language Dafny.

Auteur

K. Rustan M. Leino; illustrated by Kaleb Leino

Texte du rabat

"The book shows what it means to write specifications for programs, what it means for programs to satisfy those specifications, and how to write proofs that connect specifications and programs"--

Contenu

Preface ix
Notes for Teachers xv

0. Introduction 1
   Part 0. Learning the Ropes
1. Basics 9
2. Making It Formal 25
3. Recursion and Termination 63
4. Inductive Datatypes 83
5. Lemmas and Proofs 95
   Part 1. Functional Programs
6. Lists 137
7. Unary Numbers 161
8. Sorting 175
9. Abstraction 189
10. Data-Structure Invariants 207
    Part 2. Imperative Programs
11. Loops 235
12. Recursive Specifications, Iterative Programs 257
13. Arrays and Searching 275
14. Modifying Arrays 321
15. In-situ Sorting 337
16. Objects 351
17. Dynamic Heap Data Structures 387
    A. Dafny Syntax Cheat Sheet 427
    B. Boolean Algebra 433
    C. Answers to Select Exercises 445
    References 459
    Index 467