## Logic in Computer Science: Modelling and Reasoning about SystemsRecent 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Verification by model checking 148 | 204 |

Program verification | 230 |

Modal logics and agents | 261 |

Binary decision diagrams | 316 |

378 | |

### Other editions - View all

Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan Limited preview - 2004 |

Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan No preview available - 2000 |

Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan No preview available - 2004 |

### Common terms and phrases

agent Q algorithm apply arguments assignment assumption basic modal logic Binary decision diagrams binary decision tree boolean formula boolean function boolean variables calculus chapter compute conjunctive normal forms Consider critical section CTL formula CTL model define Definition denote disjunction example EXERCISES express Figure formal formula scheme function symbols given holds Horn formula If-Statement IMPL_FREE implies induction hypothesis input integer invariant logic formula mathematical induction means modal logic model checking model Jt 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 recursive reduced OBDD representation representing satisfies semantic entailment sentence sequent structure subformula subset subtree syntactic terminates Theorem transition relation true truth table truth values valid verify well-formed formula while-statement write