slides - Department of Computer Science
slides - Department of Computer Science slides - Department of Computer Science
from inf.ethz.ch
More from this publisher
29.01.2014
Views
Proof obligation for initialisation
Proof obligation for initialisation Proving by using pB’s rules: [xx, yy := 0, 0]xx ∈ N ∧ yy ∈ N ∧ expectation(yy − 2 × xx) ≡ 0 ∈ N ∧ 0 ∈ N ∧ expectation(0)
- Page 1 and 2: School of Computer Science & Engine
- Page 3 and 4: Outline • A brief introduction to
- Page 5 and 6: Outline • A brief introduction to
- Page 7 and 8: Outline • A brief introduction to
- Page 9 and 10: Introduction to B and GSL
- Page 11 and 12: Introduction to B and GSL • B-Met
- Page 13 and 14: Introduction to B and GSL (Cont.)
- Page 15 and 16: Introduction to B and GSL (Cont.)
- Page 17 and 18: Introduction to B and GSL (Cont.)
- Page 19 and 20: Introduction to B and GSL (Cont.)
- Page 21 and 22: Introduction to pGSL • pGSL is th
- Page 23 and 24: Introduction to pGSL • pGSL is th
- Page 25 and 26: Introduction to pGSL • pGSL is th
- Page 27 and 28: New pB construct • pGSL: Probabil
- Page 29 and 30: Example of probabilistic Number
- Page 31 and 32: Example of probabilistic Number A m
- Page 33 and 34: Example of probabilistic Number A m
- Page 35 and 36: Example of probabilistic Number (Co
- Page 37 and 38: Proof obligations generator
- Page 39: Proof obligations generator The rul
- Page 43 and 44: Proof obligation for Increase opera
- Page 45 and 46: Proof obligation for Increase opera
- Page 47 and 48: Modifying the B-Toolkit • Interna
- Page 49 and 50: Modifying the B-Toolkit • Interna
- Page 51 and 52: Modifying the B-Toolkit • Interna
- Page 53 and 54: Case studies
- Page 55 and 56: Case studies • Random algorithms.
- Page 57 and 58: Conclusion • The introduction of
- Page 59: Conclusion • The introduction of
Pro<strong>of</strong> obligation for initialisation
Change language