Authors:
- New edition of successful textbook
- Authors have expanded the chapter on propositional encodings, added further modern SAT heuristics, and added a chapter on the application of SMT for software engineering in industry
- Suitable for advanced undergraduate and graduate students and researchers in theoretical computer science and software engineering
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Theoretical Computer Science. An EATCS Series (TTCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Thefirst 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.
Reviews
Authors and Affiliations
-
Computing Laboratory, University of Oxford, Oxford, United Kingdom
Daniel Kroening
-
William Davidson Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel
Ofer Strichman
About the authors
Bibliographic Information
Book Title: Decision Procedures
Book Subtitle: An Algorithmic Point of View
Authors: Daniel Kroening, Ofer Strichman
Series Title: Texts in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-662-50497-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2016
Hardcover ISBN: 978-3-662-50496-3Published: 27 January 2017
Softcover ISBN: 978-3-662-57065-4Published: 13 July 2018
eBook ISBN: 978-3-662-50497-0Published: 22 November 2016
Series ISSN: 1862-4499
Series E-ISSN: 1862-4502
Edition Number: 2
Number of Pages: XXI, 356
Number of Illustrations: 59 b/w illustrations, 5 illustrations in colour
Topics: Theory of Computation, Software Engineering/Programming and Operating Systems, Optimization