Advertisement

Decision Procedures

An Algorithmic Point of View

  • Daniel Kroening
  • Ofer Strichman

Table of contents

  1. Front Matter
    Pages I-XXI
  2. Daniel Kroening, Ofer Strichman
    Pages 1-25
  3. Daniel Kroening, Ofer Strichman
    Pages 27-58
  4. Daniel Kroening, Ofer Strichman
    Pages 59-76
  5. Daniel Kroening, Ofer Strichman
    Pages 77-95
  6. Daniel Kroening, Ofer Strichman
    Pages 97-133
  7. Daniel Kroening, Ofer Strichman
    Pages 135-156
  8. Daniel Kroening, Ofer Strichman
    Pages 157-172
  9. Daniel Kroening, Ofer Strichman
    Pages 173-198
  10. Daniel Kroening, Ofer Strichman
    Pages 199-227
  11. Daniel Kroening, Ofer Strichman
    Pages 229-244
  12. Daniel Kroening, Ofer Strichman
    Pages 245-280
  13. Daniel Kroening, Ofer Strichman
    Pages 281-307
  14. Back Matter
    Pages 309-356

About this book

Introduction

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 SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.

The first edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP).  The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.

Each chapter includes a detailed bibliography and exercises. Lecturers’ slides and a C++ library for rapid prototyping of decision procedures are available from the authors’ website.

Keywords

Decision Procedures Propositional Logic Pointer Logic Boolean Satisfiability Solver (SAT) Quantified Formulas Satisfiability Modulo Theories (SMT) Constraint Satisfaction Problem (CSP)

Authors and affiliations

  • Daniel Kroening
    • 1
  • Ofer Strichman
    • 2
  1. 1.Computing LaboratoryUniversity of OxfordOxfordUnited Kingdom
  2. 2.William Davidson Faculty of Industrial Engineering and ManagementTechnion - Israel Institute of TechnologyHaifaIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-50497-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2016
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-50496-3
  • Online ISBN 978-3-662-50497-0
  • Series Print ISSN 1862-4499
  • Buy this book on publisher's site