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 inindustry. 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. INDICE: Basic Concepts and Background.- Decision Procedures for Propositional Logic.- Equalities and Uninterpreted Functions.- Decision Procedures for Equality Logic.- Linear Arithmetic.- Bit-Vectors.- Arrays.- Pointer Logic.- Quantified Formulas.- Deciding Combined Theories.- Propositional Encodings.- App.A, The SMT-LIB Initiative.- App. B, Programming a Decision Procedure.
- ISBN: 978-3-540-74104-6
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 335
- Fecha Publicación: 01/02/2008
- Nº Volúmenes: 1
- Idioma: Inglés