Book Details
Orange Code:87160
Paperback:312 pages
Publications:
Categories:
Sections:
1. Introduction and Basic Concepts2. Decision Procedures for Propositional Logic3. Equality Logic and Uninterpreted Functions4. Decision Procedures for Equality Logic and Uninterpreted Functions5. Linear Arithmetic6. Bit Vectors7. Arrays8. Pointer Logic9. Quantified Formulas10. Deciding a Combination of Theories11. Propositional Encodings
Description:
|
A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry. The authors introduce the basic terminology of satisfiability modulo theories and then, in separate chapters, study decision procedures for each of the following theories: propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas.
|
