Logic in Computer Science: Modelling and Reasoning about SystemsCambridge University Press, 2000 - 387 страница Recent years have seen the development of powerful tools for verifying hardware and software systems, and increasing interest in that technology from major companies. Students need a basic formal training which allows them to gain sufficient proficiency in using logic-based verification methods. This book addresses these needs by providing a sound basis in logic, and an introduction to the logical frameworks used in modelling, specifying and verifying computer systems. It provides a simple and clear presentation, covering propositional and predicate logic, and some specialised logics used for reasoning about the correctness of computer systems. The authors introduce a carefully chosen core of essential terminology: further technicalities are introduced only when necessary. Numerous examples are given, as well as a full exposition of a fast-growing technique for modelling and verifying computer systems, known as symbolic model checking. Numerous examples are given, and web support is available from http:www.cs.bham.ac.uk/research/lics. |
Садржај
Program verification 216 | 215 |
Modal logics and agents | 261 |
Binary decision diagrams 316 | 311 |
375 | |
Друга издања - Прикажи све
Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan Приказ није доступан - 1999 |
Чести термини и фразе
algorithm apply arguments assignment assumption basic modal logic Binary decision diagrams binary decision tree boolean formula boolean function boolean variables chapter compute conjunctive normal forms CTL formula CTL model decision tree define Definition denote disjunction evaluates example EXERCISES Figure formula scheme function symbols ƒ and g given holds Horn formula If-Statement IMPL FREE IMPL_FREE implies induction hypothesis input integer invariant labelling mathematical induction means modal logic model checking natural deduction natural numbers negation node parse tree path postcondition precondition predicate logic premise problem proof calculus proof rule propositional atoms propositional logic prove quantifier real numbers reduced OBDD representing satisfies semantic entailment sentence sequent structure subformula subtree syntactic terminates Theorem true truth table truth values valid verify Vx P(x well-formed formula while-statement write xo/x