VDM-10 Language Manual

More documents

Recommendations

Info

$Course Material\Efficiently Coding Communication Protocols in C++ ...$

VDM-10 Language Manual ✡✝ (sc.points > sc’.points) or (sc.points = sc’.points and sc.won > sc’.won)).team) -- no outright winner, so choose random score -- from joint top scores else RandomElement ( {sc.team | sc in set gps(gp) & forall sc’ in set gps(gp) & sc’.points Team GroupWinner_cases (gp) == cases true: (clear_winner(gps(gp))) -> return ((iota sc in set gps(gp) & forall sc’ in set gps(gp) \ {sc} & sc.points > sc’.points).team), (winner_by_more_wins(gps(gp))) -> return ((iota sc in set gps(gp) & forall sc’ in set gps(gp) \ {sc} & (sc.points > sc’.points) or (sc.points = sc’.points and sc.won > sc’.won)).team), ✡✝ others -> RandomElement ( {sc.team | sc in set gps(gp) & forall sc’ in set gps(gp) & sc’.points
Chapter 13. Statements ‘do’, statement ; set for loop = ‘for’, ‘all’, pattern, ‘in set’, expression, ‘do’, statement ; index for loop = ‘for’, identifier, ‘=’, expression, ‘to’, expression, [ ‘by’, expression ], ‘do’, statement ; Semantics: There are three kinds of for-loop statements. The for-loop using an index is known from most high-level programming languages. In addition, there are two for-loops for traversing sets and sequences. These are especially useful if access to all elements from a set (or sequence) is needed one by one. An index for-loop statement has the form: ✞ ✡✝ for id = e1 to e2 by e3 do s where id is an identifier, e1 and e2 are integer expressions indicating the lower and upper bounds for the loop, e3 is an integer expression indicating the step size, and s is a statement where the identifier id can be used. It denotes the evaluation of the statement s as a sequence statement where the current context is extended with a binding of id. Thus, the first time s is evaluated id is bound to the value returned from the evaluation of the lower bound e1 and so forth until the upper bound is reached ie. until s > e2 . Note that e1, e2 and e3 are evaluated before entering the loop. A set for-loop statement has the form: ✞ ✡✝ for all e in set S do s where S is a set expression. The statement s is evaluated in the current environment extended with a binding of e to subsequent values from the set S. A sequence for-loop statement has the form: ✞ ✡✝ for e in l do s where l is a sequence expression. The statement s is evaluated in the current environment extended with a binding of e to subsequent values from the sequence l. 107 ✆ ✆ ✆
Page 1 and 2:
Overture - Open-source Tools for Fo
Page 3 and 4:
Contents 1 Introduction 1 1.1 The V
Page 5 and 6:
CONTENTS 13 Statements 97 13.1 Let
Page 7 and 8:
CONTENTS A.7.19 The Undefined Expre
Page 9 and 10:
Chapter 1 Introduction The Vienna D
Page 11 and 12:
Chapter 2 Concrete Syntax Notation
Page 13 and 14:
Chapter 3 Data Type Definitions As
Page 15 and 16:
Chapter 3. Data Type Definitions We
Page 17 and 18:
Chapter 3. Data Type Definitions Op
Page 19 and 20:
Chapter 3. Data Type Definitions (a
Page 21 and 22:
Chapter 3. Data Type Definitions
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Chapter 3. Data Type Definitions m1
Page 31 and 32:
Chapter 3. Data Type Definitions Sy
Page 33 and 34:
Chapter 3. Data Type Definitions Th
Page 35 and 36:
Page 37 and 38:
Chapter 3. Data Type Definitions to
Page 39 and 40:
Page 41 and 42:
Chapter 4 Algorithm Definitions In
Page 43 and 44:
Chapter 5 Function Definitions In t
Page 45 and 46:
Chapter 5. Function Definitions Not
Page 47 and 48:
Chapter 5. Function Definitions Thi
Page 49 and 50:
Chapter 6 Expressions In this subse
Page 51 and 52:
Chapter 6. Expressions ✡✝ mk_Sc
Page 53 and 54:
Chapter 6. Expressions Examples: Th
Page 55 and 56:
Chapter 6. Expressions where e1 is
Page 57 and 58:
Chapter 6. Expressions all expressi
Page 59 and 60:
Chapter 6. Expressions where bd is
Page 61 and 62:
Chapter 6. Expressions 6.8 Sequence
Page 63 and 64: Chapter 6. Expressions where all th
Page 65 and 66: Chapter 6. Expressions mu operator.
Page 67 and 68: Chapter 6. Expressions new expressi
Page 69 and 70: Chapter 6. Expressions Examples: Us
Page 71 and 72: Chapter 6. Expressions which will r
Page 73 and 74: Chapter 6. Expressions Examples: As
Page 75 and 76: Chapter 6. Expressions • #active(
Page 77 and 78: Chapter 6. Expressions ✞ state si
Page 79 and 80: Chapter 6. Expressions Semantics: A
Page 81 and 82: Chapter 7 Patterns Syntax: pattern
Page 83 and 84: Chapter 7. Patterns In the followin
Page 85 and 86: Chapter 7. Patterns ✡✝ ✆ The
Page 87 and 88: Chapter 8 Bindings Syntax: bind = s
Page 89 and 90: Chapter 9 Value (Constant) Definiti
Page 91 and 92: Chapter 10 Instance Variables (VDM+
Page 93 and 94: Chapter 11 The State Definition (VD
Page 95 and 96: Chapter 11. The State Definition (V
Page 97 and 98: Chapter 12 Operation Definitions Op
Page 99 and 100: Chapter 12. Operation Definitions s
Page 101 and 102: Chapter 12. Operation Definitions p
Page 103 and 104: Chapter 12. Operation Definitions h
Page 105 and 106: Chapter 13 Statements In this secti
Page 107 and 108: Chapter 13. Statements ✡✝ def t
Page 109 and 110: Chapter 13. Statements block return
Page 111 and 112: Chapter 13. Statements Examples: Th
Page 113: Chapter 13. Statements elseif state
Page 117 and 118: Chapter 13. Statements 13.7 The Whi
Page 119 and 120: Chapter 13. Statements ✡✝ (dcl
Page 121 and 122: Chapter 13. Statements ✞ ✡✝ R
Page 123 and 124: Chapter 13. Statements where expres
Page 125 and 126: Chapter 13. Statements result of th
Page 127 and 128: Chapter 13. Statements ✡✝ else
Page 129 and 130: Chapter 13. Statements ✞ bootSequ
Page 131 and 132: Chapter 13. Statements ✞ op1 : na
Page 133 and 134: Chapter 14 Top-level Specification
Page 135 and 136: Chapter 14. Top-level Specification
Page 145 and 146: Chapter 15 Synchronization Constrai
Page 147 and 148: Chapter 15. Synchronization Constra
Page 153 and 154: Chapter 16 Threads (VDM++ and VDM-R
Page 155 and 156: Chapter 16. Threads (VDM++ and VDM-
Page 157 and 158: Chapter 16. Threads (VDM++ and VDM-
Page 159 and 160: Chapter 17 Top-level Specification
Page 165 and 166:
Chapter 17. Top-level Specification
Page 167 and 168:
Chapter 17. Top-level Specification
Page 169 and 170:
Chapter 18 Trace Definitions In ord
Page 171 and 172:
Chapter 18. Trace Definitions stack
Page 173 and 174:
Chapter 19 Static Semantics VDM spe
Page 175 and 176:
Chapter 20 Scope Conflicts (VDM++ a
Page 177 and 178:
References [Ada LRM] [Bicarregui&94
Page 179 and 180:
Chapter 20. Scope Conflicts (VDM++
Page 181 and 182:
Appendix A The Syntax of the VDM La
Page 183 and 184:
Appendix A. The Syntax of the VDM L
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Appendix B Lexical Specification B.
Page 209 and 210:
Appendix B. Lexical Specification B
Page 211 and 212:
Appendix B. Lexical Specification S
Page 213 and 214:
Appendix C Operator Precedence The
Page 215 and 216:
Appendix C. Operator Precedence eva
Page 217 and 218:
Appendix C. Operator Precedence pre
Page 219 and 220:
Appendix D Differences between the
Page 221 and 222:
Index abs, 9 and, 6 card, 14 comp f
Page 223 and 224:
INDEX arithmetic minus, 185 arithme
Page 225 and 226:
INDEX boolean type, 6 char, 11 func
Page 227 and 228:
INDEX sequence enumeration, 53, 187
show all

VDM-10 Language Manual

Create successful ePaper yourself

Delete template?

Save as template?