Logic in Computer Science: Modelling and Reasoning about SystemsCambridge University Press, 26.08.2004 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. |
Andere Ausgaben - Alle anzeigen
Logic in Computer Science : Modelling and Reasoning about Systems Michael Huth Keine Leseprobe verfügbar - 2004 |
Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan Keine Leseprobe verfügbar - 2004 |
Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan Keine Leseprobe verfügbar - 2004 |
Häufige Begriffe und Wortgruppen
algorithm Alloy apply arguments assignment basic modal logic boolean formula boolean function boolean variables calculus chapter clause components computation path conjunction Consider CTL formula defined Definition denote equals evaluates example execution Exercises express fairness constraints Figure finite fixed point formula scheme function symbols given greatest fixed point holds iff implies infinitely input integer labelling logic formula mathematical induction means modal logic model checking module natural deduction natural numbers negation node NuSMV occur parse tree postcondition precondition predicate logic predicate symbols premises proof calculus proof rule propositional atoms propositional logic prove quantifiers reduced OBDD represented requires result SAT solver satisfies second-order logic semantic entailment sentence sequent specification structure subformulas subset terminates Theorem transition relation true truth table truth value valid valuation verify well-formed formula while-statement write
