slides - Department of Computer Science

More documents

Recommendations

Info

Introduction to B and GSL (Cont.) • The developer write programs (machines) using Abstract Machine Notation (AMN) into the B-Toolkit. Simple machine written in AMN: VARIABLES xx, yy INVARIANT xx : NAT & yy : NAT INITIALISATION xx, yy := 0, 0 OPERATIONS
Introduction to B and GSL (Cont.) • The developer write programs (machines) using Abstract Machine Notation (AMN) into the B-Toolkit. Simple machine written in AMN: VARIABLES xx, yy INVARIANT xx : NAT & yy : NAT INITIALISATION xx, yy := 0, 0 OPERATIONS Increase = BEGIN xx := xx + 1 ‖ yy := yy + 1 test END END
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 15 and 16: Introduction to B and GSL (Cont.)
Page 17: 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 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 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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?