Understanding Formal MethodsJean-Francois Monin, M.G. Hinchey This volume provides a comprehensive introduction to the field of formal methods for students and practitioners. It strikes a careful balance between rigorous exposition of the underlying mathematics and concrete examples of implementations using real-life tools, thus making it easy to grasp the underlying concepts and theories. It does not aim to provide guidelines for using a particular method, or comparisons of different approaches, but rather a conceptual framework that the reader can use to master any given method. It therefore makes an invaluable practical companion to introductory texts on logic and to books dedicated to a particular formal method. Understanding Formal Methods will be of interest to advanced students and engineers who need to learn the basics of this topic, and also professionals who need to broaden their knowledge or bring themselves up-to-date with the latest techniques. |
Contents
I | 1 |
II | 2 |
III | 3 |
IV | 4 |
VI | 5 |
VII | 6 |
IX | 7 |
X | 8 |
CXXIX | 124 |
CXXX | 125 |
CXXXII | 126 |
CXXXIV | 128 |
CXXXV | 129 |
CXXXVI | 130 |
CXXXVIII | 132 |
CXL | 133 |
XI | 9 |
XII | 10 |
XIII | 11 |
XIV | 12 |
XV | 15 |
XVII | 16 |
XVIII | 18 |
XX | 19 |
XXII | 20 |
XXIII | 22 |
XXV | 23 |
XXVI | 25 |
XXVIII | 27 |
XXIX | 31 |
XXX | 32 |
XXXI | 33 |
XXXIII | 35 |
XXXIV | 36 |
XXXV | 37 |
XXXVI | 38 |
XXXVII | 39 |
XXXVIII | 40 |
XXXIX | 41 |
XL | 43 |
XLI | 44 |
XLII | 45 |
XLIII | 46 |
XLV | 48 |
XLVI | 49 |
XLVII | 50 |
XLIX | 51 |
LI | 52 |
LII | 55 |
LIV | 57 |
LV | 58 |
LVI | 59 |
LVII | 61 |
LVIII | 62 |
LIX | 63 |
LX | 64 |
LXI | 65 |
LXIII | 66 |
LXIV | 67 |
LXV | 68 |
LXVI | 69 |
LXVIII | 70 |
LXIX | 72 |
LXX | 73 |
LXXI | 74 |
LXXII | 75 |
LXXIV | 76 |
LXXV | 78 |
LXXVI | 79 |
LXXVII | 80 |
LXXVIII | 81 |
LXXIX | 82 |
LXXX | 84 |
LXXXII | 85 |
LXXXIII | 87 |
LXXXIV | 89 |
LXXXV | 91 |
LXXXVI | 92 |
LXXXVII | 93 |
LXXXVIII | 94 |
LXXXIX | 95 |
XCII | 97 |
XCIII | 98 |
XCIV | 99 |
XCV | 100 |
XCVI | 101 |
XCVIII | 102 |
XCIX | 103 |
CII | 104 |
CIV | 105 |
CVI | 106 |
CVII | 107 |
CVIII | 109 |
CIX | 110 |
CXI | 111 |
CXIII | 112 |
CXV | 113 |
CXVII | 115 |
CXVIII | 116 |
CXIX | 117 |
CXX | 118 |
CXXI | 119 |
CXXIII | 120 |
CXXIV | 121 |
CXXV | 122 |
CXXVII | 123 |
CXLI | 134 |
CXLIII | 136 |
CXLIV | 137 |
CXLVI | 138 |
CXLVII | 141 |
CL | 142 |
CLI | 143 |
CLII | 144 |
CLIII | 146 |
CLVI | 147 |
CLVII | 149 |
CLVIII | 150 |
CLIX | 152 |
CLXI | 154 |
CLXII | 160 |
CLXIII | 161 |
CLXIV | 162 |
CLXV | 163 |
CLXVI | 164 |
CLXVII | 165 |
CLXVIII | 166 |
CLXIX | 168 |
CLXX | 169 |
CLXXI | 170 |
CLXXII | 175 |
CLXXIV | 176 |
CLXXVI | 177 |
CLXXVII | 178 |
CLXXVIII | 179 |
CLXXIX | 180 |
CLXXX | 181 |
CLXXXII | 182 |
CLXXXIII | 183 |
CLXXXIV | 184 |
CLXXXV | 186 |
CLXXXVI | 187 |
CLXXXVII | 189 |
CLXXXIX | 190 |
CXC | 191 |
CXCIV | 192 |
CXCVI | 193 |
CXCVIII | 194 |
CC | 195 |
CCI | 196 |
CCII | 197 |
CCIII | 198 |
CCIV | 199 |
CCV | 200 |
CCVII | 203 |
CCIX | 204 |
CCXI | 205 |
CCXII | 206 |
CCXIV | 207 |
CCXV | 211 |
CCXVI | 212 |
CCXVII | 213 |
CCXVIII | 214 |
CCXIX | 215 |
CCXX | 218 |
CCXXII | 219 |
CCXXV | 220 |
CCXXVI | 221 |
CCXXVIII | 222 |
CCXXIX | 223 |
CCXXX | 225 |
CCXXXI | 226 |
CCXXXII | 227 |
CCXXXIII | 228 |
CCXXXIV | 230 |
CCXXXVI | 231 |
CCXXXVII | 232 |
CCXXXVIII | 233 |
CCXXXIX | 234 |
CCXLI | 235 |
CCXLIII | 237 |
CCXLV | 238 |
CCXLVII | 239 |
CCXLIX | 240 |
CCL | 241 |
CCLII | 243 |
CCLIII | 244 |
CCLIV | 245 |
CCLV | 246 |
CCLVI | 248 |
CCLVII | 251 |
CCLIX | 253 |
| 255 | |
| 269 | |
Other editions - View all
Common terms and phrases
A-calculus abstract data type algebraic algorithm application arbitrary arithmetic assignment axiomatic axioms bool Boolean calculus called Cartesian product Chapter computer science concept consider construct constructors corresponding data structures defined definition denoted domain element encoded equivalent even(a example expression false finite first-order logic formal methods formula given higher-order logic hypothesis induction infinite number interpretation introduce intuitionistic intuitionistic logic intuitive invariant l₁ loop mathematical means model theory natural deduction natural integers natural numbers notation operations P₁ pair postcondition precondition predicate primitive recursive programming languages proof Prop properties propositional logic prove provides quantifiers recursive function represent rules satisfying schema semantics sequent sequent calculus set theory set-theoretic subset symbol techniques temporal logic term theorem total function trajectory transition relation transition system tree true truth value variables variant verifying well-founded relation X-term
Popular passages
Page 264 - ... Sixth annual symposium on Logic In Computer Science, 1991. 7. JW Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematischen Centrum, 413 Kruislaan, Amsterdam, 1980. 8. R. Milner. Calculi for synchrony and asynchrony.
Page 266 - L. Thery, Y. Bertot, and G. Kahn. Real theorem provers deserve real userinterfaces.
Page 262 - Information Processing Systems - Open Systems Interconnection - A Formal Description technique based on Extended State Transition Model. ISO/IEC 9074.
Page 261 - LNCS vol. 274, 1987. [Hal93] N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, 1993.
Page 257 - RS Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, volume F36 of NATO ASI Series, pages 5-42. Springer-Verlag, 1987.