Logic in Computer Science: Modelling and Reasoning about Systems
Recent years have seen the development of powerful tools for verifying hardware and software systems, as companies worldwide realise the need for improved means of validating their products. There is increasing demand for training in basic methods in formal reasoning so that students can gain proficiency in logic-based verification methods. The second edition of this successful textbook addresses both those requirements, by continuing to provide a clear introduction to formal reasoning which is both relevant to the needs of modern computer science and rigorous enough for practical application. Improvements to the first edition have been made throughout, with extra and expanded sections on SAT solvers, existential/universal second-order logic, micro-models, programming by contract and total correctness. The coverage of model-checking has been substantially updated. Further exercises have been added. Internet support for the book includes worked solutions for all exercises for teachers, and model solutions to some exercises for students.
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Otras ediciones - Ver todas
algorithm apply arguments assignment basic modal logic boolean formula boolean function calculus chapter clauses components computation paths conjunction conjunctive normal form connectives Consider correctness CTL formula defined Definition denote equals evaluates example execution Exercises express fairness constraints Figure finite fixed point formula scheme function symbols given graph greatest fixed point holds implies infinitely input integer labelling logical formula mathematical induction means modal logic model checking natural deduction natural numbers negation node NuSMV ofthe ordering parse tree postcondition precondition predicate logic predicate symbol premises Proof calculus proof rule propositional atoms propositional logic prove quantifier reduced OBDD represented result satisfies semantic entailment sentence sequent specification structure subformulas subset terminates thatthe Theorem transition relation true truth table truth value valid valuation verify wellformed formula whilestatement write