slides - Department of Computer Science

More documents

Recommendations

Info

Pro<strong>of</strong> obligation for Increase operation • Rule for probabilistic choice substitution. [S p ⊕ T ]R ≡ p × [S]R + (1 − p) × [T ]R
Pro<strong>of</strong> obligation for Increase operation • Rule for probabilistic choice substitution. [S p ⊕ T ]R ≡ p × [S]R + (1 − p) × [T ]R • Arithmetic with Real number.
Page 1 and 2: School of Computer Science & Engine
Page 3 and 4: 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 21 and 22: 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 and 40: Proof obligations generator The rul
Page 41 and 42: Proof obligation for initialisation
Page 43: Proof obligation for Increase opera
Page 47 and 48: 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

slides - Department of Computer Science

Create successful ePaper yourself

Delete template?

Save as template?